Home | History | Annotate | Line # | Download | only in uvm
uvm_map.c revision 1.269
      1  1.269      yamt /*	$NetBSD: uvm_map.c,v 1.269 2009/01/13 14:04:35 yamt Exp $	*/
      2    1.1       mrg 
      3   1.98       chs /*
      4    1.1       mrg  * Copyright (c) 1997 Charles D. Cranor and Washington University.
      5   1.98       chs  * Copyright (c) 1991, 1993, The Regents of the University of California.
      6    1.1       mrg  *
      7    1.1       mrg  * All rights reserved.
      8    1.1       mrg  *
      9    1.1       mrg  * This code is derived from software contributed to Berkeley by
     10    1.1       mrg  * The Mach Operating System project at Carnegie-Mellon University.
     11    1.1       mrg  *
     12    1.1       mrg  * Redistribution and use in source and binary forms, with or without
     13    1.1       mrg  * modification, are permitted provided that the following conditions
     14    1.1       mrg  * are met:
     15    1.1       mrg  * 1. Redistributions of source code must retain the above copyright
     16    1.1       mrg  *    notice, this list of conditions and the following disclaimer.
     17    1.1       mrg  * 2. Redistributions in binary form must reproduce the above copyright
     18    1.1       mrg  *    notice, this list of conditions and the following disclaimer in the
     19    1.1       mrg  *    documentation and/or other materials provided with the distribution.
     20    1.1       mrg  * 3. All advertising materials mentioning features or use of this software
     21    1.1       mrg  *    must display the following acknowledgement:
     22    1.1       mrg  *	This product includes software developed by Charles D. Cranor,
     23   1.98       chs  *      Washington University, the University of California, Berkeley and
     24    1.1       mrg  *      its contributors.
     25    1.1       mrg  * 4. Neither the name of the University nor the names of its contributors
     26    1.1       mrg  *    may be used to endorse or promote products derived from this software
     27    1.1       mrg  *    without specific prior written permission.
     28    1.1       mrg  *
     29    1.1       mrg  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     30    1.1       mrg  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     31    1.1       mrg  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     32    1.1       mrg  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     33    1.1       mrg  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     34    1.1       mrg  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     35    1.1       mrg  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     36    1.1       mrg  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     37    1.1       mrg  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     38    1.1       mrg  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     39    1.1       mrg  * SUCH DAMAGE.
     40    1.1       mrg  *
     41    1.1       mrg  *	@(#)vm_map.c    8.3 (Berkeley) 1/12/94
     42    1.3       mrg  * from: Id: uvm_map.c,v 1.1.2.27 1998/02/07 01:16:54 chs Exp
     43    1.1       mrg  *
     44    1.1       mrg  *
     45    1.1       mrg  * Copyright (c) 1987, 1990 Carnegie-Mellon University.
     46    1.1       mrg  * All rights reserved.
     47   1.98       chs  *
     48    1.1       mrg  * Permission to use, copy, modify and distribute this software and
     49    1.1       mrg  * its documentation is hereby granted, provided that both the copyright
     50    1.1       mrg  * notice and this permission notice appear in all copies of the
     51    1.1       mrg  * software, derivative works or modified versions, and any portions
     52    1.1       mrg  * thereof, and that both notices appear in supporting documentation.
     53   1.98       chs  *
     54   1.98       chs  * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
     55   1.98       chs  * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
     56    1.1       mrg  * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
     57   1.98       chs  *
     58    1.1       mrg  * Carnegie Mellon requests users of this software to return to
     59    1.1       mrg  *
     60    1.1       mrg  *  Software Distribution Coordinator  or  Software.Distribution (at) CS.CMU.EDU
     61    1.1       mrg  *  School of Computer Science
     62    1.1       mrg  *  Carnegie Mellon University
     63    1.1       mrg  *  Pittsburgh PA 15213-3890
     64    1.1       mrg  *
     65    1.1       mrg  * any improvements or extensions that they make and grant Carnegie the
     66    1.1       mrg  * rights to redistribute these changes.
     67    1.1       mrg  */
     68    1.1       mrg 
     69  1.114     lukem /*
     70  1.114     lukem  * uvm_map.c: uvm map operations
     71  1.114     lukem  */
     72  1.114     lukem 
     73  1.114     lukem #include <sys/cdefs.h>
     74  1.269      yamt __KERNEL_RCSID(0, "$NetBSD: uvm_map.c,v 1.269 2009/01/13 14:04:35 yamt Exp $");
     75  1.114     lukem 
     76   1.21  jonathan #include "opt_ddb.h"
     77    1.6       mrg #include "opt_uvmhist.h"
     78  1.169    petrov #include "opt_uvm.h"
     79   1.31      tron #include "opt_sysv.h"
     80    1.1       mrg 
     81    1.1       mrg #include <sys/param.h>
     82    1.1       mrg #include <sys/systm.h>
     83    1.1       mrg #include <sys/mman.h>
     84    1.1       mrg #include <sys/proc.h>
     85    1.1       mrg #include <sys/malloc.h>
     86   1.25   thorpej #include <sys/pool.h>
     87  1.104       chs #include <sys/kernel.h>
     88  1.112   thorpej #include <sys/mount.h>
     89  1.109   thorpej #include <sys/vnode.h>
     90  1.244      yamt #include <sys/lockdebug.h>
     91  1.248        ad #include <sys/atomic.h>
     92    1.1       mrg 
     93    1.1       mrg #ifdef SYSVSHM
     94    1.1       mrg #include <sys/shm.h>
     95    1.1       mrg #endif
     96    1.1       mrg 
     97    1.1       mrg #include <uvm/uvm.h>
     98   1.21  jonathan 
     99   1.21  jonathan #ifdef DDB
    100   1.21  jonathan #include <uvm/uvm_ddb.h>
    101   1.21  jonathan #endif
    102   1.21  jonathan 
    103  1.258        ad #if !defined(UVMMAP_COUNTERS)
    104  1.207      yamt 
    105  1.207      yamt #define	UVMMAP_EVCNT_DEFINE(name)	/* nothing */
    106  1.207      yamt #define UVMMAP_EVCNT_INCR(ev)		/* nothing */
    107  1.207      yamt #define UVMMAP_EVCNT_DECR(ev)		/* nothing */
    108  1.207      yamt 
    109  1.207      yamt #else /* defined(UVMMAP_NOCOUNTERS) */
    110  1.207      yamt 
    111  1.228      yamt #include <sys/evcnt.h>
    112  1.207      yamt #define	UVMMAP_EVCNT_DEFINE(name) \
    113  1.207      yamt struct evcnt uvmmap_evcnt_##name = EVCNT_INITIALIZER(EVCNT_TYPE_MISC, NULL, \
    114  1.207      yamt     "uvmmap", #name); \
    115  1.207      yamt EVCNT_ATTACH_STATIC(uvmmap_evcnt_##name);
    116  1.207      yamt #define	UVMMAP_EVCNT_INCR(ev)		uvmmap_evcnt_##ev.ev_count++
    117  1.207      yamt #define	UVMMAP_EVCNT_DECR(ev)		uvmmap_evcnt_##ev.ev_count--
    118  1.207      yamt 
    119  1.207      yamt #endif /* defined(UVMMAP_NOCOUNTERS) */
    120  1.207      yamt 
    121  1.207      yamt UVMMAP_EVCNT_DEFINE(ubackmerge)
    122  1.207      yamt UVMMAP_EVCNT_DEFINE(uforwmerge)
    123  1.207      yamt UVMMAP_EVCNT_DEFINE(ubimerge)
    124  1.207      yamt UVMMAP_EVCNT_DEFINE(unomerge)
    125  1.207      yamt UVMMAP_EVCNT_DEFINE(kbackmerge)
    126  1.207      yamt UVMMAP_EVCNT_DEFINE(kforwmerge)
    127  1.207      yamt UVMMAP_EVCNT_DEFINE(kbimerge)
    128  1.207      yamt UVMMAP_EVCNT_DEFINE(knomerge)
    129  1.207      yamt UVMMAP_EVCNT_DEFINE(map_call)
    130  1.207      yamt UVMMAP_EVCNT_DEFINE(mlk_call)
    131  1.207      yamt UVMMAP_EVCNT_DEFINE(mlk_hint)
    132  1.263      matt UVMMAP_EVCNT_DEFINE(mlk_list)
    133  1.263      matt UVMMAP_EVCNT_DEFINE(mlk_tree)
    134  1.263      matt UVMMAP_EVCNT_DEFINE(mlk_treeloop)
    135  1.263      matt UVMMAP_EVCNT_DEFINE(mlk_listloop)
    136  1.169    petrov 
    137  1.208      yamt UVMMAP_EVCNT_DEFINE(uke_alloc)
    138  1.208      yamt UVMMAP_EVCNT_DEFINE(uke_free)
    139  1.208      yamt UVMMAP_EVCNT_DEFINE(ukh_alloc)
    140  1.208      yamt UVMMAP_EVCNT_DEFINE(ukh_free)
    141  1.208      yamt 
    142   1.87     enami const char vmmapbsy[] = "vmmapbsy";
    143    1.1       mrg 
    144    1.1       mrg /*
    145  1.248        ad  * cache for vmspace structures.
    146   1.25   thorpej  */
    147   1.25   thorpej 
    148  1.248        ad static struct pool_cache uvm_vmspace_cache;
    149   1.25   thorpej 
    150   1.26   thorpej /*
    151  1.248        ad  * cache for dynamically-allocated map entries.
    152   1.26   thorpej  */
    153   1.26   thorpej 
    154  1.248        ad static struct pool_cache uvm_map_entry_cache;
    155  1.130   thorpej 
    156  1.130   thorpej MALLOC_DEFINE(M_VMMAP, "VM map", "VM map structures");
    157  1.130   thorpej MALLOC_DEFINE(M_VMPMAP, "VM pmap", "VM pmap");
    158   1.25   thorpej 
    159   1.40   thorpej #ifdef PMAP_GROWKERNEL
    160   1.40   thorpej /*
    161   1.40   thorpej  * This global represents the end of the kernel virtual address
    162   1.40   thorpej  * space.  If we want to exceed this, we must grow the kernel
    163   1.40   thorpej  * virtual address space dynamically.
    164   1.40   thorpej  *
    165   1.40   thorpej  * Note, this variable is locked by kernel_map's lock.
    166   1.40   thorpej  */
    167   1.40   thorpej vaddr_t uvm_maxkaddr;
    168   1.40   thorpej #endif
    169   1.40   thorpej 
    170   1.25   thorpej /*
    171    1.1       mrg  * macros
    172    1.1       mrg  */
    173    1.1       mrg 
    174    1.1       mrg /*
    175  1.174      yamt  * VM_MAP_USE_KMAPENT: determine if uvm_kmapent_alloc/free is used
    176  1.174      yamt  * for the vm_map.
    177  1.174      yamt  */
    178  1.174      yamt extern struct vm_map *pager_map; /* XXX */
    179  1.219      yamt #define	VM_MAP_USE_KMAPENT_FLAGS(flags) \
    180  1.219      yamt 	(((flags) & VM_MAP_INTRSAFE) != 0)
    181  1.174      yamt #define	VM_MAP_USE_KMAPENT(map) \
    182  1.219      yamt 	(VM_MAP_USE_KMAPENT_FLAGS((map)->flags) || (map) == kernel_map)
    183  1.174      yamt 
    184  1.174      yamt /*
    185  1.194      yamt  * UVM_ET_ISCOMPATIBLE: check some requirements for map entry merging
    186  1.194      yamt  */
    187  1.194      yamt 
    188  1.194      yamt #define	UVM_ET_ISCOMPATIBLE(ent, type, uobj, meflags, \
    189  1.194      yamt     prot, maxprot, inh, adv, wire) \
    190  1.194      yamt 	((ent)->etype == (type) && \
    191  1.194      yamt 	(((ent)->flags ^ (meflags)) & (UVM_MAP_NOMERGE | UVM_MAP_QUANTUM)) \
    192  1.194      yamt 	== 0 && \
    193  1.194      yamt 	(ent)->object.uvm_obj == (uobj) && \
    194  1.194      yamt 	(ent)->protection == (prot) && \
    195  1.194      yamt 	(ent)->max_protection == (maxprot) && \
    196  1.194      yamt 	(ent)->inheritance == (inh) && \
    197  1.194      yamt 	(ent)->advice == (adv) && \
    198  1.194      yamt 	(ent)->wired_count == (wire))
    199  1.194      yamt 
    200  1.194      yamt /*
    201    1.1       mrg  * uvm_map_entry_link: insert entry into a map
    202    1.1       mrg  *
    203    1.1       mrg  * => map must be locked
    204    1.1       mrg  */
    205   1.10       mrg #define uvm_map_entry_link(map, after_where, entry) do { \
    206  1.218      yamt 	uvm_mapent_check(entry); \
    207   1.10       mrg 	(map)->nentries++; \
    208   1.10       mrg 	(entry)->prev = (after_where); \
    209   1.10       mrg 	(entry)->next = (after_where)->next; \
    210   1.10       mrg 	(entry)->prev->next = (entry); \
    211   1.10       mrg 	(entry)->next->prev = (entry); \
    212  1.144      yamt 	uvm_rb_insert((map), (entry)); \
    213  1.124     perry } while (/*CONSTCOND*/ 0)
    214   1.10       mrg 
    215    1.1       mrg /*
    216    1.1       mrg  * uvm_map_entry_unlink: remove entry from a map
    217    1.1       mrg  *
    218    1.1       mrg  * => map must be locked
    219    1.1       mrg  */
    220   1.10       mrg #define uvm_map_entry_unlink(map, entry) do { \
    221  1.221      yamt 	KASSERT((entry) != (map)->first_free); \
    222  1.221      yamt 	KASSERT((entry) != (map)->hint); \
    223  1.218      yamt 	uvm_mapent_check(entry); \
    224   1.10       mrg 	(map)->nentries--; \
    225   1.10       mrg 	(entry)->next->prev = (entry)->prev; \
    226   1.10       mrg 	(entry)->prev->next = (entry)->next; \
    227  1.144      yamt 	uvm_rb_remove((map), (entry)); \
    228  1.124     perry } while (/*CONSTCOND*/ 0)
    229    1.1       mrg 
    230    1.1       mrg /*
    231    1.1       mrg  * SAVE_HINT: saves the specified entry as the hint for future lookups.
    232    1.1       mrg  *
    233  1.248        ad  * => map need not be locked.
    234    1.1       mrg  */
    235  1.248        ad #define SAVE_HINT(map, check, value) do { \
    236  1.258        ad 	if ((map)->hint == (check)) \
    237  1.258        ad 		(map)->hint = (value); \
    238  1.124     perry } while (/*CONSTCOND*/ 0)
    239    1.1       mrg 
    240    1.1       mrg /*
    241  1.221      yamt  * clear_hints: ensure that hints don't point to the entry.
    242  1.221      yamt  *
    243  1.221      yamt  * => map must be write-locked.
    244  1.221      yamt  */
    245  1.221      yamt static void
    246  1.221      yamt clear_hints(struct vm_map *map, struct vm_map_entry *ent)
    247  1.221      yamt {
    248  1.221      yamt 
    249  1.221      yamt 	SAVE_HINT(map, ent, ent->prev);
    250  1.221      yamt 	if (map->first_free == ent) {
    251  1.221      yamt 		map->first_free = ent->prev;
    252  1.221      yamt 	}
    253  1.221      yamt }
    254  1.221      yamt 
    255  1.221      yamt /*
    256    1.1       mrg  * VM_MAP_RANGE_CHECK: check and correct range
    257    1.1       mrg  *
    258    1.1       mrg  * => map must at least be read locked
    259    1.1       mrg  */
    260    1.1       mrg 
    261   1.10       mrg #define VM_MAP_RANGE_CHECK(map, start, end) do { \
    262  1.139     enami 	if (start < vm_map_min(map))		\
    263  1.139     enami 		start = vm_map_min(map);	\
    264  1.139     enami 	if (end > vm_map_max(map))		\
    265  1.139     enami 		end = vm_map_max(map);		\
    266  1.139     enami 	if (start > end)			\
    267  1.139     enami 		start = end;			\
    268  1.124     perry } while (/*CONSTCOND*/ 0)
    269    1.1       mrg 
    270    1.1       mrg /*
    271    1.1       mrg  * local prototypes
    272    1.1       mrg  */
    273    1.1       mrg 
    274  1.138     enami static struct vm_map_entry *
    275  1.138     enami 		uvm_mapent_alloc(struct vm_map *, int);
    276  1.174      yamt static struct vm_map_entry *
    277  1.174      yamt 		uvm_mapent_alloc_split(struct vm_map *,
    278  1.174      yamt 		    const struct vm_map_entry *, int,
    279  1.174      yamt 		    struct uvm_mapent_reservation *);
    280  1.138     enami static void	uvm_mapent_copy(struct vm_map_entry *, struct vm_map_entry *);
    281  1.138     enami static void	uvm_mapent_free(struct vm_map_entry *);
    282  1.218      yamt #if defined(DEBUG)
    283  1.218      yamt static void	_uvm_mapent_check(const struct vm_map_entry *, const char *,
    284  1.218      yamt 		    int);
    285  1.218      yamt #define	uvm_mapent_check(map)	_uvm_mapent_check(map, __FILE__, __LINE__)
    286  1.218      yamt #else /* defined(DEBUG) */
    287  1.218      yamt #define	uvm_mapent_check(e)	/* nothing */
    288  1.218      yamt #endif /* defined(DEBUG) */
    289  1.174      yamt static struct vm_map_entry *
    290  1.174      yamt 		uvm_kmapent_alloc(struct vm_map *, int);
    291  1.174      yamt static void	uvm_kmapent_free(struct vm_map_entry *);
    292  1.219      yamt static vsize_t	uvm_kmapent_overhead(vsize_t);
    293  1.219      yamt 
    294  1.138     enami static void	uvm_map_entry_unwire(struct vm_map *, struct vm_map_entry *);
    295  1.138     enami static void	uvm_map_reference_amap(struct vm_map_entry *, int);
    296  1.140     enami static int	uvm_map_space_avail(vaddr_t *, vsize_t, voff_t, vsize_t, int,
    297  1.140     enami 		    struct vm_map_entry *);
    298  1.138     enami static void	uvm_map_unreference_amap(struct vm_map_entry *, int);
    299    1.1       mrg 
    300  1.222      yamt int _uvm_map_sanity(struct vm_map *);
    301  1.222      yamt int _uvm_tree_sanity(struct vm_map *);
    302  1.263      matt static vsize_t uvm_rb_maxgap(const struct vm_map_entry *);
    303  1.144      yamt 
    304  1.263      matt CTASSERT(offsetof(struct vm_map_entry, rb_node) == 0);
    305  1.263      matt #define	ROOT_ENTRY(map)		((struct vm_map_entry *)(map)->rb_tree.rbt_root)
    306  1.263      matt #define	LEFT_ENTRY(entry)	((struct vm_map_entry *)(entry)->rb_node.rb_left)
    307  1.263      matt #define	RIGHT_ENTRY(entry)	((struct vm_map_entry *)(entry)->rb_node.rb_right)
    308  1.263      matt #define	PARENT_ENTRY(map, entry) \
    309  1.263      matt 	(ROOT_ENTRY(map) == (entry) \
    310  1.263      matt 	    ? NULL \
    311  1.263      matt 	    : (struct vm_map_entry *)RB_FATHER(&(entry)->rb_node))
    312  1.263      matt 
    313  1.263      matt static int
    314  1.263      matt uvm_map_compare_nodes(const struct rb_node *nparent,
    315  1.263      matt 	const struct rb_node *nkey)
    316  1.144      yamt {
    317  1.263      matt 	const struct vm_map_entry *eparent = (const void *) nparent;
    318  1.263      matt 	const struct vm_map_entry *ekey = (const void *) nkey;
    319  1.144      yamt 
    320  1.263      matt 	KASSERT(eparent->start < ekey->start || eparent->start >= ekey->end);
    321  1.263      matt 	KASSERT(ekey->start < eparent->start || ekey->start >= eparent->end);
    322  1.164  junyoung 
    323  1.263      matt 	if (ekey->start < eparent->start)
    324  1.263      matt 		return -1;
    325  1.263      matt 	if (ekey->start >= eparent->end)
    326  1.263      matt 		return 1;
    327  1.263      matt 	return 0;
    328  1.144      yamt }
    329  1.144      yamt 
    330  1.263      matt static int
    331  1.263      matt uvm_map_compare_key(const struct rb_node *nparent, const void *vkey)
    332  1.144      yamt {
    333  1.263      matt 	const struct vm_map_entry *eparent = (const void *) nparent;
    334  1.263      matt 	const vaddr_t va = *(const vaddr_t *) vkey;
    335  1.144      yamt 
    336  1.263      matt 	if (va < eparent->start)
    337  1.263      matt 		return -1;
    338  1.263      matt 	if (va >= eparent->end)
    339  1.263      matt 		return 1;
    340  1.263      matt 	return 0;
    341  1.144      yamt }
    342  1.144      yamt 
    343  1.263      matt static const struct rb_tree_ops uvm_map_tree_ops = {
    344  1.263      matt 	.rbto_compare_nodes = uvm_map_compare_nodes,
    345  1.263      matt 	.rbto_compare_key = uvm_map_compare_key,
    346  1.263      matt };
    347  1.144      yamt 
    348  1.206     perry static inline vsize_t
    349  1.263      matt uvm_rb_gap(const struct vm_map_entry *entry)
    350  1.144      yamt {
    351  1.144      yamt 	KASSERT(entry->next != NULL);
    352  1.144      yamt 	return entry->next->start - entry->end;
    353  1.144      yamt }
    354  1.144      yamt 
    355  1.144      yamt static vsize_t
    356  1.263      matt uvm_rb_maxgap(const struct vm_map_entry *entry)
    357  1.144      yamt {
    358  1.263      matt 	struct vm_map_entry *child;
    359  1.263      matt 	vsize_t maxgap = entry->gap;
    360  1.144      yamt 
    361  1.263      matt 	/*
    362  1.263      matt 	 * We need maxgap to be the largest gap of us or any of our
    363  1.263      matt 	 * descendents.  Since each of our children's maxgap is the
    364  1.263      matt 	 * cached value of their largest gap of themselves or their
    365  1.263      matt 	 * descendents, we can just use that value and avoid recursing
    366  1.263      matt 	 * down the tree to calculate it.
    367  1.263      matt 	 */
    368  1.263      matt 	if ((child = LEFT_ENTRY(entry)) != NULL && maxgap < child->maxgap)
    369  1.263      matt 		maxgap = child->maxgap;
    370  1.144      yamt 
    371  1.263      matt 	if ((child = RIGHT_ENTRY(entry)) != NULL && maxgap < child->maxgap)
    372  1.263      matt 		maxgap = child->maxgap;
    373  1.144      yamt 
    374  1.263      matt 	return maxgap;
    375  1.144      yamt }
    376  1.144      yamt 
    377  1.263      matt static void
    378  1.144      yamt uvm_rb_fixup(struct vm_map *map, struct vm_map_entry *entry)
    379  1.144      yamt {
    380  1.263      matt 	struct vm_map_entry *parent;
    381  1.263      matt 
    382  1.263      matt 	KASSERT(entry->gap == uvm_rb_gap(entry));
    383  1.263      matt 	entry->maxgap = uvm_rb_maxgap(entry);
    384  1.263      matt 
    385  1.263      matt 	while ((parent = PARENT_ENTRY(map, entry)) != NULL) {
    386  1.263      matt 		struct vm_map_entry *brother;
    387  1.263      matt 		vsize_t maxgap = parent->gap;
    388  1.263      matt 
    389  1.263      matt 		KDASSERT(parent->gap == uvm_rb_gap(parent));
    390  1.263      matt 		if (maxgap < entry->maxgap)
    391  1.263      matt 			maxgap = entry->maxgap;
    392  1.263      matt 		/*
    393  1.263      matt 		 * Since we work our towards the root, we know entry's maxgap
    394  1.263      matt 		 * value is ok but its brothers may now be out-of-date due
    395  1.263      matt 		 * rebalancing.  So refresh it.
    396  1.263      matt 		 */
    397  1.263      matt 		brother = (struct vm_map_entry *)parent->rb_node.rb_nodes[RB_POSITION(&entry->rb_node) ^ RB_DIR_OTHER];
    398  1.263      matt 		if (brother != NULL) {
    399  1.263      matt 			KDASSERT(brother->gap == uvm_rb_gap(brother));
    400  1.263      matt 			brother->maxgap = uvm_rb_maxgap(brother);
    401  1.263      matt 			if (maxgap < brother->maxgap)
    402  1.263      matt 				maxgap = brother->maxgap;
    403  1.263      matt 		}
    404  1.263      matt 
    405  1.263      matt 		parent->maxgap = maxgap;
    406  1.263      matt 		entry = parent;
    407  1.263      matt 	}
    408  1.144      yamt }
    409  1.144      yamt 
    410  1.203   thorpej static void
    411  1.144      yamt uvm_rb_insert(struct vm_map *map, struct vm_map_entry *entry)
    412  1.144      yamt {
    413  1.263      matt 	entry->gap = entry->maxgap = uvm_rb_gap(entry);
    414  1.263      matt 	if (entry->prev != &map->header)
    415  1.263      matt 		entry->prev->gap = uvm_rb_gap(entry->prev);
    416  1.144      yamt 
    417  1.263      matt 	if (!rb_tree_insert_node(&map->rb_tree, &entry->rb_node))
    418  1.263      matt 		panic("uvm_rb_insert: map %p: duplicate entry?", map);
    419  1.263      matt 
    420  1.263      matt 	/*
    421  1.263      matt 	 * If the previous entry is not our immediate left child, then it's an
    422  1.263      matt 	 * ancestor and will be fixed up on the way to the root.  We don't
    423  1.263      matt 	 * have to check entry->prev against &map->header since &map->header
    424  1.263      matt 	 * will never be in the tree.
    425  1.263      matt 	 */
    426  1.263      matt 	uvm_rb_fixup(map,
    427  1.263      matt 	    LEFT_ENTRY(entry) == entry->prev ? entry->prev : entry);
    428  1.144      yamt }
    429  1.144      yamt 
    430  1.203   thorpej static void
    431  1.144      yamt uvm_rb_remove(struct vm_map *map, struct vm_map_entry *entry)
    432  1.144      yamt {
    433  1.263      matt 	struct vm_map_entry *prev_parent = NULL, *next_parent = NULL;
    434  1.144      yamt 
    435  1.263      matt 	/*
    436  1.263      matt 	 * If we are removing an interior node, then an adjacent node will
    437  1.263      matt 	 * be used to replace its position in the tree.  Therefore we will
    438  1.263      matt 	 * need to fixup the tree starting at the parent of the replacement
    439  1.263      matt 	 * node.  So record their parents for later use.
    440  1.263      matt 	 */
    441  1.144      yamt 	if (entry->prev != &map->header)
    442  1.263      matt 		prev_parent = PARENT_ENTRY(map, entry->prev);
    443  1.263      matt 	if (entry->next != &map->header)
    444  1.263      matt 		next_parent = PARENT_ENTRY(map, entry->next);
    445  1.263      matt 
    446  1.263      matt 	rb_tree_remove_node(&map->rb_tree, &entry->rb_node);
    447  1.263      matt 
    448  1.263      matt 	/*
    449  1.263      matt 	 * If the previous node has a new parent, fixup the tree starting
    450  1.263      matt 	 * at the previous node's old parent.
    451  1.263      matt 	 */
    452  1.263      matt 	if (entry->prev != &map->header) {
    453  1.263      matt 		/*
    454  1.263      matt 		 * Update the previous entry's gap due to our absence.
    455  1.263      matt 		 */
    456  1.263      matt 		entry->prev->gap = uvm_rb_gap(entry->prev);
    457  1.144      yamt 		uvm_rb_fixup(map, entry->prev);
    458  1.263      matt 		if (prev_parent != NULL
    459  1.263      matt 		    && prev_parent != entry
    460  1.263      matt 		    && prev_parent != PARENT_ENTRY(map, entry->prev))
    461  1.263      matt 			uvm_rb_fixup(map, prev_parent);
    462  1.263      matt 	}
    463  1.263      matt 
    464  1.263      matt 	/*
    465  1.263      matt 	 * If the next node has a new parent, fixup the tree starting
    466  1.263      matt 	 * at the next node's old parent.
    467  1.263      matt 	 */
    468  1.263      matt 	if (entry->next != &map->header) {
    469  1.263      matt 		uvm_rb_fixup(map, entry->next);
    470  1.263      matt 		if (next_parent != NULL
    471  1.263      matt 		    && next_parent != entry
    472  1.263      matt 		    && next_parent != PARENT_ENTRY(map, entry->next))
    473  1.263      matt 			uvm_rb_fixup(map, next_parent);
    474  1.263      matt 	}
    475  1.144      yamt }
    476  1.144      yamt 
    477  1.222      yamt #if defined(DEBUG)
    478  1.222      yamt int uvm_debug_check_map = 0;
    479  1.159      yamt int uvm_debug_check_rbtree = 0;
    480  1.222      yamt #define uvm_map_check(map, name) \
    481  1.222      yamt 	_uvm_map_check((map), (name), __FILE__, __LINE__)
    482  1.222      yamt static void
    483  1.222      yamt _uvm_map_check(struct vm_map *map, const char *name,
    484  1.222      yamt     const char *file, int line)
    485  1.222      yamt {
    486  1.222      yamt 
    487  1.222      yamt 	if ((uvm_debug_check_map && _uvm_map_sanity(map)) ||
    488  1.222      yamt 	    (uvm_debug_check_rbtree && _uvm_tree_sanity(map))) {
    489  1.222      yamt 		panic("uvm_map_check failed: \"%s\" map=%p (%s:%d)",
    490  1.222      yamt 		    name, map, file, line);
    491  1.222      yamt 	}
    492  1.222      yamt }
    493  1.222      yamt #else /* defined(DEBUG) */
    494  1.222      yamt #define uvm_map_check(map, name)	/* nothing */
    495  1.222      yamt #endif /* defined(DEBUG) */
    496  1.222      yamt 
    497  1.222      yamt #if defined(DEBUG) || defined(DDB)
    498  1.222      yamt int
    499  1.222      yamt _uvm_map_sanity(struct vm_map *map)
    500  1.222      yamt {
    501  1.234   thorpej 	bool first_free_found = false;
    502  1.234   thorpej 	bool hint_found = false;
    503  1.222      yamt 	const struct vm_map_entry *e;
    504  1.222      yamt 
    505  1.222      yamt 	e = &map->header;
    506  1.222      yamt 	for (;;) {
    507  1.222      yamt 		if (map->first_free == e) {
    508  1.234   thorpej 			first_free_found = true;
    509  1.222      yamt 		} else if (!first_free_found && e->next->start > e->end) {
    510  1.222      yamt 			printf("first_free %p should be %p\n",
    511  1.222      yamt 			    map->first_free, e);
    512  1.222      yamt 			return -1;
    513  1.222      yamt 		}
    514  1.222      yamt 		if (map->hint == e) {
    515  1.234   thorpej 			hint_found = true;
    516  1.222      yamt 		}
    517  1.222      yamt 
    518  1.222      yamt 		e = e->next;
    519  1.222      yamt 		if (e == &map->header) {
    520  1.222      yamt 			break;
    521  1.222      yamt 		}
    522  1.222      yamt 	}
    523  1.222      yamt 	if (!first_free_found) {
    524  1.222      yamt 		printf("stale first_free\n");
    525  1.222      yamt 		return -1;
    526  1.222      yamt 	}
    527  1.222      yamt 	if (!hint_found) {
    528  1.222      yamt 		printf("stale hint\n");
    529  1.222      yamt 		return -1;
    530  1.222      yamt 	}
    531  1.222      yamt 	return 0;
    532  1.222      yamt }
    533  1.144      yamt 
    534  1.144      yamt int
    535  1.222      yamt _uvm_tree_sanity(struct vm_map *map)
    536  1.144      yamt {
    537  1.144      yamt 	struct vm_map_entry *tmp, *trtmp;
    538  1.144      yamt 	int n = 0, i = 1;
    539  1.144      yamt 
    540  1.263      matt 	for (tmp = map->header.next; tmp != &map->header; tmp = tmp->next) {
    541  1.263      matt 		if (tmp->gap != uvm_rb_gap(tmp)) {
    542  1.263      matt 			printf("%d/%d gap %lx != %lx %s\n",
    543  1.222      yamt 			    n + 1, map->nentries,
    544  1.263      matt 			    (ulong)tmp->gap, (ulong)uvm_rb_gap(tmp),
    545  1.144      yamt 			    tmp->next == &map->header ? "(last)" : "");
    546  1.144      yamt 			goto error;
    547  1.144      yamt 		}
    548  1.263      matt 		/*
    549  1.263      matt 		 * If any entries are out of order, tmp->gap will be unsigned
    550  1.263      matt 		 * and will likely exceed the size of the map.
    551  1.263      matt 		 */
    552  1.263      matt 		KASSERT(tmp->gap < map->size);
    553  1.263      matt 		n++;
    554  1.263      matt 	}
    555  1.263      matt 
    556  1.263      matt 	if (n != map->nentries) {
    557  1.263      matt 		printf("nentries: %d vs %d\n", n, map->nentries);
    558  1.263      matt 		goto error;
    559  1.144      yamt 	}
    560  1.263      matt 
    561  1.144      yamt 	trtmp = NULL;
    562  1.263      matt 	for (tmp = map->header.next; tmp != &map->header; tmp = tmp->next) {
    563  1.263      matt 		if (tmp->maxgap != uvm_rb_maxgap(tmp)) {
    564  1.263      matt 			printf("maxgap %lx != %lx\n",
    565  1.263      matt 			    (ulong)tmp->maxgap,
    566  1.263      matt 			    (ulong)uvm_rb_maxgap(tmp));
    567  1.144      yamt 			goto error;
    568  1.144      yamt 		}
    569  1.144      yamt 		if (trtmp != NULL && trtmp->start >= tmp->start) {
    570  1.222      yamt 			printf("corrupt: 0x%lx >= 0x%lx\n",
    571  1.222      yamt 			    trtmp->start, tmp->start);
    572  1.144      yamt 			goto error;
    573  1.144      yamt 		}
    574  1.144      yamt 
    575  1.144      yamt 		trtmp = tmp;
    576  1.144      yamt 	}
    577  1.144      yamt 
    578  1.263      matt 	for (tmp = map->header.next; tmp != &map->header;
    579  1.144      yamt 	    tmp = tmp->next, i++) {
    580  1.263      matt 		trtmp = (void *) rb_tree_iterate(&map->rb_tree, &tmp->rb_node,
    581  1.263      matt 		    RB_DIR_LEFT);
    582  1.263      matt 		if (trtmp == NULL)
    583  1.263      matt 			trtmp = &map->header;
    584  1.263      matt 		if (tmp->prev != trtmp) {
    585  1.263      matt 			printf("lookup: %d: %p->prev=%p: %p\n",
    586  1.263      matt 			    i, tmp, tmp->prev, trtmp);
    587  1.263      matt 			goto error;
    588  1.263      matt 		}
    589  1.263      matt 		trtmp = (void *) rb_tree_iterate(&map->rb_tree, &tmp->rb_node,
    590  1.263      matt 		    RB_DIR_RIGHT);
    591  1.263      matt 		if (trtmp == NULL)
    592  1.263      matt 			trtmp = &map->header;
    593  1.263      matt 		if (tmp->next != trtmp) {
    594  1.263      matt 			printf("lookup: %d: %p->next=%p: %p\n",
    595  1.263      matt 			    i, tmp, tmp->next, trtmp);
    596  1.263      matt 			goto error;
    597  1.263      matt 		}
    598  1.263      matt 		trtmp = (void *)rb_tree_find_node(&map->rb_tree, &tmp->start);
    599  1.144      yamt 		if (trtmp != tmp) {
    600  1.222      yamt 			printf("lookup: %d: %p - %p: %p\n", i, tmp, trtmp,
    601  1.263      matt 			    PARENT_ENTRY(map, tmp));
    602  1.144      yamt 			goto error;
    603  1.144      yamt 		}
    604  1.144      yamt 	}
    605  1.144      yamt 
    606  1.144      yamt 	return (0);
    607  1.144      yamt  error:
    608  1.144      yamt 	return (-1);
    609  1.144      yamt }
    610  1.222      yamt #endif /* defined(DEBUG) || defined(DDB) */
    611  1.144      yamt 
    612  1.201       dsl #ifdef DIAGNOSTIC
    613  1.203   thorpej static struct vm_map *uvm_kmapent_map(struct vm_map_entry *);
    614  1.201       dsl #endif
    615  1.174      yamt 
    616    1.1       mrg /*
    617  1.238        ad  * vm_map_lock: acquire an exclusive (write) lock on a map.
    618  1.238        ad  *
    619  1.238        ad  * => Note that "intrsafe" maps use only exclusive, spin locks.
    620  1.238        ad  *
    621  1.238        ad  * => The locking protocol provides for guaranteed upgrade from shared ->
    622  1.238        ad  *    exclusive by whichever thread currently has the map marked busy.
    623  1.238        ad  *    See "LOCKING PROTOCOL NOTES" in uvm_map.h.  This is horrible; among
    624  1.238        ad  *    other problems, it defeats any fairness guarantees provided by RW
    625  1.238        ad  *    locks.
    626  1.238        ad  */
    627  1.238        ad 
    628  1.238        ad void
    629  1.238        ad vm_map_lock(struct vm_map *map)
    630  1.238        ad {
    631  1.238        ad 
    632  1.238        ad 	if ((map->flags & VM_MAP_INTRSAFE) != 0) {
    633  1.238        ad 		mutex_spin_enter(&map->mutex);
    634  1.238        ad 		return;
    635  1.238        ad 	}
    636  1.238        ad 
    637  1.238        ad 	for (;;) {
    638  1.238        ad 		rw_enter(&map->lock, RW_WRITER);
    639  1.238        ad 		if (map->busy == NULL)
    640  1.238        ad 			break;
    641  1.249      yamt 		if (map->busy == curlwp)
    642  1.249      yamt 			break;
    643  1.238        ad 		mutex_enter(&map->misc_lock);
    644  1.238        ad 		rw_exit(&map->lock);
    645  1.248        ad 		if (map->busy != NULL)
    646  1.248        ad 			cv_wait(&map->cv, &map->misc_lock);
    647  1.238        ad 		mutex_exit(&map->misc_lock);
    648  1.238        ad 	}
    649  1.238        ad 
    650  1.238        ad 	map->timestamp++;
    651  1.238        ad }
    652  1.238        ad 
    653  1.238        ad /*
    654  1.238        ad  * vm_map_lock_try: try to lock a map, failing if it is already locked.
    655  1.238        ad  */
    656  1.238        ad 
    657  1.238        ad bool
    658  1.238        ad vm_map_lock_try(struct vm_map *map)
    659  1.238        ad {
    660  1.238        ad 
    661  1.238        ad 	if ((map->flags & VM_MAP_INTRSAFE) != 0)
    662  1.238        ad 		return mutex_tryenter(&map->mutex);
    663  1.238        ad 	if (!rw_tryenter(&map->lock, RW_WRITER))
    664  1.238        ad 		return false;
    665  1.238        ad 	if (map->busy != NULL) {
    666  1.238        ad 		rw_exit(&map->lock);
    667  1.238        ad 		return false;
    668  1.238        ad 	}
    669  1.238        ad 
    670  1.238        ad 	map->timestamp++;
    671  1.238        ad 	return true;
    672  1.238        ad }
    673  1.238        ad 
    674  1.238        ad /*
    675  1.238        ad  * vm_map_unlock: release an exclusive lock on a map.
    676  1.238        ad  */
    677  1.238        ad 
    678  1.238        ad void
    679  1.238        ad vm_map_unlock(struct vm_map *map)
    680  1.238        ad {
    681  1.238        ad 
    682  1.238        ad 	if ((map->flags & VM_MAP_INTRSAFE) != 0)
    683  1.238        ad 		mutex_spin_exit(&map->mutex);
    684  1.238        ad 	else {
    685  1.238        ad 		KASSERT(rw_write_held(&map->lock));
    686  1.249      yamt 		KASSERT(map->busy == NULL || map->busy == curlwp);
    687  1.238        ad 		rw_exit(&map->lock);
    688  1.238        ad 	}
    689  1.238        ad }
    690  1.238        ad 
    691  1.238        ad /*
    692  1.238        ad  * vm_map_unbusy: mark the map as unbusy, and wake any waiters that
    693  1.238        ad  *     want an exclusive lock.
    694  1.238        ad  */
    695  1.238        ad 
    696  1.238        ad void
    697  1.238        ad vm_map_unbusy(struct vm_map *map)
    698  1.238        ad {
    699  1.238        ad 
    700  1.238        ad 	KASSERT(map->busy == curlwp);
    701  1.238        ad 
    702  1.238        ad 	/*
    703  1.238        ad 	 * Safe to clear 'busy' and 'waiters' with only a read lock held:
    704  1.238        ad 	 *
    705  1.238        ad 	 * o they can only be set with a write lock held
    706  1.238        ad 	 * o writers are blocked out with a read or write hold
    707  1.238        ad 	 * o at any time, only one thread owns the set of values
    708  1.238        ad 	 */
    709  1.248        ad 	mutex_enter(&map->misc_lock);
    710  1.238        ad 	map->busy = NULL;
    711  1.238        ad 	cv_broadcast(&map->cv);
    712  1.238        ad 	mutex_exit(&map->misc_lock);
    713  1.238        ad }
    714  1.238        ad 
    715  1.238        ad /*
    716  1.248        ad  * vm_map_lock_read: acquire a shared (read) lock on a map.
    717  1.248        ad  */
    718  1.248        ad 
    719  1.248        ad void
    720  1.248        ad vm_map_lock_read(struct vm_map *map)
    721  1.248        ad {
    722  1.248        ad 
    723  1.248        ad 	KASSERT((map->flags & VM_MAP_INTRSAFE) == 0);
    724  1.248        ad 
    725  1.248        ad 	rw_enter(&map->lock, RW_READER);
    726  1.248        ad }
    727  1.248        ad 
    728  1.248        ad /*
    729  1.248        ad  * vm_map_unlock_read: release a shared lock on a map.
    730  1.248        ad  */
    731  1.248        ad 
    732  1.248        ad void
    733  1.248        ad vm_map_unlock_read(struct vm_map *map)
    734  1.248        ad {
    735  1.248        ad 
    736  1.248        ad 	KASSERT((map->flags & VM_MAP_INTRSAFE) == 0);
    737  1.248        ad 
    738  1.248        ad 	rw_exit(&map->lock);
    739  1.248        ad }
    740  1.248        ad 
    741  1.248        ad /*
    742  1.248        ad  * vm_map_busy: mark a map as busy.
    743  1.248        ad  *
    744  1.248        ad  * => the caller must hold the map write locked
    745  1.248        ad  */
    746  1.248        ad 
    747  1.248        ad void
    748  1.248        ad vm_map_busy(struct vm_map *map)
    749  1.248        ad {
    750  1.248        ad 
    751  1.248        ad 	KASSERT(rw_write_held(&map->lock));
    752  1.248        ad 	KASSERT(map->busy == NULL);
    753  1.248        ad 
    754  1.248        ad 	map->busy = curlwp;
    755  1.248        ad }
    756  1.248        ad 
    757  1.248        ad /*
    758  1.248        ad  * vm_map_locked_p: return true if the map is write locked.
    759  1.269      yamt  *
    760  1.269      yamt  * => only for debug purposes like KASSERTs.
    761  1.269      yamt  * => should not be used to verify that a map is not locked.
    762  1.248        ad  */
    763  1.248        ad 
    764  1.248        ad bool
    765  1.248        ad vm_map_locked_p(struct vm_map *map)
    766  1.248        ad {
    767  1.248        ad 
    768  1.248        ad 	if ((map->flags & VM_MAP_INTRSAFE) != 0) {
    769  1.248        ad 		return mutex_owned(&map->mutex);
    770  1.248        ad 	} else {
    771  1.248        ad 		return rw_write_held(&map->lock);
    772  1.248        ad 	}
    773  1.248        ad }
    774  1.248        ad 
    775  1.248        ad /*
    776    1.1       mrg  * uvm_mapent_alloc: allocate a map entry
    777    1.1       mrg  */
    778    1.1       mrg 
    779  1.203   thorpej static struct vm_map_entry *
    780  1.138     enami uvm_mapent_alloc(struct vm_map *map, int flags)
    781   1.10       mrg {
    782   1.99       chs 	struct vm_map_entry *me;
    783  1.127   thorpej 	int pflags = (flags & UVM_FLAG_NOWAIT) ? PR_NOWAIT : PR_WAITOK;
    784  1.104       chs 	UVMHIST_FUNC("uvm_mapent_alloc"); UVMHIST_CALLED(maphist);
    785    1.1       mrg 
    786  1.174      yamt 	if (VM_MAP_USE_KMAPENT(map)) {
    787  1.174      yamt 		me = uvm_kmapent_alloc(map, flags);
    788  1.104       chs 	} else {
    789  1.248        ad 		me = pool_cache_get(&uvm_map_entry_cache, pflags);
    790  1.126    bouyer 		if (__predict_false(me == NULL))
    791  1.126    bouyer 			return NULL;
    792  1.104       chs 		me->flags = 0;
    793   1.10       mrg 	}
    794    1.1       mrg 
    795  1.104       chs 	UVMHIST_LOG(maphist, "<- new entry=0x%x [kentry=%d]", me,
    796  1.104       chs 	    ((map->flags & VM_MAP_INTRSAFE) != 0 || map == kernel_map), 0, 0);
    797  1.139     enami 	return (me);
    798    1.1       mrg }
    799    1.1       mrg 
    800    1.1       mrg /*
    801  1.174      yamt  * uvm_mapent_alloc_split: allocate a map entry for clipping.
    802  1.248        ad  *
    803  1.248        ad  * => map must be locked by caller if UVM_MAP_QUANTUM is set.
    804  1.174      yamt  */
    805  1.174      yamt 
    806  1.203   thorpej static struct vm_map_entry *
    807  1.174      yamt uvm_mapent_alloc_split(struct vm_map *map,
    808  1.174      yamt     const struct vm_map_entry *old_entry, int flags,
    809  1.232      yamt     struct uvm_mapent_reservation *umr)
    810  1.174      yamt {
    811  1.174      yamt 	struct vm_map_entry *me;
    812  1.174      yamt 
    813  1.174      yamt 	KASSERT(!VM_MAP_USE_KMAPENT(map) ||
    814  1.174      yamt 	    (old_entry->flags & UVM_MAP_QUANTUM) || !UMR_EMPTY(umr));
    815  1.174      yamt 
    816  1.174      yamt 	if (old_entry->flags & UVM_MAP_QUANTUM) {
    817  1.175      yamt 		struct vm_map_kernel *vmk = vm_map_to_kernel(map);
    818  1.174      yamt 
    819  1.248        ad 		KASSERT(vm_map_locked_p(map));
    820  1.175      yamt 		me = vmk->vmk_merged_entries;
    821  1.174      yamt 		KASSERT(me);
    822  1.175      yamt 		vmk->vmk_merged_entries = me->next;
    823  1.174      yamt 		KASSERT(me->flags & UVM_MAP_QUANTUM);
    824  1.174      yamt 	} else {
    825  1.174      yamt 		me = uvm_mapent_alloc(map, flags);
    826  1.174      yamt 	}
    827  1.174      yamt 
    828  1.174      yamt 	return me;
    829  1.174      yamt }
    830  1.174      yamt 
    831  1.174      yamt /*
    832    1.1       mrg  * uvm_mapent_free: free map entry
    833    1.1       mrg  */
    834    1.1       mrg 
    835  1.203   thorpej static void
    836  1.138     enami uvm_mapent_free(struct vm_map_entry *me)
    837    1.1       mrg {
    838  1.104       chs 	UVMHIST_FUNC("uvm_mapent_free"); UVMHIST_CALLED(maphist);
    839  1.104       chs 
    840   1.98       chs 	UVMHIST_LOG(maphist,"<- freeing map entry=0x%x [flags=%d]",
    841    1.1       mrg 		me, me->flags, 0, 0);
    842  1.174      yamt 	if (me->flags & UVM_MAP_KERNEL) {
    843  1.174      yamt 		uvm_kmapent_free(me);
    844  1.174      yamt 	} else {
    845  1.248        ad 		pool_cache_put(&uvm_map_entry_cache, me);
    846  1.174      yamt 	}
    847  1.174      yamt }
    848  1.174      yamt 
    849  1.174      yamt /*
    850  1.194      yamt  * uvm_mapent_free_merged: free merged map entry
    851  1.174      yamt  *
    852  1.174      yamt  * => keep the entry if needed.
    853  1.194      yamt  * => caller shouldn't hold map locked if VM_MAP_USE_KMAPENT(map) is true.
    854  1.248        ad  * => map should be locked if UVM_MAP_QUANTUM is set.
    855  1.174      yamt  */
    856  1.174      yamt 
    857  1.203   thorpej static void
    858  1.181      yamt uvm_mapent_free_merged(struct vm_map *map, struct vm_map_entry *me)
    859  1.174      yamt {
    860  1.174      yamt 
    861  1.181      yamt 	KASSERT(!(me->flags & UVM_MAP_KERNEL) || uvm_kmapent_map(me) == map);
    862  1.181      yamt 
    863  1.174      yamt 	if (me->flags & UVM_MAP_QUANTUM) {
    864  1.174      yamt 		/*
    865  1.174      yamt 		 * keep this entry for later splitting.
    866  1.174      yamt 		 */
    867  1.175      yamt 		struct vm_map_kernel *vmk;
    868  1.174      yamt 
    869  1.248        ad 		KASSERT(vm_map_locked_p(map));
    870  1.181      yamt 		KASSERT(VM_MAP_IS_KERNEL(map));
    871  1.181      yamt 		KASSERT(!VM_MAP_USE_KMAPENT(map) ||
    872  1.181      yamt 		    (me->flags & UVM_MAP_KERNEL));
    873  1.174      yamt 
    874  1.175      yamt 		vmk = vm_map_to_kernel(map);
    875  1.175      yamt 		me->next = vmk->vmk_merged_entries;
    876  1.175      yamt 		vmk->vmk_merged_entries = me;
    877  1.104       chs 	} else {
    878  1.174      yamt 		uvm_mapent_free(me);
    879   1.10       mrg 	}
    880    1.1       mrg }
    881    1.1       mrg 
    882    1.1       mrg /*
    883    1.1       mrg  * uvm_mapent_copy: copy a map entry, preserving flags
    884    1.1       mrg  */
    885    1.1       mrg 
    886  1.206     perry static inline void
    887  1.138     enami uvm_mapent_copy(struct vm_map_entry *src, struct vm_map_entry *dst)
    888   1.10       mrg {
    889  1.139     enami 
    890  1.106       chs 	memcpy(dst, src, ((char *)&src->uvm_map_entry_stop_copy) -
    891  1.139     enami 	    ((char *)src));
    892    1.1       mrg }
    893    1.1       mrg 
    894  1.219      yamt /*
    895  1.219      yamt  * uvm_mapent_overhead: calculate maximum kva overhead necessary for
    896  1.219      yamt  * map entries.
    897  1.219      yamt  *
    898  1.219      yamt  * => size and flags are the same as uvm_km_suballoc's ones.
    899  1.219      yamt  */
    900  1.219      yamt 
    901  1.219      yamt vsize_t
    902  1.219      yamt uvm_mapent_overhead(vsize_t size, int flags)
    903  1.219      yamt {
    904  1.219      yamt 
    905  1.219      yamt 	if (VM_MAP_USE_KMAPENT_FLAGS(flags)) {
    906  1.219      yamt 		return uvm_kmapent_overhead(size);
    907  1.219      yamt 	}
    908  1.219      yamt 	return 0;
    909  1.219      yamt }
    910  1.219      yamt 
    911  1.218      yamt #if defined(DEBUG)
    912  1.218      yamt static void
    913  1.218      yamt _uvm_mapent_check(const struct vm_map_entry *entry, const char *file, int line)
    914  1.218      yamt {
    915  1.218      yamt 
    916  1.218      yamt 	if (entry->start >= entry->end) {
    917  1.218      yamt 		goto bad;
    918  1.218      yamt 	}
    919  1.218      yamt 	if (UVM_ET_ISOBJ(entry)) {
    920  1.218      yamt 		if (entry->object.uvm_obj == NULL) {
    921  1.218      yamt 			goto bad;
    922  1.218      yamt 		}
    923  1.218      yamt 	} else if (UVM_ET_ISSUBMAP(entry)) {
    924  1.218      yamt 		if (entry->object.sub_map == NULL) {
    925  1.218      yamt 			goto bad;
    926  1.218      yamt 		}
    927  1.218      yamt 	} else {
    928  1.218      yamt 		if (entry->object.uvm_obj != NULL ||
    929  1.218      yamt 		    entry->object.sub_map != NULL) {
    930  1.218      yamt 			goto bad;
    931  1.218      yamt 		}
    932  1.218      yamt 	}
    933  1.218      yamt 	if (!UVM_ET_ISOBJ(entry)) {
    934  1.218      yamt 		if (entry->offset != 0) {
    935  1.218      yamt 			goto bad;
    936  1.218      yamt 		}
    937  1.218      yamt 	}
    938  1.218      yamt 
    939  1.218      yamt 	return;
    940  1.218      yamt 
    941  1.218      yamt bad:
    942  1.218      yamt 	panic("%s: bad entry %p (%s:%d)", __func__, entry, file, line);
    943  1.218      yamt }
    944  1.218      yamt #endif /* defined(DEBUG) */
    945  1.218      yamt 
    946    1.1       mrg /*
    947    1.1       mrg  * uvm_map_entry_unwire: unwire a map entry
    948    1.1       mrg  *
    949    1.1       mrg  * => map should be locked by caller
    950    1.1       mrg  */
    951    1.1       mrg 
    952  1.206     perry static inline void
    953  1.138     enami uvm_map_entry_unwire(struct vm_map *map, struct vm_map_entry *entry)
    954   1.10       mrg {
    955  1.139     enami 
    956   1.10       mrg 	entry->wired_count = 0;
    957   1.57   thorpej 	uvm_fault_unwire_locked(map, entry->start, entry->end);
    958    1.1       mrg }
    959    1.1       mrg 
    960   1.85       chs 
    961   1.85       chs /*
    962   1.85       chs  * wrapper for calling amap_ref()
    963   1.85       chs  */
    964  1.206     perry static inline void
    965  1.138     enami uvm_map_reference_amap(struct vm_map_entry *entry, int flags)
    966   1.85       chs {
    967  1.139     enami 
    968   1.99       chs 	amap_ref(entry->aref.ar_amap, entry->aref.ar_pageoff,
    969  1.139     enami 	    (entry->end - entry->start) >> PAGE_SHIFT, flags);
    970   1.85       chs }
    971   1.85       chs 
    972   1.85       chs 
    973   1.85       chs /*
    974   1.98       chs  * wrapper for calling amap_unref()
    975   1.85       chs  */
    976  1.206     perry static inline void
    977  1.138     enami uvm_map_unreference_amap(struct vm_map_entry *entry, int flags)
    978   1.85       chs {
    979  1.139     enami 
    980   1.99       chs 	amap_unref(entry->aref.ar_amap, entry->aref.ar_pageoff,
    981  1.139     enami 	    (entry->end - entry->start) >> PAGE_SHIFT, flags);
    982   1.85       chs }
    983   1.85       chs 
    984   1.85       chs 
    985    1.1       mrg /*
    986  1.248        ad  * uvm_map_init: init mapping system at boot time.
    987    1.1       mrg  */
    988    1.1       mrg 
    989   1.10       mrg void
    990  1.138     enami uvm_map_init(void)
    991    1.1       mrg {
    992    1.1       mrg #if defined(UVMHIST)
    993   1.10       mrg 	static struct uvm_history_ent maphistbuf[100];
    994   1.10       mrg 	static struct uvm_history_ent pdhistbuf[100];
    995    1.1       mrg #endif
    996   1.10       mrg 
    997   1.10       mrg 	/*
    998   1.10       mrg 	 * first, init logging system.
    999   1.10       mrg 	 */
   1000    1.1       mrg 
   1001   1.10       mrg 	UVMHIST_FUNC("uvm_map_init");
   1002   1.10       mrg 	UVMHIST_INIT_STATIC(maphist, maphistbuf);
   1003   1.10       mrg 	UVMHIST_INIT_STATIC(pdhist, pdhistbuf);
   1004   1.10       mrg 	UVMHIST_CALLED(maphist);
   1005   1.10       mrg 	UVMHIST_LOG(maphist,"<starting uvm map system>", 0, 0, 0, 0);
   1006   1.10       mrg 
   1007   1.10       mrg 	/*
   1008  1.174      yamt 	 * initialize the global lock for kernel map entry.
   1009   1.10       mrg 	 */
   1010   1.10       mrg 
   1011  1.238        ad 	mutex_init(&uvm_kentry_lock, MUTEX_DRIVER, IPL_VM);
   1012  1.248        ad 
   1013  1.248        ad 	/*
   1014  1.248        ad 	 * initialize caches.
   1015  1.248        ad 	 */
   1016  1.248        ad 
   1017  1.248        ad 	pool_cache_bootstrap(&uvm_map_entry_cache, sizeof(struct vm_map_entry),
   1018  1.248        ad 	    0, 0, 0, "vmmpepl", NULL, IPL_NONE, NULL, NULL, NULL);
   1019  1.248        ad 	pool_cache_bootstrap(&uvm_vmspace_cache, sizeof(struct vmspace),
   1020  1.248        ad 	    0, 0, 0, "vmsppl", NULL, IPL_NONE, NULL, NULL, NULL);
   1021    1.1       mrg }
   1022    1.1       mrg 
   1023    1.1       mrg /*
   1024    1.1       mrg  * clippers
   1025    1.1       mrg  */
   1026    1.1       mrg 
   1027    1.1       mrg /*
   1028  1.218      yamt  * uvm_mapent_splitadj: adjust map entries for splitting, after uvm_mapent_copy.
   1029  1.218      yamt  */
   1030  1.218      yamt 
   1031  1.218      yamt static void
   1032  1.218      yamt uvm_mapent_splitadj(struct vm_map_entry *entry1, struct vm_map_entry *entry2,
   1033  1.218      yamt     vaddr_t splitat)
   1034  1.218      yamt {
   1035  1.218      yamt 	vaddr_t adj;
   1036  1.218      yamt 
   1037  1.218      yamt 	KASSERT(entry1->start < splitat);
   1038  1.218      yamt 	KASSERT(splitat < entry1->end);
   1039  1.218      yamt 
   1040  1.218      yamt 	adj = splitat - entry1->start;
   1041  1.218      yamt 	entry1->end = entry2->start = splitat;
   1042  1.218      yamt 
   1043  1.218      yamt 	if (entry1->aref.ar_amap) {
   1044  1.218      yamt 		amap_splitref(&entry1->aref, &entry2->aref, adj);
   1045  1.218      yamt 	}
   1046  1.218      yamt 	if (UVM_ET_ISSUBMAP(entry1)) {
   1047  1.218      yamt 		/* ... unlikely to happen, but play it safe */
   1048  1.218      yamt 		 uvm_map_reference(entry1->object.sub_map);
   1049  1.218      yamt 	} else if (UVM_ET_ISOBJ(entry1)) {
   1050  1.218      yamt 		KASSERT(entry1->object.uvm_obj != NULL); /* suppress coverity */
   1051  1.218      yamt 		entry2->offset += adj;
   1052  1.218      yamt 		if (entry1->object.uvm_obj->pgops &&
   1053  1.218      yamt 		    entry1->object.uvm_obj->pgops->pgo_reference)
   1054  1.218      yamt 			entry1->object.uvm_obj->pgops->pgo_reference(
   1055  1.218      yamt 			    entry1->object.uvm_obj);
   1056  1.218      yamt 	}
   1057  1.218      yamt }
   1058  1.218      yamt 
   1059  1.218      yamt /*
   1060    1.1       mrg  * uvm_map_clip_start: ensure that the entry begins at or after
   1061    1.1       mrg  *	the starting address, if it doesn't we split the entry.
   1062   1.98       chs  *
   1063    1.1       mrg  * => caller should use UVM_MAP_CLIP_START macro rather than calling
   1064    1.1       mrg  *    this directly
   1065    1.1       mrg  * => map must be locked by caller
   1066    1.1       mrg  */
   1067    1.1       mrg 
   1068   1.99       chs void
   1069  1.138     enami uvm_map_clip_start(struct vm_map *map, struct vm_map_entry *entry,
   1070  1.174      yamt     vaddr_t start, struct uvm_mapent_reservation *umr)
   1071    1.1       mrg {
   1072   1.99       chs 	struct vm_map_entry *new_entry;
   1073    1.1       mrg 
   1074    1.1       mrg 	/* uvm_map_simplify_entry(map, entry); */ /* XXX */
   1075    1.1       mrg 
   1076  1.222      yamt 	uvm_map_check(map, "clip_start entry");
   1077  1.218      yamt 	uvm_mapent_check(entry);
   1078  1.144      yamt 
   1079   1.10       mrg 	/*
   1080   1.10       mrg 	 * Split off the front portion.  note that we must insert the new
   1081   1.10       mrg 	 * entry BEFORE this one, so that this entry has the specified
   1082    1.1       mrg 	 * starting address.
   1083   1.10       mrg 	 */
   1084  1.174      yamt 	new_entry = uvm_mapent_alloc_split(map, entry, 0, umr);
   1085    1.1       mrg 	uvm_mapent_copy(entry, new_entry); /* entry -> new_entry */
   1086  1.218      yamt 	uvm_mapent_splitadj(new_entry, entry, start);
   1087   1.10       mrg 	uvm_map_entry_link(map, entry->prev, new_entry);
   1088   1.85       chs 
   1089  1.222      yamt 	uvm_map_check(map, "clip_start leave");
   1090    1.1       mrg }
   1091    1.1       mrg 
   1092    1.1       mrg /*
   1093    1.1       mrg  * uvm_map_clip_end: ensure that the entry ends at or before
   1094    1.1       mrg  *	the ending address, if it does't we split the reference
   1095   1.98       chs  *
   1096    1.1       mrg  * => caller should use UVM_MAP_CLIP_END macro rather than calling
   1097    1.1       mrg  *    this directly
   1098    1.1       mrg  * => map must be locked by caller
   1099    1.1       mrg  */
   1100    1.1       mrg 
   1101   1.10       mrg void
   1102  1.174      yamt uvm_map_clip_end(struct vm_map *map, struct vm_map_entry *entry, vaddr_t end,
   1103  1.174      yamt     struct uvm_mapent_reservation *umr)
   1104    1.1       mrg {
   1105  1.218      yamt 	struct vm_map_entry *new_entry;
   1106    1.1       mrg 
   1107  1.222      yamt 	uvm_map_check(map, "clip_end entry");
   1108  1.218      yamt 	uvm_mapent_check(entry);
   1109  1.174      yamt 
   1110    1.1       mrg 	/*
   1111    1.1       mrg 	 *	Create a new entry and insert it
   1112    1.1       mrg 	 *	AFTER the specified entry
   1113    1.1       mrg 	 */
   1114  1.174      yamt 	new_entry = uvm_mapent_alloc_split(map, entry, 0, umr);
   1115    1.1       mrg 	uvm_mapent_copy(entry, new_entry); /* entry -> new_entry */
   1116  1.218      yamt 	uvm_mapent_splitadj(entry, new_entry, end);
   1117    1.1       mrg 	uvm_map_entry_link(map, entry, new_entry);
   1118    1.1       mrg 
   1119  1.222      yamt 	uvm_map_check(map, "clip_end leave");
   1120    1.1       mrg }
   1121    1.1       mrg 
   1122  1.226      yamt static void
   1123  1.226      yamt vm_map_drain(struct vm_map *map, uvm_flag_t flags)
   1124  1.226      yamt {
   1125  1.226      yamt 
   1126  1.226      yamt 	if (!VM_MAP_IS_KERNEL(map)) {
   1127  1.226      yamt 		return;
   1128  1.226      yamt 	}
   1129  1.226      yamt 
   1130  1.226      yamt 	uvm_km_va_drain(map, flags);
   1131  1.226      yamt }
   1132    1.1       mrg 
   1133    1.1       mrg /*
   1134    1.1       mrg  *   M A P   -   m a i n   e n t r y   p o i n t
   1135    1.1       mrg  */
   1136    1.1       mrg /*
   1137    1.1       mrg  * uvm_map: establish a valid mapping in a map
   1138    1.1       mrg  *
   1139    1.1       mrg  * => assume startp is page aligned.
   1140    1.1       mrg  * => assume size is a multiple of PAGE_SIZE.
   1141    1.1       mrg  * => assume sys_mmap provides enough of a "hint" to have us skip
   1142    1.1       mrg  *	over text/data/bss area.
   1143    1.1       mrg  * => map must be unlocked (we will lock it)
   1144    1.1       mrg  * => <uobj,uoffset> value meanings (4 cases):
   1145  1.139     enami  *	 [1] <NULL,uoffset>		== uoffset is a hint for PMAP_PREFER
   1146    1.1       mrg  *	 [2] <NULL,UVM_UNKNOWN_OFFSET>	== don't PMAP_PREFER
   1147    1.1       mrg  *	 [3] <uobj,uoffset>		== normal mapping
   1148    1.1       mrg  *	 [4] <uobj,UVM_UNKNOWN_OFFSET>	== uvm_map finds offset based on VA
   1149   1.98       chs  *
   1150    1.1       mrg  *    case [4] is for kernel mappings where we don't know the offset until
   1151    1.8     chuck  *    we've found a virtual address.   note that kernel object offsets are
   1152    1.8     chuck  *    always relative to vm_map_min(kernel_map).
   1153   1.81   thorpej  *
   1154  1.165      yamt  * => if `align' is non-zero, we align the virtual address to the specified
   1155  1.165      yamt  *	alignment.
   1156  1.165      yamt  *	this is provided as a mechanism for large pages.
   1157   1.81   thorpej  *
   1158    1.1       mrg  * => XXXCDC: need way to map in external amap?
   1159    1.1       mrg  */
   1160    1.1       mrg 
   1161   1.10       mrg int
   1162  1.138     enami uvm_map(struct vm_map *map, vaddr_t *startp /* IN/OUT */, vsize_t size,
   1163  1.138     enami     struct uvm_object *uobj, voff_t uoffset, vsize_t align, uvm_flag_t flags)
   1164   1.10       mrg {
   1165  1.174      yamt 	struct uvm_map_args args;
   1166  1.174      yamt 	struct vm_map_entry *new_entry;
   1167  1.174      yamt 	int error;
   1168  1.174      yamt 
   1169  1.181      yamt 	KASSERT((flags & UVM_FLAG_QUANTUM) == 0 || VM_MAP_IS_KERNEL(map));
   1170  1.187      yamt 	KASSERT((size & PAGE_MASK) == 0);
   1171  1.174      yamt 
   1172  1.174      yamt 	/*
   1173  1.174      yamt 	 * for pager_map, allocate the new entry first to avoid sleeping
   1174  1.174      yamt 	 * for memory while we have the map locked.
   1175  1.174      yamt 	 *
   1176  1.261     skrll 	 * Also, because we allocate entries for in-kernel maps
   1177  1.174      yamt 	 * a bit differently (cf. uvm_kmapent_alloc/free), we need to
   1178  1.174      yamt 	 * allocate them before locking the map.
   1179  1.174      yamt 	 */
   1180  1.174      yamt 
   1181  1.174      yamt 	new_entry = NULL;
   1182  1.181      yamt 	if (VM_MAP_USE_KMAPENT(map) || (flags & UVM_FLAG_QUANTUM) ||
   1183  1.181      yamt 	    map == pager_map) {
   1184  1.174      yamt 		new_entry = uvm_mapent_alloc(map, (flags & UVM_FLAG_NOWAIT));
   1185  1.174      yamt 		if (__predict_false(new_entry == NULL))
   1186  1.174      yamt 			return ENOMEM;
   1187  1.174      yamt 		if (flags & UVM_FLAG_QUANTUM)
   1188  1.174      yamt 			new_entry->flags |= UVM_MAP_QUANTUM;
   1189  1.174      yamt 	}
   1190  1.174      yamt 	if (map == pager_map)
   1191  1.174      yamt 		flags |= UVM_FLAG_NOMERGE;
   1192  1.174      yamt 
   1193  1.174      yamt 	error = uvm_map_prepare(map, *startp, size, uobj, uoffset, align,
   1194  1.174      yamt 	    flags, &args);
   1195  1.174      yamt 	if (!error) {
   1196  1.174      yamt 		error = uvm_map_enter(map, &args, new_entry);
   1197  1.174      yamt 		*startp = args.uma_start;
   1198  1.189      yamt 	} else if (new_entry) {
   1199  1.189      yamt 		uvm_mapent_free(new_entry);
   1200  1.174      yamt 	}
   1201  1.174      yamt 
   1202  1.187      yamt #if defined(DEBUG)
   1203  1.187      yamt 	if (!error && VM_MAP_IS_KERNEL(map)) {
   1204  1.264        ad 		uvm_km_check_empty(map, *startp, *startp + size);
   1205  1.187      yamt 	}
   1206  1.187      yamt #endif /* defined(DEBUG) */
   1207  1.187      yamt 
   1208  1.174      yamt 	return error;
   1209  1.174      yamt }
   1210  1.174      yamt 
   1211  1.174      yamt int
   1212  1.174      yamt uvm_map_prepare(struct vm_map *map, vaddr_t start, vsize_t size,
   1213  1.174      yamt     struct uvm_object *uobj, voff_t uoffset, vsize_t align, uvm_flag_t flags,
   1214  1.174      yamt     struct uvm_map_args *args)
   1215  1.174      yamt {
   1216  1.174      yamt 	struct vm_map_entry *prev_entry;
   1217  1.174      yamt 	vm_prot_t prot = UVM_PROTECTION(flags);
   1218  1.174      yamt 	vm_prot_t maxprot = UVM_MAXPROTECTION(flags);
   1219  1.174      yamt 
   1220  1.174      yamt 	UVMHIST_FUNC("uvm_map_prepare");
   1221   1.10       mrg 	UVMHIST_CALLED(maphist);
   1222    1.1       mrg 
   1223  1.174      yamt 	UVMHIST_LOG(maphist, "(map=0x%x, start=0x%x, size=%d, flags=0x%x)",
   1224  1.174      yamt 	    map, start, size, flags);
   1225   1.10       mrg 	UVMHIST_LOG(maphist, "  uobj/offset 0x%x/%d", uobj, uoffset,0,0);
   1226  1.107       chs 
   1227  1.107       chs 	/*
   1228  1.107       chs 	 * detect a popular device driver bug.
   1229  1.107       chs 	 */
   1230  1.107       chs 
   1231  1.139     enami 	KASSERT(doing_shutdown || curlwp != NULL ||
   1232  1.129  christos 	    (map->flags & VM_MAP_INTRSAFE));
   1233    1.1       mrg 
   1234   1.10       mrg 	/*
   1235  1.144      yamt 	 * zero-sized mapping doesn't make any sense.
   1236  1.144      yamt 	 */
   1237  1.144      yamt 	KASSERT(size > 0);
   1238  1.144      yamt 
   1239  1.180      yamt 	KASSERT((~flags & (UVM_FLAG_NOWAIT | UVM_FLAG_WAITVA)) != 0);
   1240  1.180      yamt 
   1241  1.222      yamt 	uvm_map_check(map, "map entry");
   1242  1.144      yamt 
   1243  1.144      yamt 	/*
   1244  1.106       chs 	 * check sanity of protection code
   1245   1.10       mrg 	 */
   1246    1.1       mrg 
   1247   1.10       mrg 	if ((prot & maxprot) != prot) {
   1248   1.98       chs 		UVMHIST_LOG(maphist, "<- prot. failure:  prot=0x%x, max=0x%x",
   1249   1.10       mrg 		prot, maxprot,0,0);
   1250   1.94       chs 		return EACCES;
   1251   1.10       mrg 	}
   1252    1.1       mrg 
   1253   1.10       mrg 	/*
   1254  1.106       chs 	 * figure out where to put new VM range
   1255   1.10       mrg 	 */
   1256    1.1       mrg 
   1257  1.180      yamt retry:
   1258  1.234   thorpej 	if (vm_map_lock_try(map) == false) {
   1259  1.248        ad 		if ((flags & UVM_FLAG_TRYLOCK) != 0 &&
   1260  1.248        ad 		    (map->flags & VM_MAP_INTRSAFE) == 0) {
   1261   1.94       chs 			return EAGAIN;
   1262  1.106       chs 		}
   1263   1.10       mrg 		vm_map_lock(map); /* could sleep here */
   1264   1.10       mrg 	}
   1265  1.226      yamt 	prev_entry = uvm_map_findspace(map, start, size, &start,
   1266  1.226      yamt 	    uobj, uoffset, align, flags);
   1267  1.226      yamt 	if (prev_entry == NULL) {
   1268  1.180      yamt 		unsigned int timestamp;
   1269  1.180      yamt 
   1270  1.180      yamt 		timestamp = map->timestamp;
   1271  1.180      yamt 		UVMHIST_LOG(maphist,"waiting va timestamp=0x%x",
   1272  1.180      yamt 			    timestamp,0,0,0);
   1273  1.180      yamt 		map->flags |= VM_MAP_WANTVA;
   1274   1.10       mrg 		vm_map_unlock(map);
   1275  1.180      yamt 
   1276  1.180      yamt 		/*
   1277  1.226      yamt 		 * try to reclaim kva and wait until someone does unmap.
   1278  1.238        ad 		 * fragile locking here, so we awaken every second to
   1279  1.238        ad 		 * recheck the condition.
   1280  1.180      yamt 		 */
   1281  1.180      yamt 
   1282  1.226      yamt 		vm_map_drain(map, flags);
   1283  1.226      yamt 
   1284  1.238        ad 		mutex_enter(&map->misc_lock);
   1285  1.180      yamt 		while ((map->flags & VM_MAP_WANTVA) != 0 &&
   1286  1.180      yamt 		   map->timestamp == timestamp) {
   1287  1.226      yamt 			if ((flags & UVM_FLAG_WAITVA) == 0) {
   1288  1.238        ad 				mutex_exit(&map->misc_lock);
   1289  1.226      yamt 				UVMHIST_LOG(maphist,
   1290  1.226      yamt 				    "<- uvm_map_findspace failed!", 0,0,0,0);
   1291  1.226      yamt 				return ENOMEM;
   1292  1.226      yamt 			} else {
   1293  1.238        ad 				cv_timedwait(&map->cv, &map->misc_lock, hz);
   1294  1.226      yamt 			}
   1295  1.180      yamt 		}
   1296  1.238        ad 		mutex_exit(&map->misc_lock);
   1297  1.180      yamt 		goto retry;
   1298   1.10       mrg 	}
   1299    1.1       mrg 
   1300   1.40   thorpej #ifdef PMAP_GROWKERNEL
   1301  1.152    simonb 	/*
   1302  1.152    simonb 	 * If the kernel pmap can't map the requested space,
   1303  1.152    simonb 	 * then allocate more resources for it.
   1304  1.152    simonb 	 */
   1305  1.229      yamt 	if (map == kernel_map && uvm_maxkaddr < (start + size))
   1306  1.229      yamt 		uvm_maxkaddr = pmap_growkernel(start + size);
   1307   1.10       mrg #endif
   1308   1.10       mrg 
   1309  1.207      yamt 	UVMMAP_EVCNT_INCR(map_call);
   1310   1.10       mrg 
   1311   1.10       mrg 	/*
   1312   1.10       mrg 	 * if uobj is null, then uoffset is either a VAC hint for PMAP_PREFER
   1313   1.98       chs 	 * [typically from uvm_map_reserve] or it is UVM_UNKNOWN_OFFSET.   in
   1314   1.98       chs 	 * either case we want to zero it  before storing it in the map entry
   1315   1.10       mrg 	 * (because it looks strange and confusing when debugging...)
   1316   1.98       chs 	 *
   1317   1.98       chs 	 * if uobj is not null
   1318   1.10       mrg 	 *   if uoffset is not UVM_UNKNOWN_OFFSET then we have a normal mapping
   1319   1.10       mrg 	 *      and we do not need to change uoffset.
   1320   1.10       mrg 	 *   if uoffset is UVM_UNKNOWN_OFFSET then we need to find the offset
   1321   1.10       mrg 	 *      now (based on the starting address of the map).   this case is
   1322   1.10       mrg 	 *      for kernel object mappings where we don't know the offset until
   1323   1.10       mrg 	 *      the virtual address is found (with uvm_map_findspace).   the
   1324   1.10       mrg 	 *      offset is the distance we are from the start of the map.
   1325   1.10       mrg 	 */
   1326   1.10       mrg 
   1327   1.10       mrg 	if (uobj == NULL) {
   1328   1.10       mrg 		uoffset = 0;
   1329   1.10       mrg 	} else {
   1330   1.10       mrg 		if (uoffset == UVM_UNKNOWN_OFFSET) {
   1331   1.85       chs 			KASSERT(UVM_OBJ_IS_KERN_OBJECT(uobj));
   1332  1.174      yamt 			uoffset = start - vm_map_min(kernel_map);
   1333   1.10       mrg 		}
   1334   1.10       mrg 	}
   1335   1.10       mrg 
   1336  1.174      yamt 	args->uma_flags = flags;
   1337  1.174      yamt 	args->uma_prev = prev_entry;
   1338  1.174      yamt 	args->uma_start = start;
   1339  1.174      yamt 	args->uma_size = size;
   1340  1.174      yamt 	args->uma_uobj = uobj;
   1341  1.174      yamt 	args->uma_uoffset = uoffset;
   1342  1.174      yamt 
   1343  1.174      yamt 	return 0;
   1344  1.174      yamt }
   1345  1.174      yamt 
   1346  1.174      yamt int
   1347  1.174      yamt uvm_map_enter(struct vm_map *map, const struct uvm_map_args *args,
   1348  1.174      yamt     struct vm_map_entry *new_entry)
   1349  1.174      yamt {
   1350  1.174      yamt 	struct vm_map_entry *prev_entry = args->uma_prev;
   1351  1.174      yamt 	struct vm_map_entry *dead = NULL;
   1352  1.174      yamt 
   1353  1.174      yamt 	const uvm_flag_t flags = args->uma_flags;
   1354  1.174      yamt 	const vm_prot_t prot = UVM_PROTECTION(flags);
   1355  1.174      yamt 	const vm_prot_t maxprot = UVM_MAXPROTECTION(flags);
   1356  1.174      yamt 	const vm_inherit_t inherit = UVM_INHERIT(flags);
   1357  1.174      yamt 	const int amapwaitflag = (flags & UVM_FLAG_NOWAIT) ?
   1358  1.174      yamt 	    AMAP_EXTEND_NOWAIT : 0;
   1359  1.174      yamt 	const int advice = UVM_ADVICE(flags);
   1360  1.174      yamt 	const int meflagval = (flags & UVM_FLAG_QUANTUM) ?
   1361  1.174      yamt 	    UVM_MAP_QUANTUM : 0;
   1362  1.174      yamt 
   1363  1.174      yamt 	vaddr_t start = args->uma_start;
   1364  1.174      yamt 	vsize_t size = args->uma_size;
   1365  1.174      yamt 	struct uvm_object *uobj = args->uma_uobj;
   1366  1.174      yamt 	voff_t uoffset = args->uma_uoffset;
   1367  1.174      yamt 
   1368  1.174      yamt 	const int kmap = (vm_map_pmap(map) == pmap_kernel());
   1369  1.174      yamt 	int merged = 0;
   1370  1.174      yamt 	int error;
   1371  1.176      yamt 	int newetype;
   1372  1.174      yamt 
   1373  1.174      yamt 	UVMHIST_FUNC("uvm_map_enter");
   1374  1.174      yamt 	UVMHIST_CALLED(maphist);
   1375  1.174      yamt 
   1376  1.174      yamt 	UVMHIST_LOG(maphist, "(map=0x%x, start=0x%x, size=%d, flags=0x%x)",
   1377  1.174      yamt 	    map, start, size, flags);
   1378  1.174      yamt 	UVMHIST_LOG(maphist, "  uobj/offset 0x%x/%d", uobj, uoffset,0,0);
   1379  1.174      yamt 
   1380  1.221      yamt 	KASSERT(map->hint == prev_entry); /* bimerge case assumes this */
   1381  1.221      yamt 
   1382  1.174      yamt 	if (flags & UVM_FLAG_QUANTUM) {
   1383  1.174      yamt 		KASSERT(new_entry);
   1384  1.174      yamt 		KASSERT(new_entry->flags & UVM_MAP_QUANTUM);
   1385  1.174      yamt 	}
   1386  1.174      yamt 
   1387  1.176      yamt 	if (uobj)
   1388  1.176      yamt 		newetype = UVM_ET_OBJ;
   1389  1.176      yamt 	else
   1390  1.176      yamt 		newetype = 0;
   1391  1.176      yamt 
   1392  1.176      yamt 	if (flags & UVM_FLAG_COPYONW) {
   1393  1.176      yamt 		newetype |= UVM_ET_COPYONWRITE;
   1394  1.176      yamt 		if ((flags & UVM_FLAG_OVERLAY) == 0)
   1395  1.176      yamt 			newetype |= UVM_ET_NEEDSCOPY;
   1396  1.176      yamt 	}
   1397  1.176      yamt 
   1398   1.10       mrg 	/*
   1399  1.106       chs 	 * try and insert in map by extending previous entry, if possible.
   1400   1.10       mrg 	 * XXX: we don't try and pull back the next entry.   might be useful
   1401   1.10       mrg 	 * for a stack, but we are currently allocating our stack in advance.
   1402   1.10       mrg 	 */
   1403   1.10       mrg 
   1404  1.121    atatat 	if (flags & UVM_FLAG_NOMERGE)
   1405  1.121    atatat 		goto nomerge;
   1406  1.121    atatat 
   1407  1.194      yamt 	if (prev_entry->end == start &&
   1408  1.121    atatat 	    prev_entry != &map->header &&
   1409  1.194      yamt 	    UVM_ET_ISCOMPATIBLE(prev_entry, newetype, uobj, meflagval,
   1410  1.194      yamt 	    prot, maxprot, inherit, advice, 0)) {
   1411  1.161      matt 
   1412   1.10       mrg 		if (uobj && prev_entry->offset +
   1413   1.10       mrg 		    (prev_entry->end - prev_entry->start) != uoffset)
   1414  1.121    atatat 			goto forwardmerge;
   1415   1.10       mrg 
   1416   1.10       mrg 		/*
   1417   1.98       chs 		 * can't extend a shared amap.  note: no need to lock amap to
   1418   1.34     chuck 		 * look at refs since we don't care about its exact value.
   1419   1.10       mrg 		 * if it is one (i.e. we have only reference) it will stay there
   1420   1.10       mrg 		 */
   1421   1.85       chs 
   1422   1.10       mrg 		if (prev_entry->aref.ar_amap &&
   1423   1.34     chuck 		    amap_refs(prev_entry->aref.ar_amap) != 1) {
   1424  1.121    atatat 			goto forwardmerge;
   1425   1.10       mrg 		}
   1426   1.85       chs 
   1427  1.119       chs 		if (prev_entry->aref.ar_amap) {
   1428  1.139     enami 			error = amap_extend(prev_entry, size,
   1429  1.126    bouyer 			    amapwaitflag | AMAP_EXTEND_FORWARDS);
   1430  1.174      yamt 			if (error)
   1431  1.191      yamt 				goto nomerge;
   1432  1.119       chs 		}
   1433   1.10       mrg 
   1434  1.258        ad 		if (kmap) {
   1435  1.207      yamt 			UVMMAP_EVCNT_INCR(kbackmerge);
   1436  1.258        ad 		} else {
   1437  1.207      yamt 			UVMMAP_EVCNT_INCR(ubackmerge);
   1438  1.258        ad 		}
   1439   1.10       mrg 		UVMHIST_LOG(maphist,"  starting back merge", 0, 0, 0, 0);
   1440   1.10       mrg 
   1441   1.10       mrg 		/*
   1442   1.10       mrg 		 * drop our reference to uobj since we are extending a reference
   1443   1.10       mrg 		 * that we already have (the ref count can not drop to zero).
   1444   1.10       mrg 		 */
   1445  1.119       chs 
   1446   1.10       mrg 		if (uobj && uobj->pgops->pgo_detach)
   1447   1.10       mrg 			uobj->pgops->pgo_detach(uobj);
   1448   1.10       mrg 
   1449  1.263      matt 		/*
   1450  1.263      matt 		 * Now that we've merged the entries, note that we've grown
   1451  1.263      matt 		 * and our gap has shrunk.  Then fix the tree.
   1452  1.263      matt 		 */
   1453   1.10       mrg 		prev_entry->end += size;
   1454  1.263      matt 		prev_entry->gap -= size;
   1455  1.145      yamt 		uvm_rb_fixup(map, prev_entry);
   1456  1.145      yamt 
   1457  1.222      yamt 		uvm_map_check(map, "map backmerged");
   1458   1.10       mrg 
   1459   1.10       mrg 		UVMHIST_LOG(maphist,"<- done (via backmerge)!", 0, 0, 0, 0);
   1460  1.121    atatat 		merged++;
   1461  1.106       chs 	}
   1462   1.10       mrg 
   1463  1.121    atatat forwardmerge:
   1464  1.194      yamt 	if (prev_entry->next->start == (start + size) &&
   1465  1.121    atatat 	    prev_entry->next != &map->header &&
   1466  1.194      yamt 	    UVM_ET_ISCOMPATIBLE(prev_entry->next, newetype, uobj, meflagval,
   1467  1.194      yamt 	    prot, maxprot, inherit, advice, 0)) {
   1468  1.161      matt 
   1469  1.121    atatat 		if (uobj && prev_entry->next->offset != uoffset + size)
   1470  1.121    atatat 			goto nomerge;
   1471  1.121    atatat 
   1472  1.121    atatat 		/*
   1473  1.121    atatat 		 * can't extend a shared amap.  note: no need to lock amap to
   1474  1.121    atatat 		 * look at refs since we don't care about its exact value.
   1475  1.122    atatat 		 * if it is one (i.e. we have only reference) it will stay there.
   1476  1.122    atatat 		 *
   1477  1.122    atatat 		 * note that we also can't merge two amaps, so if we
   1478  1.122    atatat 		 * merged with the previous entry which has an amap,
   1479  1.122    atatat 		 * and the next entry also has an amap, we give up.
   1480  1.122    atatat 		 *
   1481  1.125    atatat 		 * Interesting cases:
   1482  1.125    atatat 		 * amap, new, amap -> give up second merge (single fwd extend)
   1483  1.125    atatat 		 * amap, new, none -> double forward extend (extend again here)
   1484  1.125    atatat 		 * none, new, amap -> double backward extend (done here)
   1485  1.125    atatat 		 * uobj, new, amap -> single backward extend (done here)
   1486  1.125    atatat 		 *
   1487  1.122    atatat 		 * XXX should we attempt to deal with someone refilling
   1488  1.122    atatat 		 * the deallocated region between two entries that are
   1489  1.122    atatat 		 * backed by the same amap (ie, arefs is 2, "prev" and
   1490  1.122    atatat 		 * "next" refer to it, and adding this allocation will
   1491  1.122    atatat 		 * close the hole, thus restoring arefs to 1 and
   1492  1.122    atatat 		 * deallocating the "next" vm_map_entry)?  -- @@@
   1493  1.121    atatat 		 */
   1494  1.121    atatat 
   1495  1.121    atatat 		if (prev_entry->next->aref.ar_amap &&
   1496  1.122    atatat 		    (amap_refs(prev_entry->next->aref.ar_amap) != 1 ||
   1497  1.122    atatat 		     (merged && prev_entry->aref.ar_amap))) {
   1498  1.121    atatat 			goto nomerge;
   1499  1.121    atatat 		}
   1500  1.121    atatat 
   1501  1.122    atatat 		if (merged) {
   1502  1.123    atatat 			/*
   1503  1.123    atatat 			 * Try to extend the amap of the previous entry to
   1504  1.123    atatat 			 * cover the next entry as well.  If it doesn't work
   1505  1.123    atatat 			 * just skip on, don't actually give up, since we've
   1506  1.123    atatat 			 * already completed the back merge.
   1507  1.123    atatat 			 */
   1508  1.125    atatat 			if (prev_entry->aref.ar_amap) {
   1509  1.125    atatat 				if (amap_extend(prev_entry,
   1510  1.125    atatat 				    prev_entry->next->end -
   1511  1.125    atatat 				    prev_entry->next->start,
   1512  1.126    bouyer 				    amapwaitflag | AMAP_EXTEND_FORWARDS))
   1513  1.142     enami 					goto nomerge;
   1514  1.125    atatat 			}
   1515  1.125    atatat 
   1516  1.125    atatat 			/*
   1517  1.125    atatat 			 * Try to extend the amap of the *next* entry
   1518  1.125    atatat 			 * back to cover the new allocation *and* the
   1519  1.125    atatat 			 * previous entry as well (the previous merge
   1520  1.125    atatat 			 * didn't have an amap already otherwise we
   1521  1.125    atatat 			 * wouldn't be checking here for an amap).  If
   1522  1.125    atatat 			 * it doesn't work just skip on, again, don't
   1523  1.125    atatat 			 * actually give up, since we've already
   1524  1.125    atatat 			 * completed the back merge.
   1525  1.125    atatat 			 */
   1526  1.125    atatat 			else if (prev_entry->next->aref.ar_amap) {
   1527  1.125    atatat 				if (amap_extend(prev_entry->next,
   1528  1.125    atatat 				    prev_entry->end -
   1529  1.141    atatat 				    prev_entry->start,
   1530  1.126    bouyer 				    amapwaitflag | AMAP_EXTEND_BACKWARDS))
   1531  1.142     enami 					goto nomerge;
   1532  1.125    atatat 			}
   1533  1.125    atatat 		} else {
   1534  1.125    atatat 			/*
   1535  1.125    atatat 			 * Pull the next entry's amap backwards to cover this
   1536  1.125    atatat 			 * new allocation.
   1537  1.125    atatat 			 */
   1538  1.125    atatat 			if (prev_entry->next->aref.ar_amap) {
   1539  1.125    atatat 				error = amap_extend(prev_entry->next, size,
   1540  1.126    bouyer 				    amapwaitflag | AMAP_EXTEND_BACKWARDS);
   1541  1.174      yamt 				if (error)
   1542  1.191      yamt 					goto nomerge;
   1543  1.125    atatat 			}
   1544  1.122    atatat 		}
   1545  1.122    atatat 
   1546  1.121    atatat 		if (merged) {
   1547  1.121    atatat 			if (kmap) {
   1548  1.207      yamt 				UVMMAP_EVCNT_DECR(kbackmerge);
   1549  1.207      yamt 				UVMMAP_EVCNT_INCR(kbimerge);
   1550  1.121    atatat 			} else {
   1551  1.207      yamt 				UVMMAP_EVCNT_DECR(ubackmerge);
   1552  1.207      yamt 				UVMMAP_EVCNT_INCR(ubimerge);
   1553  1.121    atatat 			}
   1554  1.122    atatat 		} else {
   1555  1.258        ad 			if (kmap) {
   1556  1.207      yamt 				UVMMAP_EVCNT_INCR(kforwmerge);
   1557  1.258        ad 			} else {
   1558  1.207      yamt 				UVMMAP_EVCNT_INCR(uforwmerge);
   1559  1.258        ad 			}
   1560  1.121    atatat 		}
   1561  1.121    atatat 		UVMHIST_LOG(maphist,"  starting forward merge", 0, 0, 0, 0);
   1562   1.10       mrg 
   1563  1.121    atatat 		/*
   1564  1.121    atatat 		 * drop our reference to uobj since we are extending a reference
   1565  1.121    atatat 		 * that we already have (the ref count can not drop to zero).
   1566  1.121    atatat 		 * (if merged, we've already detached)
   1567  1.121    atatat 		 */
   1568  1.121    atatat 		if (uobj && uobj->pgops->pgo_detach && !merged)
   1569  1.121    atatat 			uobj->pgops->pgo_detach(uobj);
   1570    1.1       mrg 
   1571  1.121    atatat 		if (merged) {
   1572  1.174      yamt 			dead = prev_entry->next;
   1573  1.121    atatat 			prev_entry->end = dead->end;
   1574  1.121    atatat 			uvm_map_entry_unlink(map, dead);
   1575  1.125    atatat 			if (dead->aref.ar_amap != NULL) {
   1576  1.125    atatat 				prev_entry->aref = dead->aref;
   1577  1.125    atatat 				dead->aref.ar_amap = NULL;
   1578  1.125    atatat 			}
   1579  1.121    atatat 		} else {
   1580  1.121    atatat 			prev_entry->next->start -= size;
   1581  1.263      matt 			if (prev_entry != &map->header) {
   1582  1.263      matt 				prev_entry->gap -= size;
   1583  1.263      matt 				KASSERT(prev_entry->gap == uvm_rb_gap(prev_entry));
   1584  1.145      yamt 				uvm_rb_fixup(map, prev_entry);
   1585  1.263      matt 			}
   1586  1.121    atatat 			if (uobj)
   1587  1.121    atatat 				prev_entry->next->offset = uoffset;
   1588  1.121    atatat 		}
   1589  1.145      yamt 
   1590  1.222      yamt 		uvm_map_check(map, "map forwardmerged");
   1591    1.1       mrg 
   1592  1.121    atatat 		UVMHIST_LOG(maphist,"<- done forwardmerge", 0, 0, 0, 0);
   1593  1.121    atatat 		merged++;
   1594  1.106       chs 	}
   1595  1.121    atatat 
   1596  1.121    atatat nomerge:
   1597  1.121    atatat 	if (!merged) {
   1598  1.121    atatat 		UVMHIST_LOG(maphist,"  allocating new map entry", 0, 0, 0, 0);
   1599  1.258        ad 		if (kmap) {
   1600  1.207      yamt 			UVMMAP_EVCNT_INCR(knomerge);
   1601  1.258        ad 		} else {
   1602  1.207      yamt 			UVMMAP_EVCNT_INCR(unomerge);
   1603  1.258        ad 		}
   1604  1.106       chs 
   1605   1.10       mrg 		/*
   1606  1.121    atatat 		 * allocate new entry and link it in.
   1607   1.10       mrg 		 */
   1608  1.106       chs 
   1609  1.121    atatat 		if (new_entry == NULL) {
   1610  1.126    bouyer 			new_entry = uvm_mapent_alloc(map,
   1611  1.127   thorpej 				(flags & UVM_FLAG_NOWAIT));
   1612  1.126    bouyer 			if (__predict_false(new_entry == NULL)) {
   1613  1.174      yamt 				error = ENOMEM;
   1614  1.174      yamt 				goto done;
   1615  1.126    bouyer 			}
   1616  1.121    atatat 		}
   1617  1.174      yamt 		new_entry->start = start;
   1618  1.121    atatat 		new_entry->end = new_entry->start + size;
   1619  1.121    atatat 		new_entry->object.uvm_obj = uobj;
   1620  1.121    atatat 		new_entry->offset = uoffset;
   1621  1.121    atatat 
   1622  1.176      yamt 		new_entry->etype = newetype;
   1623  1.121    atatat 
   1624  1.161      matt 		if (flags & UVM_FLAG_NOMERGE) {
   1625  1.161      matt 			new_entry->flags |= UVM_MAP_NOMERGE;
   1626  1.161      matt 		}
   1627  1.121    atatat 
   1628  1.121    atatat 		new_entry->protection = prot;
   1629  1.121    atatat 		new_entry->max_protection = maxprot;
   1630  1.121    atatat 		new_entry->inheritance = inherit;
   1631  1.121    atatat 		new_entry->wired_count = 0;
   1632  1.121    atatat 		new_entry->advice = advice;
   1633  1.121    atatat 		if (flags & UVM_FLAG_OVERLAY) {
   1634  1.121    atatat 
   1635  1.121    atatat 			/*
   1636  1.121    atatat 			 * to_add: for BSS we overallocate a little since we
   1637  1.121    atatat 			 * are likely to extend
   1638  1.121    atatat 			 */
   1639  1.121    atatat 
   1640  1.121    atatat 			vaddr_t to_add = (flags & UVM_FLAG_AMAPPAD) ?
   1641  1.121    atatat 				UVM_AMAP_CHUNK << PAGE_SHIFT : 0;
   1642  1.126    bouyer 			struct vm_amap *amap = amap_alloc(size, to_add,
   1643  1.227      yamt 			    (flags & UVM_FLAG_NOWAIT));
   1644  1.126    bouyer 			if (__predict_false(amap == NULL)) {
   1645  1.174      yamt 				error = ENOMEM;
   1646  1.174      yamt 				goto done;
   1647  1.126    bouyer 			}
   1648  1.121    atatat 			new_entry->aref.ar_pageoff = 0;
   1649  1.121    atatat 			new_entry->aref.ar_amap = amap;
   1650  1.121    atatat 		} else {
   1651  1.121    atatat 			new_entry->aref.ar_pageoff = 0;
   1652  1.121    atatat 			new_entry->aref.ar_amap = NULL;
   1653  1.121    atatat 		}
   1654  1.121    atatat 		uvm_map_entry_link(map, prev_entry, new_entry);
   1655    1.1       mrg 
   1656  1.121    atatat 		/*
   1657  1.121    atatat 		 * Update the free space hint
   1658  1.121    atatat 		 */
   1659   1.10       mrg 
   1660  1.121    atatat 		if ((map->first_free == prev_entry) &&
   1661  1.121    atatat 		    (prev_entry->end >= new_entry->start))
   1662  1.121    atatat 			map->first_free = new_entry;
   1663  1.174      yamt 
   1664  1.174      yamt 		new_entry = NULL;
   1665  1.121    atatat 	}
   1666   1.10       mrg 
   1667  1.146      yamt 	map->size += size;
   1668  1.146      yamt 
   1669   1.10       mrg 	UVMHIST_LOG(maphist,"<- done!", 0, 0, 0, 0);
   1670  1.174      yamt 
   1671  1.174      yamt 	error = 0;
   1672  1.174      yamt done:
   1673  1.248        ad 	if ((flags & UVM_FLAG_QUANTUM) == 0) {
   1674  1.248        ad 		/*
   1675  1.248        ad 		 * vmk_merged_entries is locked by the map's lock.
   1676  1.248        ad 		 */
   1677  1.248        ad 		vm_map_unlock(map);
   1678  1.248        ad 	}
   1679  1.248        ad 	if (new_entry && error == 0) {
   1680  1.248        ad 		KDASSERT(merged);
   1681  1.248        ad 		uvm_mapent_free_merged(map, new_entry);
   1682  1.248        ad 		new_entry = NULL;
   1683  1.174      yamt 	}
   1684  1.174      yamt 	if (dead) {
   1685  1.174      yamt 		KDASSERT(merged);
   1686  1.181      yamt 		uvm_mapent_free_merged(map, dead);
   1687  1.174      yamt 	}
   1688  1.248        ad 	if ((flags & UVM_FLAG_QUANTUM) != 0) {
   1689  1.248        ad 		vm_map_unlock(map);
   1690  1.248        ad 	}
   1691  1.248        ad 	if (new_entry != NULL) {
   1692  1.248        ad 		uvm_mapent_free(new_entry);
   1693  1.248        ad 	}
   1694  1.174      yamt 	return error;
   1695    1.1       mrg }
   1696    1.1       mrg 
   1697    1.1       mrg /*
   1698  1.247      yamt  * uvm_map_lookup_entry_bytree: lookup an entry in tree
   1699  1.247      yamt  */
   1700  1.247      yamt 
   1701  1.263      matt static inline bool
   1702  1.247      yamt uvm_map_lookup_entry_bytree(struct vm_map *map, vaddr_t address,
   1703  1.247      yamt     struct vm_map_entry **entry	/* OUT */)
   1704  1.247      yamt {
   1705  1.247      yamt 	struct vm_map_entry *prev = &map->header;
   1706  1.263      matt 	struct vm_map_entry *cur = ROOT_ENTRY(map);
   1707  1.247      yamt 
   1708  1.247      yamt 	while (cur) {
   1709  1.263      matt 		UVMMAP_EVCNT_INCR(mlk_treeloop);
   1710  1.247      yamt 		if (address >= cur->start) {
   1711  1.247      yamt 			if (address < cur->end) {
   1712  1.247      yamt 				*entry = cur;
   1713  1.247      yamt 				return true;
   1714  1.247      yamt 			}
   1715  1.247      yamt 			prev = cur;
   1716  1.263      matt 			cur = RIGHT_ENTRY(cur);
   1717  1.247      yamt 		} else
   1718  1.263      matt 			cur = LEFT_ENTRY(cur);
   1719  1.247      yamt 	}
   1720  1.247      yamt 	*entry = prev;
   1721  1.247      yamt 	return false;
   1722  1.247      yamt }
   1723  1.247      yamt 
   1724  1.247      yamt /*
   1725    1.1       mrg  * uvm_map_lookup_entry: find map entry at or before an address
   1726    1.1       mrg  *
   1727    1.1       mrg  * => map must at least be read-locked by caller
   1728    1.1       mrg  * => entry is returned in "entry"
   1729    1.1       mrg  * => return value is true if address is in the returned entry
   1730    1.1       mrg  */
   1731    1.1       mrg 
   1732  1.233   thorpej bool
   1733  1.138     enami uvm_map_lookup_entry(struct vm_map *map, vaddr_t address,
   1734  1.138     enami     struct vm_map_entry **entry	/* OUT */)
   1735    1.1       mrg {
   1736   1.99       chs 	struct vm_map_entry *cur;
   1737  1.234   thorpej 	bool use_tree = false;
   1738    1.1       mrg 	UVMHIST_FUNC("uvm_map_lookup_entry");
   1739    1.1       mrg 	UVMHIST_CALLED(maphist);
   1740    1.1       mrg 
   1741    1.1       mrg 	UVMHIST_LOG(maphist,"(map=0x%x,addr=0x%x,ent=0x%x)",
   1742   1.10       mrg 	    map, address, entry, 0);
   1743    1.1       mrg 
   1744    1.1       mrg 	/*
   1745   1.10       mrg 	 * start looking either from the head of the
   1746   1.10       mrg 	 * list, or from the hint.
   1747    1.1       mrg 	 */
   1748    1.1       mrg 
   1749    1.1       mrg 	cur = map->hint;
   1750    1.1       mrg 
   1751    1.1       mrg 	if (cur == &map->header)
   1752    1.1       mrg 		cur = cur->next;
   1753    1.1       mrg 
   1754  1.207      yamt 	UVMMAP_EVCNT_INCR(mlk_call);
   1755    1.1       mrg 	if (address >= cur->start) {
   1756   1.99       chs 
   1757  1.139     enami 		/*
   1758   1.10       mrg 		 * go from hint to end of list.
   1759    1.1       mrg 		 *
   1760   1.10       mrg 		 * but first, make a quick check to see if
   1761   1.10       mrg 		 * we are already looking at the entry we
   1762   1.10       mrg 		 * want (which is usually the case).
   1763   1.10       mrg 		 * note also that we don't need to save the hint
   1764   1.10       mrg 		 * here... it is the same hint (unless we are
   1765   1.10       mrg 		 * at the header, in which case the hint didn't
   1766   1.10       mrg 		 * buy us anything anyway).
   1767    1.1       mrg 		 */
   1768   1.99       chs 
   1769  1.144      yamt 		if (cur != &map->header && cur->end > address) {
   1770  1.207      yamt 			UVMMAP_EVCNT_INCR(mlk_hint);
   1771    1.1       mrg 			*entry = cur;
   1772    1.1       mrg 			UVMHIST_LOG(maphist,"<- got it via hint (0x%x)",
   1773   1.10       mrg 			    cur, 0, 0, 0);
   1774  1.218      yamt 			uvm_mapent_check(*entry);
   1775  1.234   thorpej 			return (true);
   1776    1.1       mrg 		}
   1777  1.144      yamt 
   1778  1.263      matt 		if (map->nentries > 15)
   1779  1.234   thorpej 			use_tree = true;
   1780   1.10       mrg 	} else {
   1781   1.99       chs 
   1782  1.139     enami 		/*
   1783  1.144      yamt 		 * invalid hint.  use tree.
   1784    1.1       mrg 		 */
   1785  1.234   thorpej 		use_tree = true;
   1786  1.144      yamt 	}
   1787  1.144      yamt 
   1788  1.222      yamt 	uvm_map_check(map, __func__);
   1789  1.144      yamt 
   1790  1.144      yamt 	if (use_tree) {
   1791  1.144      yamt 		/*
   1792  1.144      yamt 		 * Simple lookup in the tree.  Happens when the hint is
   1793  1.144      yamt 		 * invalid, or nentries reach a threshold.
   1794  1.144      yamt 		 */
   1795  1.263      matt 		UVMMAP_EVCNT_INCR(mlk_tree);
   1796  1.247      yamt 		if (uvm_map_lookup_entry_bytree(map, address, entry)) {
   1797  1.247      yamt 			goto got;
   1798  1.247      yamt 		} else {
   1799  1.247      yamt 			goto failed;
   1800  1.144      yamt 		}
   1801    1.1       mrg 	}
   1802    1.1       mrg 
   1803    1.1       mrg 	/*
   1804   1.10       mrg 	 * search linearly
   1805    1.1       mrg 	 */
   1806    1.1       mrg 
   1807  1.263      matt 	UVMMAP_EVCNT_INCR(mlk_list);
   1808  1.144      yamt 	while (cur != &map->header) {
   1809  1.263      matt 		UVMMAP_EVCNT_INCR(mlk_listloop);
   1810    1.1       mrg 		if (cur->end > address) {
   1811    1.1       mrg 			if (address >= cur->start) {
   1812  1.139     enami 				/*
   1813   1.10       mrg 				 * save this lookup for future
   1814   1.10       mrg 				 * hints, and return
   1815    1.1       mrg 				 */
   1816    1.1       mrg 
   1817    1.1       mrg 				*entry = cur;
   1818  1.144      yamt got:
   1819  1.144      yamt 				SAVE_HINT(map, map->hint, *entry);
   1820    1.1       mrg 				UVMHIST_LOG(maphist,"<- search got it (0x%x)",
   1821   1.10       mrg 					cur, 0, 0, 0);
   1822  1.144      yamt 				KDASSERT((*entry)->start <= address);
   1823  1.144      yamt 				KDASSERT(address < (*entry)->end);
   1824  1.218      yamt 				uvm_mapent_check(*entry);
   1825  1.234   thorpej 				return (true);
   1826    1.1       mrg 			}
   1827    1.1       mrg 			break;
   1828    1.1       mrg 		}
   1829    1.1       mrg 		cur = cur->next;
   1830    1.1       mrg 	}
   1831    1.1       mrg 	*entry = cur->prev;
   1832  1.144      yamt failed:
   1833   1.82   thorpej 	SAVE_HINT(map, map->hint, *entry);
   1834    1.1       mrg 	UVMHIST_LOG(maphist,"<- failed!",0,0,0,0);
   1835  1.147      yamt 	KDASSERT((*entry) == &map->header || (*entry)->end <= address);
   1836  1.144      yamt 	KDASSERT((*entry)->next == &map->header ||
   1837  1.144      yamt 	    address < (*entry)->next->start);
   1838  1.234   thorpej 	return (false);
   1839    1.1       mrg }
   1840    1.1       mrg 
   1841    1.1       mrg /*
   1842  1.140     enami  * See if the range between start and start + length fits in the gap
   1843  1.140     enami  * entry->next->start and entry->end.  Returns 1 if fits, 0 if doesn't
   1844  1.140     enami  * fit, and -1 address wraps around.
   1845  1.140     enami  */
   1846  1.203   thorpej static int
   1847  1.232      yamt uvm_map_space_avail(vaddr_t *start, vsize_t length, voff_t uoffset,
   1848  1.140     enami     vsize_t align, int topdown, struct vm_map_entry *entry)
   1849  1.140     enami {
   1850  1.140     enami 	vaddr_t end;
   1851  1.140     enami 
   1852  1.140     enami #ifdef PMAP_PREFER
   1853  1.140     enami 	/*
   1854  1.140     enami 	 * push start address forward as needed to avoid VAC alias problems.
   1855  1.140     enami 	 * we only do this if a valid offset is specified.
   1856  1.140     enami 	 */
   1857  1.140     enami 
   1858  1.140     enami 	if (uoffset != UVM_UNKNOWN_OFFSET)
   1859  1.182    atatat 		PMAP_PREFER(uoffset, start, length, topdown);
   1860  1.140     enami #endif
   1861  1.140     enami 	if (align != 0) {
   1862  1.140     enami 		if ((*start & (align - 1)) != 0) {
   1863  1.140     enami 			if (topdown)
   1864  1.140     enami 				*start &= ~(align - 1);
   1865  1.140     enami 			else
   1866  1.140     enami 				*start = roundup(*start, align);
   1867  1.140     enami 		}
   1868  1.140     enami 		/*
   1869  1.140     enami 		 * XXX Should we PMAP_PREFER() here again?
   1870  1.182    atatat 		 * eh...i think we're okay
   1871  1.140     enami 		 */
   1872  1.140     enami 	}
   1873  1.140     enami 
   1874  1.140     enami 	/*
   1875  1.140     enami 	 * Find the end of the proposed new region.  Be sure we didn't
   1876  1.140     enami 	 * wrap around the address; if so, we lose.  Otherwise, if the
   1877  1.140     enami 	 * proposed new region fits before the next entry, we win.
   1878  1.140     enami 	 */
   1879  1.140     enami 
   1880  1.140     enami 	end = *start + length;
   1881  1.140     enami 	if (end < *start)
   1882  1.140     enami 		return (-1);
   1883  1.140     enami 
   1884  1.140     enami 	if (entry->next->start >= end && *start >= entry->end)
   1885  1.140     enami 		return (1);
   1886  1.140     enami 
   1887  1.140     enami 	return (0);
   1888  1.140     enami }
   1889  1.140     enami 
   1890  1.140     enami /*
   1891    1.1       mrg  * uvm_map_findspace: find "length" sized space in "map".
   1892    1.1       mrg  *
   1893  1.167  junyoung  * => "hint" is a hint about where we want it, unless UVM_FLAG_FIXED is
   1894  1.167  junyoung  *	set in "flags" (in which case we insist on using "hint").
   1895    1.1       mrg  * => "result" is VA returned
   1896    1.1       mrg  * => uobj/uoffset are to be used to handle VAC alignment, if required
   1897  1.167  junyoung  * => if "align" is non-zero, we attempt to align to that value.
   1898    1.1       mrg  * => caller must at least have read-locked map
   1899    1.1       mrg  * => returns NULL on failure, or pointer to prev. map entry if success
   1900    1.1       mrg  * => note this is a cross between the old vm_map_findspace and vm_map_find
   1901    1.1       mrg  */
   1902    1.1       mrg 
   1903   1.99       chs struct vm_map_entry *
   1904  1.138     enami uvm_map_findspace(struct vm_map *map, vaddr_t hint, vsize_t length,
   1905  1.232      yamt     vaddr_t *result /* OUT */, struct uvm_object *uobj, voff_t uoffset,
   1906  1.138     enami     vsize_t align, int flags)
   1907    1.1       mrg {
   1908  1.140     enami 	struct vm_map_entry *entry;
   1909  1.144      yamt 	struct vm_map_entry *child, *prev, *tmp;
   1910  1.140     enami 	vaddr_t orig_hint;
   1911  1.131    atatat 	const int topdown = map->flags & VM_MAP_TOPDOWN;
   1912    1.1       mrg 	UVMHIST_FUNC("uvm_map_findspace");
   1913    1.1       mrg 	UVMHIST_CALLED(maphist);
   1914    1.1       mrg 
   1915   1.98       chs 	UVMHIST_LOG(maphist, "(map=0x%x, hint=0x%x, len=%d, flags=0x%x)",
   1916  1.140     enami 	    map, hint, length, flags);
   1917   1.85       chs 	KASSERT((align & (align - 1)) == 0);
   1918   1.85       chs 	KASSERT((flags & UVM_FLAG_FIXED) == 0 || align == 0);
   1919   1.81   thorpej 
   1920  1.222      yamt 	uvm_map_check(map, "map_findspace entry");
   1921  1.144      yamt 
   1922   1.81   thorpej 	/*
   1923   1.81   thorpej 	 * remember the original hint.  if we are aligning, then we
   1924   1.81   thorpej 	 * may have to try again with no alignment constraint if
   1925   1.81   thorpej 	 * we fail the first time.
   1926   1.81   thorpej 	 */
   1927   1.85       chs 
   1928   1.81   thorpej 	orig_hint = hint;
   1929  1.184       chs 	if (hint < vm_map_min(map)) {	/* check ranges ... */
   1930   1.81   thorpej 		if (flags & UVM_FLAG_FIXED) {
   1931    1.1       mrg 			UVMHIST_LOG(maphist,"<- VA below map range",0,0,0,0);
   1932  1.139     enami 			return (NULL);
   1933    1.1       mrg 		}
   1934  1.184       chs 		hint = vm_map_min(map);
   1935    1.1       mrg 	}
   1936  1.184       chs 	if (hint > vm_map_max(map)) {
   1937    1.1       mrg 		UVMHIST_LOG(maphist,"<- VA 0x%x > range [0x%x->0x%x]",
   1938  1.184       chs 		    hint, vm_map_min(map), vm_map_max(map), 0);
   1939  1.139     enami 		return (NULL);
   1940    1.1       mrg 	}
   1941    1.1       mrg 
   1942    1.1       mrg 	/*
   1943    1.1       mrg 	 * Look for the first possible address; if there's already
   1944    1.1       mrg 	 * something at this address, we have to start after it.
   1945    1.1       mrg 	 */
   1946    1.1       mrg 
   1947  1.131    atatat 	/*
   1948  1.131    atatat 	 * @@@: there are four, no, eight cases to consider.
   1949  1.131    atatat 	 *
   1950  1.131    atatat 	 * 0: found,     fixed,     bottom up -> fail
   1951  1.131    atatat 	 * 1: found,     fixed,     top down  -> fail
   1952  1.140     enami 	 * 2: found,     not fixed, bottom up -> start after entry->end,
   1953  1.140     enami 	 *                                       loop up
   1954  1.140     enami 	 * 3: found,     not fixed, top down  -> start before entry->start,
   1955  1.140     enami 	 *                                       loop down
   1956  1.140     enami 	 * 4: not found, fixed,     bottom up -> check entry->next->start, fail
   1957  1.140     enami 	 * 5: not found, fixed,     top down  -> check entry->next->start, fail
   1958  1.140     enami 	 * 6: not found, not fixed, bottom up -> check entry->next->start,
   1959  1.140     enami 	 *                                       loop up
   1960  1.140     enami 	 * 7: not found, not fixed, top down  -> check entry->next->start,
   1961  1.140     enami 	 *                                       loop down
   1962  1.131    atatat 	 *
   1963  1.131    atatat 	 * as you can see, it reduces to roughly five cases, and that
   1964  1.131    atatat 	 * adding top down mapping only adds one unique case (without
   1965  1.131    atatat 	 * it, there would be four cases).
   1966  1.131    atatat 	 */
   1967  1.131    atatat 
   1968  1.184       chs 	if ((flags & UVM_FLAG_FIXED) == 0 && hint == vm_map_min(map)) {
   1969  1.140     enami 		entry = map->first_free;
   1970    1.1       mrg 	} else {
   1971  1.140     enami 		if (uvm_map_lookup_entry(map, hint, &entry)) {
   1972    1.1       mrg 			/* "hint" address already in use ... */
   1973   1.81   thorpej 			if (flags & UVM_FLAG_FIXED) {
   1974  1.140     enami 				UVMHIST_LOG(maphist, "<- fixed & VA in use",
   1975   1.10       mrg 				    0, 0, 0, 0);
   1976  1.139     enami 				return (NULL);
   1977    1.1       mrg 			}
   1978  1.140     enami 			if (topdown)
   1979  1.140     enami 				/* Start from lower gap. */
   1980  1.140     enami 				entry = entry->prev;
   1981  1.140     enami 		} else if (flags & UVM_FLAG_FIXED) {
   1982  1.140     enami 			if (entry->next->start >= hint + length &&
   1983  1.140     enami 			    hint + length > hint)
   1984  1.140     enami 				goto found;
   1985  1.140     enami 
   1986  1.140     enami 			/* "hint" address is gap but too small */
   1987  1.140     enami 			UVMHIST_LOG(maphist, "<- fixed mapping failed",
   1988  1.140     enami 			    0, 0, 0, 0);
   1989  1.140     enami 			return (NULL); /* only one shot at it ... */
   1990  1.140     enami 		} else {
   1991  1.140     enami 			/*
   1992  1.140     enami 			 * See if given hint fits in this gap.
   1993  1.140     enami 			 */
   1994  1.140     enami 			switch (uvm_map_space_avail(&hint, length,
   1995  1.140     enami 			    uoffset, align, topdown, entry)) {
   1996  1.140     enami 			case 1:
   1997  1.140     enami 				goto found;
   1998  1.140     enami 			case -1:
   1999  1.140     enami 				goto wraparound;
   2000  1.140     enami 			}
   2001  1.140     enami 
   2002  1.148      yamt 			if (topdown) {
   2003  1.140     enami 				/*
   2004  1.140     enami 				 * Still there is a chance to fit
   2005  1.140     enami 				 * if hint > entry->end.
   2006  1.140     enami 				 */
   2007  1.148      yamt 			} else {
   2008  1.168  junyoung 				/* Start from higher gap. */
   2009  1.148      yamt 				entry = entry->next;
   2010  1.148      yamt 				if (entry == &map->header)
   2011  1.148      yamt 					goto notfound;
   2012  1.140     enami 				goto nextgap;
   2013  1.148      yamt 			}
   2014    1.1       mrg 		}
   2015    1.1       mrg 	}
   2016    1.1       mrg 
   2017    1.1       mrg 	/*
   2018  1.144      yamt 	 * Note that all UVM_FLAGS_FIXED case is already handled.
   2019  1.144      yamt 	 */
   2020  1.144      yamt 	KDASSERT((flags & UVM_FLAG_FIXED) == 0);
   2021  1.144      yamt 
   2022  1.144      yamt 	/* Try to find the space in the red-black tree */
   2023  1.144      yamt 
   2024  1.144      yamt 	/* Check slot before any entry */
   2025  1.144      yamt 	hint = topdown ? entry->next->start - length : entry->end;
   2026  1.144      yamt 	switch (uvm_map_space_avail(&hint, length, uoffset, align,
   2027  1.144      yamt 	    topdown, entry)) {
   2028  1.144      yamt 	case 1:
   2029  1.144      yamt 		goto found;
   2030  1.144      yamt 	case -1:
   2031  1.144      yamt 		goto wraparound;
   2032  1.144      yamt 	}
   2033  1.144      yamt 
   2034  1.144      yamt nextgap:
   2035  1.148      yamt 	KDASSERT((flags & UVM_FLAG_FIXED) == 0);
   2036  1.144      yamt 	/* If there is not enough space in the whole tree, we fail */
   2037  1.263      matt 	tmp = ROOT_ENTRY(map);
   2038  1.263      matt 	if (tmp == NULL || tmp->maxgap < length)
   2039  1.144      yamt 		goto notfound;
   2040  1.144      yamt 
   2041  1.144      yamt 	prev = NULL; /* previous candidate */
   2042  1.144      yamt 
   2043  1.144      yamt 	/* Find an entry close to hint that has enough space */
   2044  1.144      yamt 	for (; tmp;) {
   2045  1.263      matt 		KASSERT(tmp->next->start == tmp->end + tmp->gap);
   2046  1.144      yamt 		if (topdown) {
   2047  1.144      yamt 			if (tmp->next->start < hint + length &&
   2048  1.144      yamt 			    (prev == NULL || tmp->end > prev->end)) {
   2049  1.263      matt 				if (tmp->gap >= length)
   2050  1.144      yamt 					prev = tmp;
   2051  1.263      matt 				else if ((child = LEFT_ENTRY(tmp)) != NULL
   2052  1.263      matt 				    && child->maxgap >= length)
   2053  1.144      yamt 					prev = tmp;
   2054  1.144      yamt 			}
   2055  1.144      yamt 		} else {
   2056  1.144      yamt 			if (tmp->end >= hint &&
   2057  1.144      yamt 			    (prev == NULL || tmp->end < prev->end)) {
   2058  1.263      matt 				if (tmp->gap >= length)
   2059  1.144      yamt 					prev = tmp;
   2060  1.263      matt 				else if ((child = RIGHT_ENTRY(tmp)) != NULL
   2061  1.263      matt 				    && child->maxgap >= length)
   2062  1.144      yamt 					prev = tmp;
   2063  1.144      yamt 			}
   2064  1.144      yamt 		}
   2065  1.144      yamt 		if (tmp->next->start < hint + length)
   2066  1.263      matt 			child = RIGHT_ENTRY(tmp);
   2067  1.144      yamt 		else if (tmp->end > hint)
   2068  1.263      matt 			child = LEFT_ENTRY(tmp);
   2069  1.144      yamt 		else {
   2070  1.263      matt 			if (tmp->gap >= length)
   2071  1.144      yamt 				break;
   2072  1.144      yamt 			if (topdown)
   2073  1.263      matt 				child = LEFT_ENTRY(tmp);
   2074  1.144      yamt 			else
   2075  1.263      matt 				child = RIGHT_ENTRY(tmp);
   2076  1.144      yamt 		}
   2077  1.263      matt 		if (child == NULL || child->maxgap < length)
   2078  1.144      yamt 			break;
   2079  1.144      yamt 		tmp = child;
   2080  1.144      yamt 	}
   2081  1.144      yamt 
   2082  1.148      yamt 	if (tmp != NULL && tmp->start < hint && hint < tmp->next->start) {
   2083  1.164  junyoung 		/*
   2084  1.144      yamt 		 * Check if the entry that we found satifies the
   2085  1.144      yamt 		 * space requirement
   2086  1.144      yamt 		 */
   2087  1.148      yamt 		if (topdown) {
   2088  1.149      yamt 			if (hint > tmp->next->start - length)
   2089  1.149      yamt 				hint = tmp->next->start - length;
   2090  1.148      yamt 		} else {
   2091  1.149      yamt 			if (hint < tmp->end)
   2092  1.149      yamt 				hint = tmp->end;
   2093  1.148      yamt 		}
   2094  1.148      yamt 		switch (uvm_map_space_avail(&hint, length, uoffset, align,
   2095  1.148      yamt 		    topdown, tmp)) {
   2096  1.148      yamt 		case 1:
   2097  1.144      yamt 			entry = tmp;
   2098  1.144      yamt 			goto found;
   2099  1.148      yamt 		case -1:
   2100  1.148      yamt 			goto wraparound;
   2101  1.144      yamt 		}
   2102  1.263      matt 		if (tmp->gap >= length)
   2103  1.144      yamt 			goto listsearch;
   2104  1.144      yamt 	}
   2105  1.144      yamt 	if (prev == NULL)
   2106  1.144      yamt 		goto notfound;
   2107  1.144      yamt 
   2108  1.148      yamt 	if (topdown) {
   2109  1.150      yamt 		KASSERT(orig_hint >= prev->next->start - length ||
   2110  1.148      yamt 		    prev->next->start - length > prev->next->start);
   2111  1.148      yamt 		hint = prev->next->start - length;
   2112  1.148      yamt 	} else {
   2113  1.150      yamt 		KASSERT(orig_hint <= prev->end);
   2114  1.148      yamt 		hint = prev->end;
   2115  1.148      yamt 	}
   2116  1.148      yamt 	switch (uvm_map_space_avail(&hint, length, uoffset, align,
   2117  1.148      yamt 	    topdown, prev)) {
   2118  1.148      yamt 	case 1:
   2119  1.144      yamt 		entry = prev;
   2120  1.144      yamt 		goto found;
   2121  1.148      yamt 	case -1:
   2122  1.148      yamt 		goto wraparound;
   2123  1.144      yamt 	}
   2124  1.263      matt 	if (prev->gap >= length)
   2125  1.144      yamt 		goto listsearch;
   2126  1.164  junyoung 
   2127  1.144      yamt 	if (topdown)
   2128  1.263      matt 		tmp = LEFT_ENTRY(prev);
   2129  1.144      yamt 	else
   2130  1.263      matt 		tmp = RIGHT_ENTRY(prev);
   2131  1.144      yamt 	for (;;) {
   2132  1.263      matt 		KASSERT(tmp && tmp->maxgap >= length);
   2133  1.144      yamt 		if (topdown)
   2134  1.263      matt 			child = RIGHT_ENTRY(tmp);
   2135  1.144      yamt 		else
   2136  1.263      matt 			child = LEFT_ENTRY(tmp);
   2137  1.263      matt 		if (child && child->maxgap >= length) {
   2138  1.144      yamt 			tmp = child;
   2139  1.144      yamt 			continue;
   2140  1.144      yamt 		}
   2141  1.263      matt 		if (tmp->gap >= length)
   2142  1.144      yamt 			break;
   2143  1.144      yamt 		if (topdown)
   2144  1.263      matt 			tmp = LEFT_ENTRY(tmp);
   2145  1.144      yamt 		else
   2146  1.263      matt 			tmp = RIGHT_ENTRY(tmp);
   2147  1.144      yamt 	}
   2148  1.164  junyoung 
   2149  1.148      yamt 	if (topdown) {
   2150  1.150      yamt 		KASSERT(orig_hint >= tmp->next->start - length ||
   2151  1.148      yamt 		    tmp->next->start - length > tmp->next->start);
   2152  1.148      yamt 		hint = tmp->next->start - length;
   2153  1.148      yamt 	} else {
   2154  1.150      yamt 		KASSERT(orig_hint <= tmp->end);
   2155  1.148      yamt 		hint = tmp->end;
   2156  1.148      yamt 	}
   2157  1.144      yamt 	switch (uvm_map_space_avail(&hint, length, uoffset, align,
   2158  1.144      yamt 	    topdown, tmp)) {
   2159  1.144      yamt 	case 1:
   2160  1.144      yamt 		entry = tmp;
   2161  1.144      yamt 		goto found;
   2162  1.148      yamt 	case -1:
   2163  1.148      yamt 		goto wraparound;
   2164  1.144      yamt 	}
   2165  1.144      yamt 
   2166  1.164  junyoung 	/*
   2167  1.144      yamt 	 * The tree fails to find an entry because of offset or alignment
   2168  1.144      yamt 	 * restrictions.  Search the list instead.
   2169  1.144      yamt 	 */
   2170  1.144      yamt  listsearch:
   2171  1.144      yamt 	/*
   2172    1.1       mrg 	 * Look through the rest of the map, trying to fit a new region in
   2173    1.1       mrg 	 * the gap between existing regions, or after the very last region.
   2174  1.140     enami 	 * note: entry->end = base VA of current gap,
   2175  1.140     enami 	 *	 entry->next->start = VA of end of current gap
   2176    1.1       mrg 	 */
   2177   1.99       chs 
   2178  1.140     enami 	for (;;) {
   2179  1.140     enami 		/* Update hint for current gap. */
   2180  1.140     enami 		hint = topdown ? entry->next->start - length : entry->end;
   2181  1.140     enami 
   2182  1.140     enami 		/* See if it fits. */
   2183  1.140     enami 		switch (uvm_map_space_avail(&hint, length, uoffset, align,
   2184  1.140     enami 		    topdown, entry)) {
   2185  1.140     enami 		case 1:
   2186  1.140     enami 			goto found;
   2187  1.140     enami 		case -1:
   2188  1.140     enami 			goto wraparound;
   2189  1.140     enami 		}
   2190  1.140     enami 
   2191  1.140     enami 		/* Advance to next/previous gap */
   2192  1.140     enami 		if (topdown) {
   2193  1.140     enami 			if (entry == &map->header) {
   2194  1.140     enami 				UVMHIST_LOG(maphist, "<- failed (off start)",
   2195  1.140     enami 				    0,0,0,0);
   2196  1.140     enami 				goto notfound;
   2197  1.134      matt 			}
   2198  1.140     enami 			entry = entry->prev;
   2199  1.140     enami 		} else {
   2200  1.140     enami 			entry = entry->next;
   2201  1.140     enami 			if (entry == &map->header) {
   2202  1.140     enami 				UVMHIST_LOG(maphist, "<- failed (off end)",
   2203   1.81   thorpej 				    0,0,0,0);
   2204  1.140     enami 				goto notfound;
   2205   1.81   thorpej 			}
   2206    1.1       mrg 		}
   2207    1.1       mrg 	}
   2208  1.140     enami 
   2209  1.140     enami  found:
   2210   1.82   thorpej 	SAVE_HINT(map, map->hint, entry);
   2211    1.1       mrg 	*result = hint;
   2212    1.1       mrg 	UVMHIST_LOG(maphist,"<- got it!  (result=0x%x)", hint, 0,0,0);
   2213  1.148      yamt 	KASSERT( topdown || hint >= orig_hint);
   2214  1.148      yamt 	KASSERT(!topdown || hint <= orig_hint);
   2215  1.144      yamt 	KASSERT(entry->end <= hint);
   2216  1.144      yamt 	KASSERT(hint + length <= entry->next->start);
   2217    1.1       mrg 	return (entry);
   2218  1.140     enami 
   2219  1.140     enami  wraparound:
   2220  1.140     enami 	UVMHIST_LOG(maphist, "<- failed (wrap around)", 0,0,0,0);
   2221  1.140     enami 
   2222  1.165      yamt 	return (NULL);
   2223  1.165      yamt 
   2224  1.140     enami  notfound:
   2225  1.165      yamt 	UVMHIST_LOG(maphist, "<- failed (notfound)", 0,0,0,0);
   2226  1.165      yamt 
   2227  1.140     enami 	return (NULL);
   2228    1.1       mrg }
   2229    1.1       mrg 
   2230    1.1       mrg /*
   2231    1.1       mrg  *   U N M A P   -   m a i n   h e l p e r   f u n c t i o n s
   2232    1.1       mrg  */
   2233    1.1       mrg 
   2234    1.1       mrg /*
   2235    1.1       mrg  * uvm_unmap_remove: remove mappings from a vm_map (from "start" up to "stop")
   2236    1.1       mrg  *
   2237   1.98       chs  * => caller must check alignment and size
   2238    1.1       mrg  * => map must be locked by caller
   2239    1.1       mrg  * => we return a list of map entries that we've remove from the map
   2240    1.1       mrg  *    in "entry_list"
   2241    1.1       mrg  */
   2242    1.1       mrg 
   2243   1.94       chs void
   2244  1.138     enami uvm_unmap_remove(struct vm_map *map, vaddr_t start, vaddr_t end,
   2245  1.174      yamt     struct vm_map_entry **entry_list /* OUT */,
   2246  1.187      yamt     struct uvm_mapent_reservation *umr, int flags)
   2247   1.10       mrg {
   2248   1.99       chs 	struct vm_map_entry *entry, *first_entry, *next;
   2249   1.24       eeh 	vaddr_t len;
   2250   1.99       chs 	UVMHIST_FUNC("uvm_unmap_remove"); UVMHIST_CALLED(maphist);
   2251   1.10       mrg 
   2252   1.10       mrg 	UVMHIST_LOG(maphist,"(map=0x%x, start=0x%x, end=0x%x)",
   2253   1.10       mrg 	    map, start, end, 0);
   2254   1.10       mrg 	VM_MAP_RANGE_CHECK(map, start, end);
   2255   1.10       mrg 
   2256  1.222      yamt 	uvm_map_check(map, "unmap_remove entry");
   2257  1.144      yamt 
   2258   1.10       mrg 	/*
   2259   1.10       mrg 	 * find first entry
   2260   1.10       mrg 	 */
   2261   1.99       chs 
   2262  1.234   thorpej 	if (uvm_map_lookup_entry(map, start, &first_entry) == true) {
   2263   1.29     chuck 		/* clip and go... */
   2264   1.10       mrg 		entry = first_entry;
   2265  1.174      yamt 		UVM_MAP_CLIP_START(map, entry, start, umr);
   2266   1.10       mrg 		/* critical!  prevents stale hint */
   2267   1.82   thorpej 		SAVE_HINT(map, entry, entry->prev);
   2268   1.10       mrg 	} else {
   2269   1.10       mrg 		entry = first_entry->next;
   2270   1.10       mrg 	}
   2271   1.10       mrg 
   2272   1.10       mrg 	/*
   2273   1.10       mrg 	 * Save the free space hint
   2274   1.10       mrg 	 */
   2275   1.10       mrg 
   2276  1.220      yamt 	if (map->first_free != &map->header && map->first_free->start >= start)
   2277   1.10       mrg 		map->first_free = entry->prev;
   2278   1.10       mrg 
   2279   1.10       mrg 	/*
   2280   1.10       mrg 	 * note: we now re-use first_entry for a different task.  we remove
   2281   1.10       mrg 	 * a number of map entries from the map and save them in a linked
   2282   1.10       mrg 	 * list headed by "first_entry".  once we remove them from the map
   2283   1.10       mrg 	 * the caller should unlock the map and drop the references to the
   2284   1.10       mrg 	 * backing objects [c.f. uvm_unmap_detach].  the object is to
   2285  1.100       wiz 	 * separate unmapping from reference dropping.  why?
   2286   1.10       mrg 	 *   [1] the map has to be locked for unmapping
   2287   1.10       mrg 	 *   [2] the map need not be locked for reference dropping
   2288   1.10       mrg 	 *   [3] dropping references may trigger pager I/O, and if we hit
   2289   1.10       mrg 	 *       a pager that does synchronous I/O we may have to wait for it.
   2290   1.10       mrg 	 *   [4] we would like all waiting for I/O to occur with maps unlocked
   2291   1.98       chs 	 *       so that we don't block other threads.
   2292   1.10       mrg 	 */
   2293   1.99       chs 
   2294   1.10       mrg 	first_entry = NULL;
   2295  1.106       chs 	*entry_list = NULL;
   2296   1.10       mrg 
   2297   1.10       mrg 	/*
   2298   1.98       chs 	 * break up the area into map entry sized regions and unmap.  note
   2299   1.10       mrg 	 * that all mappings have to be removed before we can even consider
   2300   1.10       mrg 	 * dropping references to amaps or VM objects (otherwise we could end
   2301   1.10       mrg 	 * up with a mapping to a page on the free list which would be very bad)
   2302   1.10       mrg 	 */
   2303   1.10       mrg 
   2304   1.10       mrg 	while ((entry != &map->header) && (entry->start < end)) {
   2305  1.174      yamt 		KASSERT((entry->flags & UVM_MAP_FIRST) == 0);
   2306  1.174      yamt 
   2307  1.174      yamt 		UVM_MAP_CLIP_END(map, entry, end, umr);
   2308   1.10       mrg 		next = entry->next;
   2309   1.10       mrg 		len = entry->end - entry->start;
   2310   1.81   thorpej 
   2311   1.10       mrg 		/*
   2312   1.10       mrg 		 * unwire before removing addresses from the pmap; otherwise
   2313   1.10       mrg 		 * unwiring will put the entries back into the pmap (XXX).
   2314   1.10       mrg 		 */
   2315    1.1       mrg 
   2316  1.106       chs 		if (VM_MAPENT_ISWIRED(entry)) {
   2317   1.10       mrg 			uvm_map_entry_unwire(map, entry);
   2318  1.106       chs 		}
   2319  1.187      yamt 		if (flags & UVM_FLAG_VAONLY) {
   2320  1.187      yamt 
   2321  1.187      yamt 			/* nothing */
   2322  1.187      yamt 
   2323  1.187      yamt 		} else if ((map->flags & VM_MAP_PAGEABLE) == 0) {
   2324   1.10       mrg 
   2325  1.106       chs 			/*
   2326  1.106       chs 			 * if the map is non-pageable, any pages mapped there
   2327  1.106       chs 			 * must be wired and entered with pmap_kenter_pa(),
   2328  1.106       chs 			 * and we should free any such pages immediately.
   2329  1.106       chs 			 * this is mostly used for kmem_map and mb_map.
   2330  1.106       chs 			 */
   2331   1.99       chs 
   2332  1.174      yamt 			if ((entry->flags & UVM_MAP_KMAPENT) == 0) {
   2333  1.264        ad 				uvm_km_pgremove_intrsafe(map, entry->start,
   2334  1.174      yamt 				    entry->end);
   2335  1.174      yamt 				pmap_kremove(entry->start, len);
   2336  1.174      yamt 			}
   2337  1.106       chs 		} else if (UVM_ET_ISOBJ(entry) &&
   2338  1.106       chs 			   UVM_OBJ_IS_KERN_OBJECT(entry->object.uvm_obj)) {
   2339   1.85       chs 			KASSERT(vm_map_pmap(map) == pmap_kernel());
   2340    1.1       mrg 
   2341   1.10       mrg 			/*
   2342   1.10       mrg 			 * note: kernel object mappings are currently used in
   2343   1.10       mrg 			 * two ways:
   2344   1.10       mrg 			 *  [1] "normal" mappings of pages in the kernel object
   2345   1.10       mrg 			 *  [2] uvm_km_valloc'd allocations in which we
   2346   1.10       mrg 			 *      pmap_enter in some non-kernel-object page
   2347   1.10       mrg 			 *      (e.g. vmapbuf).
   2348   1.10       mrg 			 *
   2349   1.10       mrg 			 * for case [1], we need to remove the mapping from
   2350   1.10       mrg 			 * the pmap and then remove the page from the kernel
   2351   1.10       mrg 			 * object (because, once pages in a kernel object are
   2352   1.10       mrg 			 * unmapped they are no longer needed, unlike, say,
   2353   1.10       mrg 			 * a vnode where you might want the data to persist
   2354   1.10       mrg 			 * until flushed out of a queue).
   2355   1.10       mrg 			 *
   2356   1.10       mrg 			 * for case [2], we need to remove the mapping from
   2357   1.10       mrg 			 * the pmap.  there shouldn't be any pages at the
   2358   1.10       mrg 			 * specified offset in the kernel object [but it
   2359   1.10       mrg 			 * doesn't hurt to call uvm_km_pgremove just to be
   2360   1.10       mrg 			 * safe?]
   2361   1.10       mrg 			 *
   2362   1.98       chs 			 * uvm_km_pgremove currently does the following:
   2363   1.98       chs 			 *   for pages in the kernel object in range:
   2364   1.43   thorpej 			 *     - drops the swap slot
   2365   1.10       mrg 			 *     - uvm_pagefree the page
   2366   1.10       mrg 			 */
   2367   1.10       mrg 
   2368   1.10       mrg 			/*
   2369   1.43   thorpej 			 * remove mappings from pmap and drop the pages
   2370   1.43   thorpej 			 * from the object.  offsets are always relative
   2371   1.43   thorpej 			 * to vm_map_min(kernel_map).
   2372   1.10       mrg 			 */
   2373   1.99       chs 
   2374  1.106       chs 			pmap_remove(pmap_kernel(), entry->start,
   2375  1.106       chs 			    entry->start + len);
   2376  1.187      yamt 			uvm_km_pgremove(entry->start, entry->end);
   2377   1.10       mrg 
   2378   1.10       mrg 			/*
   2379   1.10       mrg 			 * null out kernel_object reference, we've just
   2380   1.10       mrg 			 * dropped it
   2381   1.10       mrg 			 */
   2382   1.99       chs 
   2383   1.10       mrg 			entry->etype &= ~UVM_ET_OBJ;
   2384  1.106       chs 			entry->object.uvm_obj = NULL;
   2385  1.106       chs 		} else if (UVM_ET_ISOBJ(entry) || entry->aref.ar_amap) {
   2386   1.99       chs 
   2387   1.29     chuck 			/*
   2388  1.139     enami 			 * remove mappings the standard way.
   2389  1.139     enami 			 */
   2390   1.99       chs 
   2391   1.29     chuck 			pmap_remove(map->pmap, entry->start, entry->end);
   2392   1.10       mrg 		}
   2393   1.10       mrg 
   2394  1.177      yamt #if defined(DEBUG)
   2395  1.177      yamt 		if ((entry->flags & UVM_MAP_KMAPENT) == 0) {
   2396  1.177      yamt 
   2397  1.177      yamt 			/*
   2398  1.177      yamt 			 * check if there's remaining mapping,
   2399  1.177      yamt 			 * which is a bug in caller.
   2400  1.177      yamt 			 */
   2401  1.177      yamt 
   2402  1.177      yamt 			vaddr_t va;
   2403  1.177      yamt 			for (va = entry->start; va < entry->end;
   2404  1.177      yamt 			    va += PAGE_SIZE) {
   2405  1.177      yamt 				if (pmap_extract(vm_map_pmap(map), va, NULL)) {
   2406  1.177      yamt 					panic("uvm_unmap_remove: has mapping");
   2407  1.177      yamt 				}
   2408  1.177      yamt 			}
   2409  1.187      yamt 
   2410  1.187      yamt 			if (VM_MAP_IS_KERNEL(map)) {
   2411  1.264        ad 				uvm_km_check_empty(map, entry->start,
   2412  1.264        ad 				    entry->end);
   2413  1.187      yamt 			}
   2414  1.177      yamt 		}
   2415  1.177      yamt #endif /* defined(DEBUG) */
   2416  1.177      yamt 
   2417   1.10       mrg 		/*
   2418   1.98       chs 		 * remove entry from map and put it on our list of entries
   2419  1.106       chs 		 * that we've nuked.  then go to next entry.
   2420   1.10       mrg 		 */
   2421   1.99       chs 
   2422   1.10       mrg 		UVMHIST_LOG(maphist, "  removed map entry 0x%x", entry, 0, 0,0);
   2423   1.82   thorpej 
   2424   1.82   thorpej 		/* critical!  prevents stale hint */
   2425   1.82   thorpej 		SAVE_HINT(map, entry, entry->prev);
   2426   1.82   thorpej 
   2427   1.10       mrg 		uvm_map_entry_unlink(map, entry);
   2428  1.146      yamt 		KASSERT(map->size >= len);
   2429   1.10       mrg 		map->size -= len;
   2430  1.131    atatat 		entry->prev = NULL;
   2431   1.10       mrg 		entry->next = first_entry;
   2432   1.10       mrg 		first_entry = entry;
   2433  1.106       chs 		entry = next;
   2434   1.10       mrg 	}
   2435  1.120       chs 	if ((map->flags & VM_MAP_DYING) == 0) {
   2436  1.120       chs 		pmap_update(vm_map_pmap(map));
   2437  1.120       chs 	}
   2438   1.10       mrg 
   2439  1.222      yamt 	uvm_map_check(map, "unmap_remove leave");
   2440  1.144      yamt 
   2441   1.10       mrg 	/*
   2442   1.10       mrg 	 * now we've cleaned up the map and are ready for the caller to drop
   2443   1.98       chs 	 * references to the mapped objects.
   2444   1.10       mrg 	 */
   2445   1.10       mrg 
   2446   1.10       mrg 	*entry_list = first_entry;
   2447   1.10       mrg 	UVMHIST_LOG(maphist,"<- done!", 0, 0, 0, 0);
   2448  1.180      yamt 
   2449  1.180      yamt 	if (map->flags & VM_MAP_WANTVA) {
   2450  1.238        ad 		mutex_enter(&map->misc_lock);
   2451  1.180      yamt 		map->flags &= ~VM_MAP_WANTVA;
   2452  1.238        ad 		cv_broadcast(&map->cv);
   2453  1.238        ad 		mutex_exit(&map->misc_lock);
   2454  1.180      yamt 	}
   2455    1.1       mrg }
   2456    1.1       mrg 
   2457    1.1       mrg /*
   2458    1.1       mrg  * uvm_unmap_detach: drop references in a chain of map entries
   2459    1.1       mrg  *
   2460    1.1       mrg  * => we will free the map entries as we traverse the list.
   2461    1.1       mrg  */
   2462    1.1       mrg 
   2463   1.10       mrg void
   2464  1.138     enami uvm_unmap_detach(struct vm_map_entry *first_entry, int flags)
   2465    1.1       mrg {
   2466   1.99       chs 	struct vm_map_entry *next_entry;
   2467   1.10       mrg 	UVMHIST_FUNC("uvm_unmap_detach"); UVMHIST_CALLED(maphist);
   2468    1.1       mrg 
   2469   1.10       mrg 	while (first_entry) {
   2470   1.85       chs 		KASSERT(!VM_MAPENT_ISWIRED(first_entry));
   2471   1.10       mrg 		UVMHIST_LOG(maphist,
   2472   1.98       chs 		    "  detach 0x%x: amap=0x%x, obj=0x%x, submap?=%d",
   2473   1.98       chs 		    first_entry, first_entry->aref.ar_amap,
   2474   1.29     chuck 		    first_entry->object.uvm_obj,
   2475   1.29     chuck 		    UVM_ET_ISSUBMAP(first_entry));
   2476    1.1       mrg 
   2477   1.10       mrg 		/*
   2478   1.10       mrg 		 * drop reference to amap, if we've got one
   2479   1.10       mrg 		 */
   2480   1.10       mrg 
   2481   1.10       mrg 		if (first_entry->aref.ar_amap)
   2482   1.85       chs 			uvm_map_unreference_amap(first_entry, flags);
   2483   1.10       mrg 
   2484   1.10       mrg 		/*
   2485   1.10       mrg 		 * drop reference to our backing object, if we've got one
   2486   1.10       mrg 		 */
   2487   1.85       chs 
   2488  1.120       chs 		KASSERT(!UVM_ET_ISSUBMAP(first_entry));
   2489  1.120       chs 		if (UVM_ET_ISOBJ(first_entry) &&
   2490  1.120       chs 		    first_entry->object.uvm_obj->pgops->pgo_detach) {
   2491  1.120       chs 			(*first_entry->object.uvm_obj->pgops->pgo_detach)
   2492  1.120       chs 				(first_entry->object.uvm_obj);
   2493   1.10       mrg 		}
   2494   1.10       mrg 		next_entry = first_entry->next;
   2495   1.10       mrg 		uvm_mapent_free(first_entry);
   2496   1.10       mrg 		first_entry = next_entry;
   2497   1.10       mrg 	}
   2498   1.10       mrg 	UVMHIST_LOG(maphist, "<- done", 0,0,0,0);
   2499    1.1       mrg }
   2500    1.1       mrg 
   2501    1.1       mrg /*
   2502    1.1       mrg  *   E X T R A C T I O N   F U N C T I O N S
   2503    1.1       mrg  */
   2504    1.1       mrg 
   2505   1.98       chs /*
   2506    1.1       mrg  * uvm_map_reserve: reserve space in a vm_map for future use.
   2507    1.1       mrg  *
   2508   1.98       chs  * => we reserve space in a map by putting a dummy map entry in the
   2509    1.1       mrg  *    map (dummy means obj=NULL, amap=NULL, prot=VM_PROT_NONE)
   2510    1.1       mrg  * => map should be unlocked (we will write lock it)
   2511    1.1       mrg  * => we return true if we were able to reserve space
   2512    1.1       mrg  * => XXXCDC: should be inline?
   2513    1.1       mrg  */
   2514    1.1       mrg 
   2515   1.10       mrg int
   2516  1.138     enami uvm_map_reserve(struct vm_map *map, vsize_t size,
   2517  1.138     enami     vaddr_t offset	/* hint for pmap_prefer */,
   2518  1.243      yamt     vsize_t align	/* alignment */,
   2519  1.210      yamt     vaddr_t *raddr	/* IN:hint, OUT: reserved VA */,
   2520  1.210      yamt     uvm_flag_t flags	/* UVM_FLAG_FIXED or 0 */)
   2521    1.1       mrg {
   2522   1.98       chs 	UVMHIST_FUNC("uvm_map_reserve"); UVMHIST_CALLED(maphist);
   2523   1.85       chs 
   2524   1.10       mrg 	UVMHIST_LOG(maphist, "(map=0x%x, size=0x%x, offset=0x%x,addr=0x%x)",
   2525  1.139     enami 	    map,size,offset,raddr);
   2526   1.85       chs 
   2527   1.10       mrg 	size = round_page(size);
   2528   1.85       chs 
   2529   1.10       mrg 	/*
   2530   1.10       mrg 	 * reserve some virtual space.
   2531   1.10       mrg 	 */
   2532   1.85       chs 
   2533  1.243      yamt 	if (uvm_map(map, raddr, size, NULL, offset, align,
   2534   1.10       mrg 	    UVM_MAPFLAG(UVM_PROT_NONE, UVM_PROT_NONE, UVM_INH_NONE,
   2535  1.210      yamt 	    UVM_ADV_RANDOM, UVM_FLAG_NOMERGE|flags)) != 0) {
   2536   1.10       mrg 	    UVMHIST_LOG(maphist, "<- done (no VM)", 0,0,0,0);
   2537  1.234   thorpej 		return (false);
   2538   1.98       chs 	}
   2539   1.85       chs 
   2540   1.10       mrg 	UVMHIST_LOG(maphist, "<- done (*raddr=0x%x)", *raddr,0,0,0);
   2541  1.234   thorpej 	return (true);
   2542    1.1       mrg }
   2543    1.1       mrg 
   2544    1.1       mrg /*
   2545   1.98       chs  * uvm_map_replace: replace a reserved (blank) area of memory with
   2546    1.1       mrg  * real mappings.
   2547    1.1       mrg  *
   2548   1.98       chs  * => caller must WRITE-LOCK the map
   2549  1.234   thorpej  * => we return true if replacement was a success
   2550    1.1       mrg  * => we expect the newents chain to have nnewents entrys on it and
   2551    1.1       mrg  *    we expect newents->prev to point to the last entry on the list
   2552    1.1       mrg  * => note newents is allowed to be NULL
   2553    1.1       mrg  */
   2554    1.1       mrg 
   2555   1.10       mrg int
   2556  1.138     enami uvm_map_replace(struct vm_map *map, vaddr_t start, vaddr_t end,
   2557  1.253      yamt     struct vm_map_entry *newents, int nnewents, struct vm_map_entry **oldentryp)
   2558   1.10       mrg {
   2559   1.99       chs 	struct vm_map_entry *oldent, *last;
   2560    1.1       mrg 
   2561  1.222      yamt 	uvm_map_check(map, "map_replace entry");
   2562  1.144      yamt 
   2563   1.10       mrg 	/*
   2564   1.10       mrg 	 * first find the blank map entry at the specified address
   2565   1.10       mrg 	 */
   2566   1.85       chs 
   2567   1.10       mrg 	if (!uvm_map_lookup_entry(map, start, &oldent)) {
   2568  1.234   thorpej 		return (false);
   2569   1.10       mrg 	}
   2570   1.85       chs 
   2571   1.10       mrg 	/*
   2572   1.10       mrg 	 * check to make sure we have a proper blank entry
   2573   1.10       mrg 	 */
   2574    1.1       mrg 
   2575  1.210      yamt 	if (end < oldent->end && !VM_MAP_USE_KMAPENT(map)) {
   2576  1.210      yamt 		UVM_MAP_CLIP_END(map, oldent, end, NULL);
   2577  1.210      yamt 	}
   2578   1.98       chs 	if (oldent->start != start || oldent->end != end ||
   2579   1.10       mrg 	    oldent->object.uvm_obj != NULL || oldent->aref.ar_amap != NULL) {
   2580  1.234   thorpej 		return (false);
   2581   1.10       mrg 	}
   2582    1.1       mrg 
   2583    1.1       mrg #ifdef DIAGNOSTIC
   2584   1.99       chs 
   2585   1.10       mrg 	/*
   2586   1.10       mrg 	 * sanity check the newents chain
   2587   1.10       mrg 	 */
   2588   1.99       chs 
   2589   1.10       mrg 	{
   2590   1.99       chs 		struct vm_map_entry *tmpent = newents;
   2591   1.10       mrg 		int nent = 0;
   2592   1.24       eeh 		vaddr_t cur = start;
   2593   1.10       mrg 
   2594   1.10       mrg 		while (tmpent) {
   2595   1.10       mrg 			nent++;
   2596   1.10       mrg 			if (tmpent->start < cur)
   2597   1.10       mrg 				panic("uvm_map_replace1");
   2598   1.10       mrg 			if (tmpent->start > tmpent->end || tmpent->end > end) {
   2599   1.10       mrg 		printf("tmpent->start=0x%lx, tmpent->end=0x%lx, end=0x%lx\n",
   2600   1.10       mrg 			    tmpent->start, tmpent->end, end);
   2601   1.10       mrg 				panic("uvm_map_replace2");
   2602   1.10       mrg 			}
   2603   1.10       mrg 			cur = tmpent->end;
   2604   1.10       mrg 			if (tmpent->next) {
   2605   1.10       mrg 				if (tmpent->next->prev != tmpent)
   2606   1.10       mrg 					panic("uvm_map_replace3");
   2607   1.10       mrg 			} else {
   2608   1.10       mrg 				if (newents->prev != tmpent)
   2609   1.10       mrg 					panic("uvm_map_replace4");
   2610   1.10       mrg 			}
   2611   1.10       mrg 			tmpent = tmpent->next;
   2612   1.10       mrg 		}
   2613   1.10       mrg 		if (nent != nnewents)
   2614   1.10       mrg 			panic("uvm_map_replace5");
   2615   1.10       mrg 	}
   2616   1.10       mrg #endif
   2617   1.10       mrg 
   2618   1.10       mrg 	/*
   2619   1.10       mrg 	 * map entry is a valid blank!   replace it.   (this does all the
   2620   1.10       mrg 	 * work of map entry link/unlink...).
   2621   1.10       mrg 	 */
   2622   1.10       mrg 
   2623   1.10       mrg 	if (newents) {
   2624   1.99       chs 		last = newents->prev;
   2625   1.10       mrg 
   2626   1.10       mrg 		/* critical: flush stale hints out of map */
   2627   1.82   thorpej 		SAVE_HINT(map, map->hint, newents);
   2628   1.10       mrg 		if (map->first_free == oldent)
   2629   1.10       mrg 			map->first_free = last;
   2630   1.10       mrg 
   2631   1.10       mrg 		last->next = oldent->next;
   2632   1.10       mrg 		last->next->prev = last;
   2633  1.144      yamt 
   2634  1.144      yamt 		/* Fix RB tree */
   2635  1.144      yamt 		uvm_rb_remove(map, oldent);
   2636  1.144      yamt 
   2637   1.10       mrg 		newents->prev = oldent->prev;
   2638   1.10       mrg 		newents->prev->next = newents;
   2639   1.10       mrg 		map->nentries = map->nentries + (nnewents - 1);
   2640   1.10       mrg 
   2641  1.144      yamt 		/* Fixup the RB tree */
   2642  1.144      yamt 		{
   2643  1.144      yamt 			int i;
   2644  1.144      yamt 			struct vm_map_entry *tmp;
   2645  1.144      yamt 
   2646  1.144      yamt 			tmp = newents;
   2647  1.144      yamt 			for (i = 0; i < nnewents && tmp; i++) {
   2648  1.144      yamt 				uvm_rb_insert(map, tmp);
   2649  1.144      yamt 				tmp = tmp->next;
   2650  1.144      yamt 			}
   2651  1.144      yamt 		}
   2652   1.10       mrg 	} else {
   2653   1.10       mrg 		/* NULL list of new entries: just remove the old one */
   2654  1.221      yamt 		clear_hints(map, oldent);
   2655   1.10       mrg 		uvm_map_entry_unlink(map, oldent);
   2656   1.10       mrg 	}
   2657   1.10       mrg 
   2658  1.222      yamt 	uvm_map_check(map, "map_replace leave");
   2659   1.10       mrg 
   2660   1.10       mrg 	/*
   2661  1.209      yamt 	 * now we can free the old blank entry and return.
   2662   1.10       mrg 	 */
   2663    1.1       mrg 
   2664  1.253      yamt 	*oldentryp = oldent;
   2665  1.234   thorpej 	return (true);
   2666    1.1       mrg }
   2667    1.1       mrg 
   2668    1.1       mrg /*
   2669    1.1       mrg  * uvm_map_extract: extract a mapping from a map and put it somewhere
   2670    1.1       mrg  *	(maybe removing the old mapping)
   2671    1.1       mrg  *
   2672    1.1       mrg  * => maps should be unlocked (we will write lock them)
   2673    1.1       mrg  * => returns 0 on success, error code otherwise
   2674    1.1       mrg  * => start must be page aligned
   2675    1.1       mrg  * => len must be page sized
   2676    1.1       mrg  * => flags:
   2677    1.1       mrg  *      UVM_EXTRACT_REMOVE: remove mappings from srcmap
   2678    1.1       mrg  *      UVM_EXTRACT_CONTIG: abort if unmapped area (advisory only)
   2679    1.1       mrg  *      UVM_EXTRACT_QREF: for a temporary extraction do quick obj refs
   2680    1.1       mrg  *      UVM_EXTRACT_FIXPROT: set prot to maxprot as we go
   2681    1.1       mrg  *    >>>NOTE: if you set REMOVE, you are not allowed to use CONTIG or QREF!<<<
   2682    1.1       mrg  *    >>>NOTE: QREF's must be unmapped via the QREF path, thus should only
   2683    1.1       mrg  *             be used from within the kernel in a kernel level map <<<
   2684    1.1       mrg  */
   2685    1.1       mrg 
   2686   1.10       mrg int
   2687  1.138     enami uvm_map_extract(struct vm_map *srcmap, vaddr_t start, vsize_t len,
   2688  1.138     enami     struct vm_map *dstmap, vaddr_t *dstaddrp, int flags)
   2689   1.10       mrg {
   2690  1.163   mycroft 	vaddr_t dstaddr, end, newend, oldoffset, fudge, orig_fudge;
   2691   1.99       chs 	struct vm_map_entry *chain, *endchain, *entry, *orig_entry, *newentry,
   2692   1.99       chs 	    *deadentry, *oldentry;
   2693  1.253      yamt 	struct vm_map_entry *resentry = NULL; /* a dummy reservation entry */
   2694   1.24       eeh 	vsize_t elen;
   2695   1.10       mrg 	int nchain, error, copy_ok;
   2696   1.10       mrg 	UVMHIST_FUNC("uvm_map_extract"); UVMHIST_CALLED(maphist);
   2697   1.85       chs 
   2698   1.10       mrg 	UVMHIST_LOG(maphist,"(srcmap=0x%x,start=0x%x, len=0x%x", srcmap, start,
   2699   1.10       mrg 	    len,0);
   2700   1.10       mrg 	UVMHIST_LOG(maphist," ...,dstmap=0x%x, flags=0x%x)", dstmap,flags,0,0);
   2701   1.10       mrg 
   2702  1.222      yamt 	uvm_map_check(srcmap, "map_extract src enter");
   2703  1.222      yamt 	uvm_map_check(dstmap, "map_extract dst enter");
   2704  1.144      yamt 
   2705   1.10       mrg 	/*
   2706   1.10       mrg 	 * step 0: sanity check: start must be on a page boundary, length
   2707   1.10       mrg 	 * must be page sized.  can't ask for CONTIG/QREF if you asked for
   2708   1.10       mrg 	 * REMOVE.
   2709   1.10       mrg 	 */
   2710   1.10       mrg 
   2711   1.85       chs 	KASSERT((start & PAGE_MASK) == 0 && (len & PAGE_MASK) == 0);
   2712   1.85       chs 	KASSERT((flags & UVM_EXTRACT_REMOVE) == 0 ||
   2713   1.85       chs 		(flags & (UVM_EXTRACT_CONTIG|UVM_EXTRACT_QREF)) == 0);
   2714   1.10       mrg 
   2715   1.10       mrg 	/*
   2716   1.10       mrg 	 * step 1: reserve space in the target map for the extracted area
   2717   1.10       mrg 	 */
   2718   1.10       mrg 
   2719  1.210      yamt 	if ((flags & UVM_EXTRACT_RESERVED) == 0) {
   2720  1.210      yamt 		dstaddr = vm_map_min(dstmap);
   2721  1.210      yamt 		if (!uvm_map_reserve(dstmap, len, start, 0, &dstaddr, 0))
   2722  1.210      yamt 			return (ENOMEM);
   2723  1.210      yamt 		*dstaddrp = dstaddr;	/* pass address back to caller */
   2724  1.210      yamt 		UVMHIST_LOG(maphist, "  dstaddr=0x%x", dstaddr,0,0,0);
   2725  1.210      yamt 	} else {
   2726  1.210      yamt 		dstaddr = *dstaddrp;
   2727  1.210      yamt 	}
   2728   1.10       mrg 
   2729   1.10       mrg 	/*
   2730   1.98       chs 	 * step 2: setup for the extraction process loop by init'ing the
   2731   1.10       mrg 	 * map entry chain, locking src map, and looking up the first useful
   2732   1.10       mrg 	 * entry in the map.
   2733   1.10       mrg 	 */
   2734    1.1       mrg 
   2735   1.10       mrg 	end = start + len;
   2736   1.10       mrg 	newend = dstaddr + len;
   2737   1.10       mrg 	chain = endchain = NULL;
   2738   1.10       mrg 	nchain = 0;
   2739   1.10       mrg 	vm_map_lock(srcmap);
   2740   1.10       mrg 
   2741   1.10       mrg 	if (uvm_map_lookup_entry(srcmap, start, &entry)) {
   2742   1.10       mrg 
   2743   1.10       mrg 		/* "start" is within an entry */
   2744   1.10       mrg 		if (flags & UVM_EXTRACT_QREF) {
   2745   1.85       chs 
   2746   1.10       mrg 			/*
   2747   1.10       mrg 			 * for quick references we don't clip the entry, so
   2748   1.10       mrg 			 * the entry may map space "before" the starting
   2749   1.10       mrg 			 * virtual address... this is the "fudge" factor
   2750   1.10       mrg 			 * (which can be non-zero only the first time
   2751   1.10       mrg 			 * through the "while" loop in step 3).
   2752   1.10       mrg 			 */
   2753   1.85       chs 
   2754   1.10       mrg 			fudge = start - entry->start;
   2755   1.10       mrg 		} else {
   2756   1.85       chs 
   2757   1.10       mrg 			/*
   2758   1.10       mrg 			 * normal reference: we clip the map to fit (thus
   2759   1.10       mrg 			 * fudge is zero)
   2760   1.10       mrg 			 */
   2761   1.85       chs 
   2762  1.174      yamt 			UVM_MAP_CLIP_START(srcmap, entry, start, NULL);
   2763   1.82   thorpej 			SAVE_HINT(srcmap, srcmap->hint, entry->prev);
   2764   1.10       mrg 			fudge = 0;
   2765   1.10       mrg 		}
   2766   1.85       chs 	} else {
   2767    1.1       mrg 
   2768   1.10       mrg 		/* "start" is not within an entry ... skip to next entry */
   2769   1.10       mrg 		if (flags & UVM_EXTRACT_CONTIG) {
   2770   1.10       mrg 			error = EINVAL;
   2771   1.10       mrg 			goto bad;    /* definite hole here ... */
   2772   1.10       mrg 		}
   2773    1.1       mrg 
   2774   1.10       mrg 		entry = entry->next;
   2775   1.10       mrg 		fudge = 0;
   2776   1.10       mrg 	}
   2777   1.85       chs 
   2778   1.10       mrg 	/* save values from srcmap for step 6 */
   2779   1.10       mrg 	orig_entry = entry;
   2780   1.10       mrg 	orig_fudge = fudge;
   2781    1.1       mrg 
   2782   1.10       mrg 	/*
   2783   1.10       mrg 	 * step 3: now start looping through the map entries, extracting
   2784   1.10       mrg 	 * as we go.
   2785   1.10       mrg 	 */
   2786    1.1       mrg 
   2787   1.10       mrg 	while (entry->start < end && entry != &srcmap->header) {
   2788   1.85       chs 
   2789   1.10       mrg 		/* if we are not doing a quick reference, clip it */
   2790   1.10       mrg 		if ((flags & UVM_EXTRACT_QREF) == 0)
   2791  1.174      yamt 			UVM_MAP_CLIP_END(srcmap, entry, end, NULL);
   2792   1.10       mrg 
   2793   1.10       mrg 		/* clear needs_copy (allow chunking) */
   2794   1.10       mrg 		if (UVM_ET_ISNEEDSCOPY(entry)) {
   2795  1.212      yamt 			amap_copy(srcmap, entry,
   2796  1.212      yamt 			    AMAP_COPY_NOWAIT|AMAP_COPY_NOMERGE, start, end);
   2797   1.10       mrg 			if (UVM_ET_ISNEEDSCOPY(entry)) {  /* failed? */
   2798   1.10       mrg 				error = ENOMEM;
   2799   1.10       mrg 				goto bad;
   2800   1.10       mrg 			}
   2801   1.85       chs 
   2802   1.10       mrg 			/* amap_copy could clip (during chunk)!  update fudge */
   2803   1.10       mrg 			if (fudge) {
   2804  1.163   mycroft 				fudge = start - entry->start;
   2805   1.10       mrg 				orig_fudge = fudge;
   2806   1.10       mrg 			}
   2807   1.10       mrg 		}
   2808    1.1       mrg 
   2809   1.10       mrg 		/* calculate the offset of this from "start" */
   2810   1.10       mrg 		oldoffset = (entry->start + fudge) - start;
   2811    1.1       mrg 
   2812   1.10       mrg 		/* allocate a new map entry */
   2813  1.126    bouyer 		newentry = uvm_mapent_alloc(dstmap, 0);
   2814   1.10       mrg 		if (newentry == NULL) {
   2815   1.10       mrg 			error = ENOMEM;
   2816   1.10       mrg 			goto bad;
   2817   1.10       mrg 		}
   2818   1.10       mrg 
   2819   1.10       mrg 		/* set up new map entry */
   2820   1.10       mrg 		newentry->next = NULL;
   2821   1.10       mrg 		newentry->prev = endchain;
   2822   1.10       mrg 		newentry->start = dstaddr + oldoffset;
   2823   1.10       mrg 		newentry->end =
   2824   1.10       mrg 		    newentry->start + (entry->end - (entry->start + fudge));
   2825   1.37       chs 		if (newentry->end > newend || newentry->end < newentry->start)
   2826   1.10       mrg 			newentry->end = newend;
   2827   1.10       mrg 		newentry->object.uvm_obj = entry->object.uvm_obj;
   2828   1.10       mrg 		if (newentry->object.uvm_obj) {
   2829   1.10       mrg 			if (newentry->object.uvm_obj->pgops->pgo_reference)
   2830   1.10       mrg 				newentry->object.uvm_obj->pgops->
   2831   1.10       mrg 				    pgo_reference(newentry->object.uvm_obj);
   2832   1.10       mrg 				newentry->offset = entry->offset + fudge;
   2833   1.10       mrg 		} else {
   2834   1.10       mrg 			newentry->offset = 0;
   2835   1.10       mrg 		}
   2836   1.10       mrg 		newentry->etype = entry->etype;
   2837   1.98       chs 		newentry->protection = (flags & UVM_EXTRACT_FIXPROT) ?
   2838   1.98       chs 			entry->max_protection : entry->protection;
   2839   1.10       mrg 		newentry->max_protection = entry->max_protection;
   2840   1.10       mrg 		newentry->inheritance = entry->inheritance;
   2841   1.10       mrg 		newentry->wired_count = 0;
   2842   1.10       mrg 		newentry->aref.ar_amap = entry->aref.ar_amap;
   2843   1.10       mrg 		if (newentry->aref.ar_amap) {
   2844   1.34     chuck 			newentry->aref.ar_pageoff =
   2845   1.34     chuck 			    entry->aref.ar_pageoff + (fudge >> PAGE_SHIFT);
   2846   1.85       chs 			uvm_map_reference_amap(newentry, AMAP_SHARED |
   2847   1.10       mrg 			    ((flags & UVM_EXTRACT_QREF) ? AMAP_REFALL : 0));
   2848   1.10       mrg 		} else {
   2849   1.34     chuck 			newentry->aref.ar_pageoff = 0;
   2850   1.10       mrg 		}
   2851   1.10       mrg 		newentry->advice = entry->advice;
   2852  1.245      yamt 		if ((flags & UVM_EXTRACT_QREF) != 0) {
   2853  1.245      yamt 			newentry->flags |= UVM_MAP_NOMERGE;
   2854  1.245      yamt 		}
   2855   1.10       mrg 
   2856   1.10       mrg 		/* now link it on the chain */
   2857   1.10       mrg 		nchain++;
   2858   1.10       mrg 		if (endchain == NULL) {
   2859   1.10       mrg 			chain = endchain = newentry;
   2860   1.10       mrg 		} else {
   2861   1.10       mrg 			endchain->next = newentry;
   2862   1.10       mrg 			endchain = newentry;
   2863   1.10       mrg 		}
   2864   1.10       mrg 
   2865   1.10       mrg 		/* end of 'while' loop! */
   2866   1.98       chs 		if ((flags & UVM_EXTRACT_CONTIG) && entry->end < end &&
   2867   1.10       mrg 		    (entry->next == &srcmap->header ||
   2868   1.10       mrg 		    entry->next->start != entry->end)) {
   2869   1.10       mrg 			error = EINVAL;
   2870   1.10       mrg 			goto bad;
   2871   1.10       mrg 		}
   2872   1.10       mrg 		entry = entry->next;
   2873   1.10       mrg 		fudge = 0;
   2874   1.10       mrg 	}
   2875   1.10       mrg 
   2876   1.10       mrg 	/*
   2877   1.10       mrg 	 * step 4: close off chain (in format expected by uvm_map_replace)
   2878   1.10       mrg 	 */
   2879   1.10       mrg 
   2880   1.10       mrg 	if (chain)
   2881   1.10       mrg 		chain->prev = endchain;
   2882   1.10       mrg 
   2883   1.10       mrg 	/*
   2884   1.10       mrg 	 * step 5: attempt to lock the dest map so we can pmap_copy.
   2885   1.98       chs 	 * note usage of copy_ok:
   2886   1.10       mrg 	 *   1 => dstmap locked, pmap_copy ok, and we "replace" here (step 5)
   2887   1.10       mrg 	 *   0 => dstmap unlocked, NO pmap_copy, and we will "replace" in step 7
   2888   1.10       mrg 	 */
   2889   1.85       chs 
   2890  1.234   thorpej 	if (srcmap == dstmap || vm_map_lock_try(dstmap) == true) {
   2891   1.10       mrg 		copy_ok = 1;
   2892   1.10       mrg 		if (!uvm_map_replace(dstmap, dstaddr, dstaddr+len, chain,
   2893  1.253      yamt 		    nchain, &resentry)) {
   2894   1.10       mrg 			if (srcmap != dstmap)
   2895   1.10       mrg 				vm_map_unlock(dstmap);
   2896   1.10       mrg 			error = EIO;
   2897   1.10       mrg 			goto bad;
   2898   1.10       mrg 		}
   2899   1.10       mrg 	} else {
   2900   1.10       mrg 		copy_ok = 0;
   2901   1.10       mrg 		/* replace defered until step 7 */
   2902   1.10       mrg 	}
   2903   1.10       mrg 
   2904   1.10       mrg 	/*
   2905   1.10       mrg 	 * step 6: traverse the srcmap a second time to do the following:
   2906   1.10       mrg 	 *  - if we got a lock on the dstmap do pmap_copy
   2907   1.10       mrg 	 *  - if UVM_EXTRACT_REMOVE remove the entries
   2908   1.10       mrg 	 * we make use of orig_entry and orig_fudge (saved in step 2)
   2909   1.10       mrg 	 */
   2910   1.10       mrg 
   2911   1.10       mrg 	if (copy_ok || (flags & UVM_EXTRACT_REMOVE)) {
   2912   1.10       mrg 
   2913   1.10       mrg 		/* purge possible stale hints from srcmap */
   2914   1.10       mrg 		if (flags & UVM_EXTRACT_REMOVE) {
   2915   1.82   thorpej 			SAVE_HINT(srcmap, srcmap->hint, orig_entry->prev);
   2916  1.220      yamt 			if (srcmap->first_free != &srcmap->header &&
   2917  1.220      yamt 			    srcmap->first_free->start >= start)
   2918   1.10       mrg 				srcmap->first_free = orig_entry->prev;
   2919   1.10       mrg 		}
   2920   1.10       mrg 
   2921   1.10       mrg 		entry = orig_entry;
   2922   1.10       mrg 		fudge = orig_fudge;
   2923   1.10       mrg 		deadentry = NULL;	/* for UVM_EXTRACT_REMOVE */
   2924   1.10       mrg 
   2925   1.10       mrg 		while (entry->start < end && entry != &srcmap->header) {
   2926   1.10       mrg 			if (copy_ok) {
   2927   1.74   thorpej 				oldoffset = (entry->start + fudge) - start;
   2928   1.90       chs 				elen = MIN(end, entry->end) -
   2929   1.74   thorpej 				    (entry->start + fudge);
   2930   1.74   thorpej 				pmap_copy(dstmap->pmap, srcmap->pmap,
   2931   1.74   thorpej 				    dstaddr + oldoffset, elen,
   2932   1.74   thorpej 				    entry->start + fudge);
   2933   1.10       mrg 			}
   2934   1.10       mrg 
   2935   1.74   thorpej 			/* we advance "entry" in the following if statement */
   2936   1.10       mrg 			if (flags & UVM_EXTRACT_REMOVE) {
   2937   1.98       chs 				pmap_remove(srcmap->pmap, entry->start,
   2938   1.20     chuck 						entry->end);
   2939  1.139     enami 				oldentry = entry;	/* save entry */
   2940  1.139     enami 				entry = entry->next;	/* advance */
   2941   1.20     chuck 				uvm_map_entry_unlink(srcmap, oldentry);
   2942   1.20     chuck 							/* add to dead list */
   2943   1.20     chuck 				oldentry->next = deadentry;
   2944   1.20     chuck 				deadentry = oldentry;
   2945  1.139     enami 			} else {
   2946  1.139     enami 				entry = entry->next;		/* advance */
   2947   1.10       mrg 			}
   2948   1.10       mrg 
   2949   1.10       mrg 			/* end of 'while' loop */
   2950   1.10       mrg 			fudge = 0;
   2951   1.10       mrg 		}
   2952  1.105     chris 		pmap_update(srcmap->pmap);
   2953   1.10       mrg 
   2954   1.10       mrg 		/*
   2955   1.10       mrg 		 * unlock dstmap.  we will dispose of deadentry in
   2956   1.10       mrg 		 * step 7 if needed
   2957   1.10       mrg 		 */
   2958   1.85       chs 
   2959   1.10       mrg 		if (copy_ok && srcmap != dstmap)
   2960   1.10       mrg 			vm_map_unlock(dstmap);
   2961   1.10       mrg 
   2962   1.99       chs 	} else {
   2963   1.99       chs 		deadentry = NULL;
   2964   1.10       mrg 	}
   2965   1.10       mrg 
   2966   1.10       mrg 	/*
   2967   1.10       mrg 	 * step 7: we are done with the source map, unlock.   if copy_ok
   2968   1.10       mrg 	 * is 0 then we have not replaced the dummy mapping in dstmap yet
   2969   1.10       mrg 	 * and we need to do so now.
   2970   1.10       mrg 	 */
   2971   1.10       mrg 
   2972   1.10       mrg 	vm_map_unlock(srcmap);
   2973   1.10       mrg 	if ((flags & UVM_EXTRACT_REMOVE) && deadentry)
   2974   1.10       mrg 		uvm_unmap_detach(deadentry, 0);   /* dispose of old entries */
   2975   1.10       mrg 
   2976   1.10       mrg 	/* now do the replacement if we didn't do it in step 5 */
   2977   1.10       mrg 	if (copy_ok == 0) {
   2978   1.10       mrg 		vm_map_lock(dstmap);
   2979   1.10       mrg 		error = uvm_map_replace(dstmap, dstaddr, dstaddr+len, chain,
   2980  1.253      yamt 		    nchain, &resentry);
   2981   1.10       mrg 		vm_map_unlock(dstmap);
   2982   1.10       mrg 
   2983  1.234   thorpej 		if (error == false) {
   2984   1.10       mrg 			error = EIO;
   2985   1.10       mrg 			goto bad2;
   2986   1.10       mrg 		}
   2987   1.10       mrg 	}
   2988  1.144      yamt 
   2989  1.253      yamt 	if (resentry != NULL)
   2990  1.253      yamt 		uvm_mapent_free(resentry);
   2991  1.253      yamt 
   2992  1.222      yamt 	uvm_map_check(srcmap, "map_extract src leave");
   2993  1.222      yamt 	uvm_map_check(dstmap, "map_extract dst leave");
   2994  1.144      yamt 
   2995  1.139     enami 	return (0);
   2996   1.10       mrg 
   2997   1.10       mrg 	/*
   2998   1.10       mrg 	 * bad: failure recovery
   2999   1.10       mrg 	 */
   3000   1.10       mrg bad:
   3001   1.10       mrg 	vm_map_unlock(srcmap);
   3002   1.10       mrg bad2:			/* src already unlocked */
   3003   1.10       mrg 	if (chain)
   3004   1.10       mrg 		uvm_unmap_detach(chain,
   3005   1.10       mrg 		    (flags & UVM_EXTRACT_QREF) ? AMAP_REFALL : 0);
   3006  1.144      yamt 
   3007  1.253      yamt 	if (resentry != NULL)
   3008  1.253      yamt 		uvm_mapent_free(resentry);
   3009  1.253      yamt 
   3010  1.222      yamt 	uvm_map_check(srcmap, "map_extract src err leave");
   3011  1.222      yamt 	uvm_map_check(dstmap, "map_extract dst err leave");
   3012  1.144      yamt 
   3013  1.210      yamt 	if ((flags & UVM_EXTRACT_RESERVED) == 0) {
   3014  1.210      yamt 		uvm_unmap(dstmap, dstaddr, dstaddr+len);   /* ??? */
   3015  1.210      yamt 	}
   3016  1.139     enami 	return (error);
   3017   1.10       mrg }
   3018   1.10       mrg 
   3019   1.10       mrg /* end of extraction functions */
   3020    1.1       mrg 
   3021    1.1       mrg /*
   3022    1.1       mrg  * uvm_map_submap: punch down part of a map into a submap
   3023    1.1       mrg  *
   3024    1.1       mrg  * => only the kernel_map is allowed to be submapped
   3025    1.1       mrg  * => the purpose of submapping is to break up the locking granularity
   3026    1.1       mrg  *	of a larger map
   3027    1.1       mrg  * => the range specified must have been mapped previously with a uvm_map()
   3028    1.1       mrg  *	call [with uobj==NULL] to create a blank map entry in the main map.
   3029    1.1       mrg  *	[And it had better still be blank!]
   3030    1.1       mrg  * => maps which contain submaps should never be copied or forked.
   3031   1.98       chs  * => to remove a submap, use uvm_unmap() on the main map
   3032    1.1       mrg  *	and then uvm_map_deallocate() the submap.
   3033    1.1       mrg  * => main map must be unlocked.
   3034    1.1       mrg  * => submap must have been init'd and have a zero reference count.
   3035    1.1       mrg  *	[need not be locked as we don't actually reference it]
   3036    1.1       mrg  */
   3037   1.85       chs 
   3038   1.10       mrg int
   3039  1.138     enami uvm_map_submap(struct vm_map *map, vaddr_t start, vaddr_t end,
   3040  1.138     enami     struct vm_map *submap)
   3041   1.10       mrg {
   3042   1.99       chs 	struct vm_map_entry *entry;
   3043  1.174      yamt 	struct uvm_mapent_reservation umr;
   3044   1.94       chs 	int error;
   3045    1.1       mrg 
   3046  1.174      yamt 	uvm_mapent_reserve(map, &umr, 2, 0);
   3047  1.174      yamt 
   3048   1.10       mrg 	vm_map_lock(map);
   3049   1.85       chs 	VM_MAP_RANGE_CHECK(map, start, end);
   3050    1.1       mrg 
   3051   1.10       mrg 	if (uvm_map_lookup_entry(map, start, &entry)) {
   3052  1.174      yamt 		UVM_MAP_CLIP_START(map, entry, start, &umr);
   3053  1.174      yamt 		UVM_MAP_CLIP_END(map, entry, end, &umr);	/* to be safe */
   3054   1.94       chs 	} else {
   3055   1.10       mrg 		entry = NULL;
   3056   1.10       mrg 	}
   3057    1.1       mrg 
   3058   1.98       chs 	if (entry != NULL &&
   3059   1.10       mrg 	    entry->start == start && entry->end == end &&
   3060   1.10       mrg 	    entry->object.uvm_obj == NULL && entry->aref.ar_amap == NULL &&
   3061   1.10       mrg 	    !UVM_ET_ISCOPYONWRITE(entry) && !UVM_ET_ISNEEDSCOPY(entry)) {
   3062   1.29     chuck 		entry->etype |= UVM_ET_SUBMAP;
   3063   1.10       mrg 		entry->object.sub_map = submap;
   3064   1.10       mrg 		entry->offset = 0;
   3065   1.10       mrg 		uvm_map_reference(submap);
   3066   1.94       chs 		error = 0;
   3067   1.10       mrg 	} else {
   3068   1.94       chs 		error = EINVAL;
   3069   1.10       mrg 	}
   3070   1.10       mrg 	vm_map_unlock(map);
   3071  1.174      yamt 
   3072  1.174      yamt 	uvm_mapent_unreserve(map, &umr);
   3073  1.174      yamt 
   3074   1.94       chs 	return error;
   3075    1.1       mrg }
   3076    1.1       mrg 
   3077  1.175      yamt /*
   3078  1.175      yamt  * uvm_map_setup_kernel: init in-kernel map
   3079  1.175      yamt  *
   3080  1.175      yamt  * => map must not be in service yet.
   3081  1.175      yamt  */
   3082  1.175      yamt 
   3083  1.175      yamt void
   3084  1.175      yamt uvm_map_setup_kernel(struct vm_map_kernel *map,
   3085  1.199  christos     vaddr_t vmin, vaddr_t vmax, int flags)
   3086  1.175      yamt {
   3087  1.175      yamt 
   3088  1.199  christos 	uvm_map_setup(&map->vmk_map, vmin, vmax, flags);
   3089  1.237        ad 	callback_head_init(&map->vmk_reclaim_callback, IPL_VM);
   3090  1.175      yamt 	LIST_INIT(&map->vmk_kentry_free);
   3091  1.175      yamt 	map->vmk_merged_entries = NULL;
   3092  1.175      yamt }
   3093  1.175      yamt 
   3094    1.1       mrg 
   3095    1.1       mrg /*
   3096    1.1       mrg  * uvm_map_protect: change map protection
   3097    1.1       mrg  *
   3098    1.1       mrg  * => set_max means set max_protection.
   3099    1.1       mrg  * => map must be unlocked.
   3100    1.1       mrg  */
   3101    1.1       mrg 
   3102  1.139     enami #define MASK(entry)	(UVM_ET_ISCOPYONWRITE(entry) ? \
   3103   1.36   mycroft 			 ~VM_PROT_WRITE : VM_PROT_ALL)
   3104    1.1       mrg 
   3105   1.10       mrg int
   3106  1.138     enami uvm_map_protect(struct vm_map *map, vaddr_t start, vaddr_t end,
   3107  1.233   thorpej     vm_prot_t new_prot, bool set_max)
   3108   1.10       mrg {
   3109   1.99       chs 	struct vm_map_entry *current, *entry;
   3110   1.94       chs 	int error = 0;
   3111   1.10       mrg 	UVMHIST_FUNC("uvm_map_protect"); UVMHIST_CALLED(maphist);
   3112   1.10       mrg 	UVMHIST_LOG(maphist,"(map=0x%x,start=0x%x,end=0x%x,new_prot=0x%x)",
   3113   1.85       chs 		    map, start, end, new_prot);
   3114   1.85       chs 
   3115   1.10       mrg 	vm_map_lock(map);
   3116   1.10       mrg 	VM_MAP_RANGE_CHECK(map, start, end);
   3117   1.10       mrg 	if (uvm_map_lookup_entry(map, start, &entry)) {
   3118  1.174      yamt 		UVM_MAP_CLIP_START(map, entry, start, NULL);
   3119   1.10       mrg 	} else {
   3120   1.10       mrg 		entry = entry->next;
   3121   1.10       mrg 	}
   3122   1.10       mrg 
   3123    1.1       mrg 	/*
   3124   1.10       mrg 	 * make a first pass to check for protection violations.
   3125    1.1       mrg 	 */
   3126    1.1       mrg 
   3127   1.10       mrg 	current = entry;
   3128   1.10       mrg 	while ((current != &map->header) && (current->start < end)) {
   3129   1.65   thorpej 		if (UVM_ET_ISSUBMAP(current)) {
   3130   1.94       chs 			error = EINVAL;
   3131   1.65   thorpej 			goto out;
   3132   1.65   thorpej 		}
   3133   1.10       mrg 		if ((new_prot & current->max_protection) != new_prot) {
   3134   1.94       chs 			error = EACCES;
   3135   1.65   thorpej 			goto out;
   3136  1.112   thorpej 		}
   3137  1.112   thorpej 		/*
   3138  1.112   thorpej 		 * Don't allow VM_PROT_EXECUTE to be set on entries that
   3139  1.112   thorpej 		 * point to vnodes that are associated with a NOEXEC file
   3140  1.112   thorpej 		 * system.
   3141  1.112   thorpej 		 */
   3142  1.112   thorpej 		if (UVM_ET_ISOBJ(current) &&
   3143  1.112   thorpej 		    UVM_OBJ_IS_VNODE(current->object.uvm_obj)) {
   3144  1.112   thorpej 			struct vnode *vp =
   3145  1.112   thorpej 			    (struct vnode *) current->object.uvm_obj;
   3146  1.112   thorpej 
   3147  1.112   thorpej 			if ((new_prot & VM_PROT_EXECUTE) != 0 &&
   3148  1.112   thorpej 			    (vp->v_mount->mnt_flag & MNT_NOEXEC) != 0) {
   3149  1.112   thorpej 				error = EACCES;
   3150  1.112   thorpej 				goto out;
   3151  1.112   thorpej 			}
   3152   1.10       mrg 		}
   3153  1.224      elad 
   3154   1.65   thorpej 		current = current->next;
   3155   1.10       mrg 	}
   3156   1.10       mrg 
   3157   1.10       mrg 	/* go back and fix up protections (no need to clip this time). */
   3158   1.10       mrg 
   3159   1.10       mrg 	current = entry;
   3160   1.10       mrg 	while ((current != &map->header) && (current->start < end)) {
   3161   1.10       mrg 		vm_prot_t old_prot;
   3162   1.85       chs 
   3163  1.174      yamt 		UVM_MAP_CLIP_END(map, current, end, NULL);
   3164   1.10       mrg 		old_prot = current->protection;
   3165   1.10       mrg 		if (set_max)
   3166   1.10       mrg 			current->protection =
   3167   1.10       mrg 			    (current->max_protection = new_prot) & old_prot;
   3168   1.10       mrg 		else
   3169   1.10       mrg 			current->protection = new_prot;
   3170   1.10       mrg 
   3171   1.10       mrg 		/*
   3172   1.98       chs 		 * update physical map if necessary.  worry about copy-on-write
   3173   1.10       mrg 		 * here -- CHECK THIS XXX
   3174   1.10       mrg 		 */
   3175   1.10       mrg 
   3176   1.10       mrg 		if (current->protection != old_prot) {
   3177   1.29     chuck 			/* update pmap! */
   3178   1.29     chuck 			pmap_protect(map->pmap, current->start, current->end,
   3179   1.29     chuck 			    current->protection & MASK(entry));
   3180  1.109   thorpej 
   3181  1.109   thorpej 			/*
   3182  1.109   thorpej 			 * If this entry points at a vnode, and the
   3183  1.109   thorpej 			 * protection includes VM_PROT_EXECUTE, mark
   3184  1.111   thorpej 			 * the vnode as VEXECMAP.
   3185  1.109   thorpej 			 */
   3186  1.109   thorpej 			if (UVM_ET_ISOBJ(current)) {
   3187  1.109   thorpej 				struct uvm_object *uobj =
   3188  1.109   thorpej 				    current->object.uvm_obj;
   3189  1.109   thorpej 
   3190  1.109   thorpej 				if (UVM_OBJ_IS_VNODE(uobj) &&
   3191  1.241        ad 				    (current->protection & VM_PROT_EXECUTE)) {
   3192  1.110   thorpej 					vn_markexec((struct vnode *) uobj);
   3193  1.241        ad 				}
   3194  1.109   thorpej 			}
   3195   1.65   thorpej 		}
   3196   1.10       mrg 
   3197   1.65   thorpej 		/*
   3198   1.65   thorpej 		 * If the map is configured to lock any future mappings,
   3199   1.65   thorpej 		 * wire this entry now if the old protection was VM_PROT_NONE
   3200   1.65   thorpej 		 * and the new protection is not VM_PROT_NONE.
   3201   1.65   thorpej 		 */
   3202   1.65   thorpej 
   3203   1.65   thorpej 		if ((map->flags & VM_MAP_WIREFUTURE) != 0 &&
   3204   1.65   thorpej 		    VM_MAPENT_ISWIRED(entry) == 0 &&
   3205   1.65   thorpej 		    old_prot == VM_PROT_NONE &&
   3206   1.65   thorpej 		    new_prot != VM_PROT_NONE) {
   3207   1.65   thorpej 			if (uvm_map_pageable(map, entry->start,
   3208  1.234   thorpej 			    entry->end, false,
   3209   1.94       chs 			    UVM_LK_ENTER|UVM_LK_EXIT) != 0) {
   3210   1.99       chs 
   3211   1.65   thorpej 				/*
   3212   1.65   thorpej 				 * If locking the entry fails, remember the
   3213   1.65   thorpej 				 * error if it's the first one.  Note we
   3214   1.65   thorpej 				 * still continue setting the protection in
   3215   1.94       chs 				 * the map, but will return the error
   3216   1.94       chs 				 * condition regardless.
   3217   1.65   thorpej 				 *
   3218   1.65   thorpej 				 * XXX Ignore what the actual error is,
   3219   1.65   thorpej 				 * XXX just call it a resource shortage
   3220   1.65   thorpej 				 * XXX so that it doesn't get confused
   3221   1.65   thorpej 				 * XXX what uvm_map_protect() itself would
   3222   1.65   thorpej 				 * XXX normally return.
   3223   1.65   thorpej 				 */
   3224   1.99       chs 
   3225   1.94       chs 				error = ENOMEM;
   3226   1.65   thorpej 			}
   3227   1.10       mrg 		}
   3228   1.10       mrg 		current = current->next;
   3229   1.10       mrg 	}
   3230  1.105     chris 	pmap_update(map->pmap);
   3231   1.85       chs 
   3232   1.65   thorpej  out:
   3233   1.10       mrg 	vm_map_unlock(map);
   3234  1.174      yamt 
   3235   1.94       chs 	UVMHIST_LOG(maphist, "<- done, error=%d",error,0,0,0);
   3236   1.94       chs 	return error;
   3237    1.1       mrg }
   3238    1.1       mrg 
   3239    1.1       mrg #undef  MASK
   3240    1.1       mrg 
   3241   1.98       chs /*
   3242    1.1       mrg  * uvm_map_inherit: set inheritance code for range of addrs in map.
   3243    1.1       mrg  *
   3244    1.1       mrg  * => map must be unlocked
   3245    1.1       mrg  * => note that the inherit code is used during a "fork".  see fork
   3246    1.1       mrg  *	code for details.
   3247    1.1       mrg  */
   3248    1.1       mrg 
   3249   1.10       mrg int
   3250  1.138     enami uvm_map_inherit(struct vm_map *map, vaddr_t start, vaddr_t end,
   3251  1.138     enami     vm_inherit_t new_inheritance)
   3252   1.10       mrg {
   3253   1.99       chs 	struct vm_map_entry *entry, *temp_entry;
   3254   1.10       mrg 	UVMHIST_FUNC("uvm_map_inherit"); UVMHIST_CALLED(maphist);
   3255   1.10       mrg 	UVMHIST_LOG(maphist,"(map=0x%x,start=0x%x,end=0x%x,new_inh=0x%x)",
   3256   1.10       mrg 	    map, start, end, new_inheritance);
   3257   1.10       mrg 
   3258   1.10       mrg 	switch (new_inheritance) {
   3259   1.80       wiz 	case MAP_INHERIT_NONE:
   3260   1.80       wiz 	case MAP_INHERIT_COPY:
   3261   1.80       wiz 	case MAP_INHERIT_SHARE:
   3262   1.10       mrg 		break;
   3263   1.10       mrg 	default:
   3264   1.10       mrg 		UVMHIST_LOG(maphist,"<- done (INVALID ARG)",0,0,0,0);
   3265   1.94       chs 		return EINVAL;
   3266   1.10       mrg 	}
   3267    1.1       mrg 
   3268   1.10       mrg 	vm_map_lock(map);
   3269   1.10       mrg 	VM_MAP_RANGE_CHECK(map, start, end);
   3270   1.10       mrg 	if (uvm_map_lookup_entry(map, start, &temp_entry)) {
   3271   1.10       mrg 		entry = temp_entry;
   3272  1.174      yamt 		UVM_MAP_CLIP_START(map, entry, start, NULL);
   3273   1.10       mrg 	}  else {
   3274   1.10       mrg 		entry = temp_entry->next;
   3275   1.10       mrg 	}
   3276   1.10       mrg 	while ((entry != &map->header) && (entry->start < end)) {
   3277  1.174      yamt 		UVM_MAP_CLIP_END(map, entry, end, NULL);
   3278   1.10       mrg 		entry->inheritance = new_inheritance;
   3279   1.10       mrg 		entry = entry->next;
   3280   1.10       mrg 	}
   3281   1.10       mrg 	vm_map_unlock(map);
   3282   1.10       mrg 	UVMHIST_LOG(maphist,"<- done (OK)",0,0,0,0);
   3283   1.94       chs 	return 0;
   3284   1.41       mrg }
   3285   1.41       mrg 
   3286   1.98       chs /*
   3287   1.41       mrg  * uvm_map_advice: set advice code for range of addrs in map.
   3288   1.41       mrg  *
   3289   1.41       mrg  * => map must be unlocked
   3290   1.41       mrg  */
   3291   1.41       mrg 
   3292   1.41       mrg int
   3293  1.138     enami uvm_map_advice(struct vm_map *map, vaddr_t start, vaddr_t end, int new_advice)
   3294   1.41       mrg {
   3295   1.99       chs 	struct vm_map_entry *entry, *temp_entry;
   3296   1.41       mrg 	UVMHIST_FUNC("uvm_map_advice"); UVMHIST_CALLED(maphist);
   3297   1.41       mrg 	UVMHIST_LOG(maphist,"(map=0x%x,start=0x%x,end=0x%x,new_adv=0x%x)",
   3298   1.41       mrg 	    map, start, end, new_advice);
   3299   1.41       mrg 
   3300   1.41       mrg 	vm_map_lock(map);
   3301   1.41       mrg 	VM_MAP_RANGE_CHECK(map, start, end);
   3302   1.41       mrg 	if (uvm_map_lookup_entry(map, start, &temp_entry)) {
   3303   1.41       mrg 		entry = temp_entry;
   3304  1.174      yamt 		UVM_MAP_CLIP_START(map, entry, start, NULL);
   3305   1.41       mrg 	} else {
   3306   1.41       mrg 		entry = temp_entry->next;
   3307   1.41       mrg 	}
   3308   1.61   thorpej 
   3309   1.61   thorpej 	/*
   3310   1.61   thorpej 	 * XXXJRT: disallow holes?
   3311   1.61   thorpej 	 */
   3312   1.61   thorpej 
   3313   1.41       mrg 	while ((entry != &map->header) && (entry->start < end)) {
   3314  1.174      yamt 		UVM_MAP_CLIP_END(map, entry, end, NULL);
   3315   1.41       mrg 
   3316   1.41       mrg 		switch (new_advice) {
   3317   1.41       mrg 		case MADV_NORMAL:
   3318   1.41       mrg 		case MADV_RANDOM:
   3319   1.41       mrg 		case MADV_SEQUENTIAL:
   3320   1.41       mrg 			/* nothing special here */
   3321   1.41       mrg 			break;
   3322   1.41       mrg 
   3323   1.41       mrg 		default:
   3324   1.50       mrg 			vm_map_unlock(map);
   3325   1.41       mrg 			UVMHIST_LOG(maphist,"<- done (INVALID ARG)",0,0,0,0);
   3326   1.94       chs 			return EINVAL;
   3327   1.41       mrg 		}
   3328   1.41       mrg 		entry->advice = new_advice;
   3329   1.41       mrg 		entry = entry->next;
   3330   1.41       mrg 	}
   3331   1.41       mrg 
   3332   1.41       mrg 	vm_map_unlock(map);
   3333   1.41       mrg 	UVMHIST_LOG(maphist,"<- done (OK)",0,0,0,0);
   3334   1.94       chs 	return 0;
   3335    1.1       mrg }
   3336    1.1       mrg 
   3337    1.1       mrg /*
   3338    1.1       mrg  * uvm_map_pageable: sets the pageability of a range in a map.
   3339    1.1       mrg  *
   3340   1.56   thorpej  * => wires map entries.  should not be used for transient page locking.
   3341   1.56   thorpej  *	for that, use uvm_fault_wire()/uvm_fault_unwire() (see uvm_vslock()).
   3342  1.216  drochner  * => regions specified as not pageable require lock-down (wired) memory
   3343    1.1       mrg  *	and page tables.
   3344   1.59   thorpej  * => map must never be read-locked
   3345  1.234   thorpej  * => if islocked is true, map is already write-locked
   3346   1.59   thorpej  * => we always unlock the map, since we must downgrade to a read-lock
   3347   1.59   thorpej  *	to call uvm_fault_wire()
   3348    1.1       mrg  * => XXXCDC: check this and try and clean it up.
   3349    1.1       mrg  */
   3350    1.1       mrg 
   3351   1.19    kleink int
   3352  1.138     enami uvm_map_pageable(struct vm_map *map, vaddr_t start, vaddr_t end,
   3353  1.233   thorpej     bool new_pageable, int lockflags)
   3354    1.1       mrg {
   3355   1.99       chs 	struct vm_map_entry *entry, *start_entry, *failed_entry;
   3356   1.10       mrg 	int rv;
   3357   1.60   thorpej #ifdef DIAGNOSTIC
   3358   1.60   thorpej 	u_int timestamp_save;
   3359   1.60   thorpej #endif
   3360   1.10       mrg 	UVMHIST_FUNC("uvm_map_pageable"); UVMHIST_CALLED(maphist);
   3361   1.10       mrg 	UVMHIST_LOG(maphist,"(map=0x%x,start=0x%x,end=0x%x,new_pageable=0x%x)",
   3362   1.85       chs 		    map, start, end, new_pageable);
   3363   1.85       chs 	KASSERT(map->flags & VM_MAP_PAGEABLE);
   3364   1.45   thorpej 
   3365   1.64   thorpej 	if ((lockflags & UVM_LK_ENTER) == 0)
   3366   1.59   thorpej 		vm_map_lock(map);
   3367   1.10       mrg 	VM_MAP_RANGE_CHECK(map, start, end);
   3368   1.10       mrg 
   3369   1.98       chs 	/*
   3370   1.10       mrg 	 * only one pageability change may take place at one time, since
   3371   1.10       mrg 	 * uvm_fault_wire assumes it will be called only once for each
   3372   1.10       mrg 	 * wiring/unwiring.  therefore, we have to make sure we're actually
   3373   1.10       mrg 	 * changing the pageability for the entire region.  we do so before
   3374   1.98       chs 	 * making any changes.
   3375   1.10       mrg 	 */
   3376   1.10       mrg 
   3377  1.234   thorpej 	if (uvm_map_lookup_entry(map, start, &start_entry) == false) {
   3378   1.64   thorpej 		if ((lockflags & UVM_LK_EXIT) == 0)
   3379   1.64   thorpej 			vm_map_unlock(map);
   3380   1.85       chs 
   3381   1.94       chs 		UVMHIST_LOG(maphist,"<- done (fault)",0,0,0,0);
   3382   1.94       chs 		return EFAULT;
   3383   1.10       mrg 	}
   3384   1.10       mrg 	entry = start_entry;
   3385   1.10       mrg 
   3386   1.98       chs 	/*
   3387  1.100       wiz 	 * handle wiring and unwiring separately.
   3388   1.10       mrg 	 */
   3389    1.1       mrg 
   3390   1.56   thorpej 	if (new_pageable) {		/* unwire */
   3391  1.174      yamt 		UVM_MAP_CLIP_START(map, entry, start, NULL);
   3392   1.85       chs 
   3393   1.10       mrg 		/*
   3394   1.10       mrg 		 * unwiring.  first ensure that the range to be unwired is
   3395   1.98       chs 		 * really wired down and that there are no holes.
   3396   1.10       mrg 		 */
   3397   1.85       chs 
   3398   1.10       mrg 		while ((entry != &map->header) && (entry->start < end)) {
   3399   1.10       mrg 			if (entry->wired_count == 0 ||
   3400   1.10       mrg 			    (entry->end < end &&
   3401   1.55   thorpej 			     (entry->next == &map->header ||
   3402   1.55   thorpej 			      entry->next->start > entry->end))) {
   3403   1.64   thorpej 				if ((lockflags & UVM_LK_EXIT) == 0)
   3404   1.64   thorpej 					vm_map_unlock(map);
   3405   1.94       chs 				UVMHIST_LOG(maphist, "<- done (INVAL)",0,0,0,0);
   3406   1.94       chs 				return EINVAL;
   3407   1.10       mrg 			}
   3408   1.10       mrg 			entry = entry->next;
   3409   1.10       mrg 		}
   3410   1.10       mrg 
   3411   1.98       chs 		/*
   3412   1.56   thorpej 		 * POSIX 1003.1b - a single munlock call unlocks a region,
   3413   1.56   thorpej 		 * regardless of the number of mlock calls made on that
   3414   1.56   thorpej 		 * region.
   3415   1.10       mrg 		 */
   3416   1.85       chs 
   3417   1.10       mrg 		entry = start_entry;
   3418   1.10       mrg 		while ((entry != &map->header) && (entry->start < end)) {
   3419  1.174      yamt 			UVM_MAP_CLIP_END(map, entry, end, NULL);
   3420   1.56   thorpej 			if (VM_MAPENT_ISWIRED(entry))
   3421   1.10       mrg 				uvm_map_entry_unwire(map, entry);
   3422   1.10       mrg 			entry = entry->next;
   3423   1.10       mrg 		}
   3424   1.64   thorpej 		if ((lockflags & UVM_LK_EXIT) == 0)
   3425   1.64   thorpej 			vm_map_unlock(map);
   3426   1.10       mrg 		UVMHIST_LOG(maphist,"<- done (OK UNWIRE)",0,0,0,0);
   3427   1.94       chs 		return 0;
   3428   1.10       mrg 	}
   3429   1.10       mrg 
   3430   1.10       mrg 	/*
   3431   1.10       mrg 	 * wire case: in two passes [XXXCDC: ugly block of code here]
   3432   1.10       mrg 	 *
   3433   1.10       mrg 	 * 1: holding the write lock, we create any anonymous maps that need
   3434   1.10       mrg 	 *    to be created.  then we clip each map entry to the region to
   3435   1.98       chs 	 *    be wired and increment its wiring count.
   3436   1.10       mrg 	 *
   3437   1.10       mrg 	 * 2: we downgrade to a read lock, and call uvm_fault_wire to fault
   3438   1.56   thorpej 	 *    in the pages for any newly wired area (wired_count == 1).
   3439   1.10       mrg 	 *
   3440   1.10       mrg 	 *    downgrading to a read lock for uvm_fault_wire avoids a possible
   3441   1.10       mrg 	 *    deadlock with another thread that may have faulted on one of
   3442   1.10       mrg 	 *    the pages to be wired (it would mark the page busy, blocking
   3443   1.10       mrg 	 *    us, then in turn block on the map lock that we hold).  because
   3444   1.10       mrg 	 *    of problems in the recursive lock package, we cannot upgrade
   3445   1.10       mrg 	 *    to a write lock in vm_map_lookup.  thus, any actions that
   3446   1.10       mrg 	 *    require the write lock must be done beforehand.  because we
   3447   1.10       mrg 	 *    keep the read lock on the map, the copy-on-write status of the
   3448   1.10       mrg 	 *    entries we modify here cannot change.
   3449   1.10       mrg 	 */
   3450   1.10       mrg 
   3451   1.10       mrg 	while ((entry != &map->header) && (entry->start < end)) {
   3452   1.55   thorpej 		if (VM_MAPENT_ISWIRED(entry) == 0) { /* not already wired? */
   3453   1.85       chs 
   3454   1.85       chs 			/*
   3455   1.10       mrg 			 * perform actions of vm_map_lookup that need the
   3456   1.10       mrg 			 * write lock on the map: create an anonymous map
   3457   1.10       mrg 			 * for a copy-on-write region, or an anonymous map
   3458   1.29     chuck 			 * for a zero-fill region.  (XXXCDC: submap case
   3459   1.29     chuck 			 * ok?)
   3460   1.10       mrg 			 */
   3461   1.85       chs 
   3462   1.29     chuck 			if (!UVM_ET_ISSUBMAP(entry)) {  /* not submap */
   3463   1.98       chs 				if (UVM_ET_ISNEEDSCOPY(entry) &&
   3464  1.117       chs 				    ((entry->max_protection & VM_PROT_WRITE) ||
   3465   1.54   thorpej 				     (entry->object.uvm_obj == NULL))) {
   3466  1.212      yamt 					amap_copy(map, entry, 0, start, end);
   3467   1.10       mrg 					/* XXXCDC: wait OK? */
   3468   1.10       mrg 				}
   3469   1.10       mrg 			}
   3470   1.55   thorpej 		}
   3471  1.174      yamt 		UVM_MAP_CLIP_START(map, entry, start, NULL);
   3472  1.174      yamt 		UVM_MAP_CLIP_END(map, entry, end, NULL);
   3473   1.10       mrg 		entry->wired_count++;
   3474   1.10       mrg 
   3475   1.10       mrg 		/*
   3476   1.98       chs 		 * Check for holes
   3477   1.10       mrg 		 */
   3478   1.85       chs 
   3479   1.54   thorpej 		if (entry->protection == VM_PROT_NONE ||
   3480   1.54   thorpej 		    (entry->end < end &&
   3481   1.54   thorpej 		     (entry->next == &map->header ||
   3482   1.54   thorpej 		      entry->next->start > entry->end))) {
   3483   1.85       chs 
   3484   1.10       mrg 			/*
   3485   1.10       mrg 			 * found one.  amap creation actions do not need to
   3486   1.98       chs 			 * be undone, but the wired counts need to be restored.
   3487   1.10       mrg 			 */
   3488   1.85       chs 
   3489   1.10       mrg 			while (entry != &map->header && entry->end > start) {
   3490   1.10       mrg 				entry->wired_count--;
   3491   1.10       mrg 				entry = entry->prev;
   3492   1.10       mrg 			}
   3493   1.64   thorpej 			if ((lockflags & UVM_LK_EXIT) == 0)
   3494   1.64   thorpej 				vm_map_unlock(map);
   3495   1.10       mrg 			UVMHIST_LOG(maphist,"<- done (INVALID WIRE)",0,0,0,0);
   3496   1.94       chs 			return EINVAL;
   3497   1.10       mrg 		}
   3498   1.10       mrg 		entry = entry->next;
   3499   1.10       mrg 	}
   3500   1.10       mrg 
   3501   1.10       mrg 	/*
   3502   1.10       mrg 	 * Pass 2.
   3503   1.10       mrg 	 */
   3504   1.51   thorpej 
   3505   1.60   thorpej #ifdef DIAGNOSTIC
   3506   1.60   thorpej 	timestamp_save = map->timestamp;
   3507   1.60   thorpej #endif
   3508   1.60   thorpej 	vm_map_busy(map);
   3509  1.249      yamt 	vm_map_unlock(map);
   3510   1.10       mrg 
   3511   1.10       mrg 	rv = 0;
   3512   1.10       mrg 	entry = start_entry;
   3513   1.10       mrg 	while (entry != &map->header && entry->start < end) {
   3514   1.51   thorpej 		if (entry->wired_count == 1) {
   3515   1.44   thorpej 			rv = uvm_fault_wire(map, entry->start, entry->end,
   3516  1.216  drochner 			    entry->max_protection, 1);
   3517   1.10       mrg 			if (rv) {
   3518   1.94       chs 
   3519   1.51   thorpej 				/*
   3520   1.51   thorpej 				 * wiring failed.  break out of the loop.
   3521   1.51   thorpej 				 * we'll clean up the map below, once we
   3522   1.51   thorpej 				 * have a write lock again.
   3523   1.51   thorpej 				 */
   3524   1.94       chs 
   3525   1.51   thorpej 				break;
   3526   1.10       mrg 			}
   3527   1.10       mrg 		}
   3528   1.10       mrg 		entry = entry->next;
   3529   1.10       mrg 	}
   3530   1.10       mrg 
   3531  1.139     enami 	if (rv) {	/* failed? */
   3532   1.85       chs 
   3533   1.52   thorpej 		/*
   3534   1.52   thorpej 		 * Get back to an exclusive (write) lock.
   3535   1.52   thorpej 		 */
   3536   1.85       chs 
   3537  1.249      yamt 		vm_map_lock(map);
   3538   1.60   thorpej 		vm_map_unbusy(map);
   3539   1.60   thorpej 
   3540   1.60   thorpej #ifdef DIAGNOSTIC
   3541  1.252      yamt 		if (timestamp_save + 1 != map->timestamp)
   3542   1.60   thorpej 			panic("uvm_map_pageable: stale map");
   3543   1.60   thorpej #endif
   3544   1.10       mrg 
   3545   1.51   thorpej 		/*
   3546   1.51   thorpej 		 * first drop the wiring count on all the entries
   3547   1.51   thorpej 		 * which haven't actually been wired yet.
   3548   1.51   thorpej 		 */
   3549   1.85       chs 
   3550   1.54   thorpej 		failed_entry = entry;
   3551   1.54   thorpej 		while (entry != &map->header && entry->start < end) {
   3552   1.51   thorpej 			entry->wired_count--;
   3553   1.54   thorpej 			entry = entry->next;
   3554   1.54   thorpej 		}
   3555   1.51   thorpej 
   3556   1.51   thorpej 		/*
   3557   1.54   thorpej 		 * now, unwire all the entries that were successfully
   3558   1.54   thorpej 		 * wired above.
   3559   1.51   thorpej 		 */
   3560   1.85       chs 
   3561   1.54   thorpej 		entry = start_entry;
   3562   1.54   thorpej 		while (entry != failed_entry) {
   3563   1.54   thorpej 			entry->wired_count--;
   3564   1.55   thorpej 			if (VM_MAPENT_ISWIRED(entry) == 0)
   3565   1.54   thorpej 				uvm_map_entry_unwire(map, entry);
   3566   1.54   thorpej 			entry = entry->next;
   3567   1.54   thorpej 		}
   3568   1.64   thorpej 		if ((lockflags & UVM_LK_EXIT) == 0)
   3569   1.64   thorpej 			vm_map_unlock(map);
   3570   1.10       mrg 		UVMHIST_LOG(maphist, "<- done (RV=%d)", rv,0,0,0);
   3571  1.139     enami 		return (rv);
   3572   1.10       mrg 	}
   3573   1.51   thorpej 
   3574   1.64   thorpej 	if ((lockflags & UVM_LK_EXIT) == 0) {
   3575   1.64   thorpej 		vm_map_unbusy(map);
   3576   1.64   thorpej 	} else {
   3577   1.85       chs 
   3578   1.64   thorpej 		/*
   3579   1.64   thorpej 		 * Get back to an exclusive (write) lock.
   3580   1.64   thorpej 		 */
   3581   1.85       chs 
   3582  1.249      yamt 		vm_map_lock(map);
   3583   1.64   thorpej 		vm_map_unbusy(map);
   3584   1.64   thorpej 	}
   3585   1.64   thorpej 
   3586   1.10       mrg 	UVMHIST_LOG(maphist,"<- done (OK WIRE)",0,0,0,0);
   3587   1.94       chs 	return 0;
   3588    1.1       mrg }
   3589    1.1       mrg 
   3590    1.1       mrg /*
   3591   1.54   thorpej  * uvm_map_pageable_all: special case of uvm_map_pageable - affects
   3592   1.54   thorpej  * all mapped regions.
   3593   1.54   thorpej  *
   3594   1.54   thorpej  * => map must not be locked.
   3595   1.54   thorpej  * => if no flags are specified, all regions are unwired.
   3596   1.54   thorpej  * => XXXJRT: has some of the same problems as uvm_map_pageable() above.
   3597   1.54   thorpej  */
   3598   1.54   thorpej 
   3599   1.54   thorpej int
   3600  1.138     enami uvm_map_pageable_all(struct vm_map *map, int flags, vsize_t limit)
   3601   1.54   thorpej {
   3602   1.99       chs 	struct vm_map_entry *entry, *failed_entry;
   3603   1.54   thorpej 	vsize_t size;
   3604   1.54   thorpej 	int rv;
   3605   1.60   thorpej #ifdef DIAGNOSTIC
   3606   1.60   thorpej 	u_int timestamp_save;
   3607   1.60   thorpej #endif
   3608   1.54   thorpej 	UVMHIST_FUNC("uvm_map_pageable_all"); UVMHIST_CALLED(maphist);
   3609   1.54   thorpej 	UVMHIST_LOG(maphist,"(map=0x%x,flags=0x%x)", map, flags, 0, 0);
   3610   1.54   thorpej 
   3611   1.85       chs 	KASSERT(map->flags & VM_MAP_PAGEABLE);
   3612   1.54   thorpej 
   3613   1.54   thorpej 	vm_map_lock(map);
   3614   1.54   thorpej 
   3615   1.54   thorpej 	/*
   3616   1.54   thorpej 	 * handle wiring and unwiring separately.
   3617   1.54   thorpej 	 */
   3618   1.54   thorpej 
   3619   1.54   thorpej 	if (flags == 0) {			/* unwire */
   3620   1.99       chs 
   3621   1.54   thorpej 		/*
   3622   1.56   thorpej 		 * POSIX 1003.1b -- munlockall unlocks all regions,
   3623   1.56   thorpej 		 * regardless of how many times mlockall has been called.
   3624   1.54   thorpej 		 */
   3625   1.99       chs 
   3626   1.54   thorpej 		for (entry = map->header.next; entry != &map->header;
   3627   1.54   thorpej 		     entry = entry->next) {
   3628   1.56   thorpej 			if (VM_MAPENT_ISWIRED(entry))
   3629   1.56   thorpej 				uvm_map_entry_unwire(map, entry);
   3630   1.54   thorpej 		}
   3631  1.238        ad 		map->flags &= ~VM_MAP_WIREFUTURE;
   3632   1.54   thorpej 		vm_map_unlock(map);
   3633   1.54   thorpej 		UVMHIST_LOG(maphist,"<- done (OK UNWIRE)",0,0,0,0);
   3634   1.94       chs 		return 0;
   3635   1.54   thorpej 	}
   3636   1.54   thorpej 
   3637   1.54   thorpej 	if (flags & MCL_FUTURE) {
   3638   1.99       chs 
   3639   1.54   thorpej 		/*
   3640   1.54   thorpej 		 * must wire all future mappings; remember this.
   3641   1.54   thorpej 		 */
   3642   1.99       chs 
   3643  1.238        ad 		map->flags |= VM_MAP_WIREFUTURE;
   3644   1.54   thorpej 	}
   3645   1.54   thorpej 
   3646   1.54   thorpej 	if ((flags & MCL_CURRENT) == 0) {
   3647   1.99       chs 
   3648   1.54   thorpej 		/*
   3649   1.54   thorpej 		 * no more work to do!
   3650   1.54   thorpej 		 */
   3651   1.99       chs 
   3652   1.54   thorpej 		UVMHIST_LOG(maphist,"<- done (OK no wire)",0,0,0,0);
   3653   1.54   thorpej 		vm_map_unlock(map);
   3654   1.94       chs 		return 0;
   3655   1.54   thorpej 	}
   3656   1.54   thorpej 
   3657   1.54   thorpej 	/*
   3658   1.54   thorpej 	 * wire case: in three passes [XXXCDC: ugly block of code here]
   3659   1.54   thorpej 	 *
   3660   1.54   thorpej 	 * 1: holding the write lock, count all pages mapped by non-wired
   3661   1.54   thorpej 	 *    entries.  if this would cause us to go over our limit, we fail.
   3662   1.54   thorpej 	 *
   3663   1.54   thorpej 	 * 2: still holding the write lock, we create any anonymous maps that
   3664   1.54   thorpej 	 *    need to be created.  then we increment its wiring count.
   3665   1.54   thorpej 	 *
   3666   1.54   thorpej 	 * 3: we downgrade to a read lock, and call uvm_fault_wire to fault
   3667   1.56   thorpej 	 *    in the pages for any newly wired area (wired_count == 1).
   3668   1.54   thorpej 	 *
   3669   1.54   thorpej 	 *    downgrading to a read lock for uvm_fault_wire avoids a possible
   3670   1.54   thorpej 	 *    deadlock with another thread that may have faulted on one of
   3671   1.54   thorpej 	 *    the pages to be wired (it would mark the page busy, blocking
   3672   1.54   thorpej 	 *    us, then in turn block on the map lock that we hold).  because
   3673   1.54   thorpej 	 *    of problems in the recursive lock package, we cannot upgrade
   3674   1.54   thorpej 	 *    to a write lock in vm_map_lookup.  thus, any actions that
   3675   1.54   thorpej 	 *    require the write lock must be done beforehand.  because we
   3676   1.54   thorpej 	 *    keep the read lock on the map, the copy-on-write status of the
   3677   1.54   thorpej 	 *    entries we modify here cannot change.
   3678   1.54   thorpej 	 */
   3679   1.54   thorpej 
   3680   1.54   thorpej 	for (size = 0, entry = map->header.next; entry != &map->header;
   3681   1.54   thorpej 	     entry = entry->next) {
   3682   1.54   thorpej 		if (entry->protection != VM_PROT_NONE &&
   3683   1.55   thorpej 		    VM_MAPENT_ISWIRED(entry) == 0) { /* not already wired? */
   3684   1.54   thorpej 			size += entry->end - entry->start;
   3685   1.54   thorpej 		}
   3686   1.54   thorpej 	}
   3687   1.54   thorpej 
   3688   1.54   thorpej 	if (atop(size) + uvmexp.wired > uvmexp.wiredmax) {
   3689   1.54   thorpej 		vm_map_unlock(map);
   3690   1.94       chs 		return ENOMEM;
   3691   1.54   thorpej 	}
   3692   1.54   thorpej 
   3693   1.54   thorpej 	if (limit != 0 &&
   3694   1.54   thorpej 	    (size + ptoa(pmap_wired_count(vm_map_pmap(map))) > limit)) {
   3695   1.54   thorpej 		vm_map_unlock(map);
   3696   1.94       chs 		return ENOMEM;
   3697   1.54   thorpej 	}
   3698   1.54   thorpej 
   3699   1.54   thorpej 	/*
   3700   1.54   thorpej 	 * Pass 2.
   3701   1.54   thorpej 	 */
   3702   1.54   thorpej 
   3703   1.54   thorpej 	for (entry = map->header.next; entry != &map->header;
   3704   1.54   thorpej 	     entry = entry->next) {
   3705   1.54   thorpej 		if (entry->protection == VM_PROT_NONE)
   3706   1.54   thorpej 			continue;
   3707   1.55   thorpej 		if (VM_MAPENT_ISWIRED(entry) == 0) { /* not already wired? */
   3708   1.99       chs 
   3709   1.54   thorpej 			/*
   3710   1.54   thorpej 			 * perform actions of vm_map_lookup that need the
   3711   1.54   thorpej 			 * write lock on the map: create an anonymous map
   3712   1.54   thorpej 			 * for a copy-on-write region, or an anonymous map
   3713   1.54   thorpej 			 * for a zero-fill region.  (XXXCDC: submap case
   3714   1.54   thorpej 			 * ok?)
   3715   1.54   thorpej 			 */
   3716   1.99       chs 
   3717   1.54   thorpej 			if (!UVM_ET_ISSUBMAP(entry)) {	/* not submap */
   3718   1.98       chs 				if (UVM_ET_ISNEEDSCOPY(entry) &&
   3719  1.117       chs 				    ((entry->max_protection & VM_PROT_WRITE) ||
   3720   1.54   thorpej 				     (entry->object.uvm_obj == NULL))) {
   3721  1.212      yamt 					amap_copy(map, entry, 0, entry->start,
   3722  1.212      yamt 					    entry->end);
   3723   1.54   thorpej 					/* XXXCDC: wait OK? */
   3724   1.54   thorpej 				}
   3725   1.54   thorpej 			}
   3726   1.55   thorpej 		}
   3727   1.54   thorpej 		entry->wired_count++;
   3728   1.54   thorpej 	}
   3729   1.54   thorpej 
   3730   1.54   thorpej 	/*
   3731   1.54   thorpej 	 * Pass 3.
   3732   1.54   thorpej 	 */
   3733   1.54   thorpej 
   3734   1.60   thorpej #ifdef DIAGNOSTIC
   3735   1.60   thorpej 	timestamp_save = map->timestamp;
   3736   1.60   thorpej #endif
   3737   1.60   thorpej 	vm_map_busy(map);
   3738  1.249      yamt 	vm_map_unlock(map);
   3739   1.54   thorpej 
   3740   1.94       chs 	rv = 0;
   3741   1.54   thorpej 	for (entry = map->header.next; entry != &map->header;
   3742   1.54   thorpej 	     entry = entry->next) {
   3743   1.54   thorpej 		if (entry->wired_count == 1) {
   3744   1.54   thorpej 			rv = uvm_fault_wire(map, entry->start, entry->end,
   3745  1.216  drochner 			    entry->max_protection, 1);
   3746   1.54   thorpej 			if (rv) {
   3747   1.99       chs 
   3748   1.54   thorpej 				/*
   3749   1.54   thorpej 				 * wiring failed.  break out of the loop.
   3750   1.54   thorpej 				 * we'll clean up the map below, once we
   3751   1.54   thorpej 				 * have a write lock again.
   3752   1.54   thorpej 				 */
   3753   1.99       chs 
   3754   1.54   thorpej 				break;
   3755   1.54   thorpej 			}
   3756   1.54   thorpej 		}
   3757   1.54   thorpej 	}
   3758   1.54   thorpej 
   3759   1.99       chs 	if (rv) {
   3760   1.99       chs 
   3761   1.54   thorpej 		/*
   3762   1.54   thorpej 		 * Get back an exclusive (write) lock.
   3763   1.54   thorpej 		 */
   3764   1.99       chs 
   3765  1.249      yamt 		vm_map_lock(map);
   3766   1.60   thorpej 		vm_map_unbusy(map);
   3767   1.60   thorpej 
   3768   1.60   thorpej #ifdef DIAGNOSTIC
   3769  1.252      yamt 		if (timestamp_save + 1 != map->timestamp)
   3770   1.60   thorpej 			panic("uvm_map_pageable_all: stale map");
   3771   1.60   thorpej #endif
   3772   1.54   thorpej 
   3773   1.54   thorpej 		/*
   3774   1.54   thorpej 		 * first drop the wiring count on all the entries
   3775   1.54   thorpej 		 * which haven't actually been wired yet.
   3776   1.67   thorpej 		 *
   3777   1.67   thorpej 		 * Skip VM_PROT_NONE entries like we did above.
   3778   1.54   thorpej 		 */
   3779   1.99       chs 
   3780   1.54   thorpej 		failed_entry = entry;
   3781   1.54   thorpej 		for (/* nothing */; entry != &map->header;
   3782   1.67   thorpej 		     entry = entry->next) {
   3783   1.67   thorpej 			if (entry->protection == VM_PROT_NONE)
   3784   1.67   thorpej 				continue;
   3785   1.54   thorpej 			entry->wired_count--;
   3786   1.67   thorpej 		}
   3787   1.54   thorpej 
   3788   1.54   thorpej 		/*
   3789   1.54   thorpej 		 * now, unwire all the entries that were successfully
   3790   1.54   thorpej 		 * wired above.
   3791   1.67   thorpej 		 *
   3792   1.67   thorpej 		 * Skip VM_PROT_NONE entries like we did above.
   3793   1.54   thorpej 		 */
   3794   1.99       chs 
   3795   1.54   thorpej 		for (entry = map->header.next; entry != failed_entry;
   3796   1.54   thorpej 		     entry = entry->next) {
   3797   1.67   thorpej 			if (entry->protection == VM_PROT_NONE)
   3798   1.67   thorpej 				continue;
   3799   1.54   thorpej 			entry->wired_count--;
   3800   1.67   thorpej 			if (VM_MAPENT_ISWIRED(entry))
   3801   1.54   thorpej 				uvm_map_entry_unwire(map, entry);
   3802   1.54   thorpej 		}
   3803   1.54   thorpej 		vm_map_unlock(map);
   3804   1.54   thorpej 		UVMHIST_LOG(maphist,"<- done (RV=%d)", rv,0,0,0);
   3805   1.54   thorpej 		return (rv);
   3806   1.54   thorpej 	}
   3807   1.54   thorpej 
   3808   1.60   thorpej 	vm_map_unbusy(map);
   3809   1.54   thorpej 
   3810   1.54   thorpej 	UVMHIST_LOG(maphist,"<- done (OK WIRE)",0,0,0,0);
   3811   1.94       chs 	return 0;
   3812   1.54   thorpej }
   3813   1.54   thorpej 
   3814   1.54   thorpej /*
   3815   1.61   thorpej  * uvm_map_clean: clean out a map range
   3816    1.1       mrg  *
   3817    1.1       mrg  * => valid flags:
   3818   1.61   thorpej  *   if (flags & PGO_CLEANIT): dirty pages are cleaned first
   3819    1.1       mrg  *   if (flags & PGO_SYNCIO): dirty pages are written synchronously
   3820    1.1       mrg  *   if (flags & PGO_DEACTIVATE): any cached pages are deactivated after clean
   3821    1.1       mrg  *   if (flags & PGO_FREE): any cached pages are freed after clean
   3822    1.1       mrg  * => returns an error if any part of the specified range isn't mapped
   3823   1.98       chs  * => never a need to flush amap layer since the anonymous memory has
   3824   1.61   thorpej  *	no permanent home, but may deactivate pages there
   3825   1.61   thorpej  * => called from sys_msync() and sys_madvise()
   3826    1.1       mrg  * => caller must not write-lock map (read OK).
   3827    1.1       mrg  * => we may sleep while cleaning if SYNCIO [with map read-locked]
   3828    1.1       mrg  */
   3829    1.1       mrg 
   3830   1.10       mrg int
   3831  1.138     enami uvm_map_clean(struct vm_map *map, vaddr_t start, vaddr_t end, int flags)
   3832   1.10       mrg {
   3833   1.99       chs 	struct vm_map_entry *current, *entry;
   3834   1.61   thorpej 	struct uvm_object *uobj;
   3835   1.61   thorpej 	struct vm_amap *amap;
   3836   1.61   thorpej 	struct vm_anon *anon;
   3837   1.61   thorpej 	struct vm_page *pg;
   3838   1.61   thorpej 	vaddr_t offset;
   3839   1.24       eeh 	vsize_t size;
   3840  1.188       dbj 	voff_t uoff;
   3841  1.106       chs 	int error, refs;
   3842   1.10       mrg 	UVMHIST_FUNC("uvm_map_clean"); UVMHIST_CALLED(maphist);
   3843   1.85       chs 
   3844   1.10       mrg 	UVMHIST_LOG(maphist,"(map=0x%x,start=0x%x,end=0x%x,flags=0x%x)",
   3845   1.85       chs 		    map, start, end, flags);
   3846   1.85       chs 	KASSERT((flags & (PGO_FREE|PGO_DEACTIVATE)) !=
   3847   1.85       chs 		(PGO_FREE|PGO_DEACTIVATE));
   3848   1.61   thorpej 
   3849   1.10       mrg 	vm_map_lock_read(map);
   3850   1.10       mrg 	VM_MAP_RANGE_CHECK(map, start, end);
   3851  1.234   thorpej 	if (uvm_map_lookup_entry(map, start, &entry) == false) {
   3852   1.10       mrg 		vm_map_unlock_read(map);
   3853   1.94       chs 		return EFAULT;
   3854   1.10       mrg 	}
   3855   1.10       mrg 
   3856   1.10       mrg 	/*
   3857  1.186       chs 	 * Make a first pass to check for holes and wiring problems.
   3858   1.10       mrg 	 */
   3859   1.85       chs 
   3860   1.10       mrg 	for (current = entry; current->start < end; current = current->next) {
   3861   1.10       mrg 		if (UVM_ET_ISSUBMAP(current)) {
   3862   1.10       mrg 			vm_map_unlock_read(map);
   3863   1.94       chs 			return EINVAL;
   3864   1.10       mrg 		}
   3865  1.186       chs 		if ((flags & PGO_FREE) != 0 && VM_MAPENT_ISWIRED(entry)) {
   3866  1.186       chs 			vm_map_unlock_read(map);
   3867  1.186       chs 			return EBUSY;
   3868  1.186       chs 		}
   3869   1.90       chs 		if (end <= current->end) {
   3870   1.90       chs 			break;
   3871   1.90       chs 		}
   3872   1.90       chs 		if (current->end != current->next->start) {
   3873   1.10       mrg 			vm_map_unlock_read(map);
   3874   1.94       chs 			return EFAULT;
   3875   1.10       mrg 		}
   3876   1.10       mrg 	}
   3877   1.10       mrg 
   3878   1.94       chs 	error = 0;
   3879   1.90       chs 	for (current = entry; start < end; current = current->next) {
   3880   1.61   thorpej 		amap = current->aref.ar_amap;	/* top layer */
   3881   1.61   thorpej 		uobj = current->object.uvm_obj;	/* bottom layer */
   3882   1.85       chs 		KASSERT(start >= current->start);
   3883    1.1       mrg 
   3884   1.10       mrg 		/*
   3885   1.61   thorpej 		 * No amap cleaning necessary if:
   3886   1.61   thorpej 		 *
   3887   1.61   thorpej 		 *	(1) There's no amap.
   3888   1.61   thorpej 		 *
   3889   1.61   thorpej 		 *	(2) We're not deactivating or freeing pages.
   3890   1.10       mrg 		 */
   3891   1.85       chs 
   3892   1.90       chs 		if (amap == NULL || (flags & (PGO_DEACTIVATE|PGO_FREE)) == 0)
   3893   1.61   thorpej 			goto flush_object;
   3894   1.61   thorpej 
   3895   1.61   thorpej 		amap_lock(amap);
   3896   1.61   thorpej 		offset = start - current->start;
   3897   1.90       chs 		size = MIN(end, current->end) - start;
   3898   1.90       chs 		for ( ; size != 0; size -= PAGE_SIZE, offset += PAGE_SIZE) {
   3899   1.61   thorpej 			anon = amap_lookup(&current->aref, offset);
   3900   1.61   thorpej 			if (anon == NULL)
   3901   1.61   thorpej 				continue;
   3902   1.61   thorpej 
   3903  1.248        ad 			mutex_enter(&anon->an_lock);
   3904  1.192      yamt 			pg = anon->an_page;
   3905   1.63   thorpej 			if (pg == NULL) {
   3906  1.248        ad 				mutex_exit(&anon->an_lock);
   3907   1.63   thorpej 				continue;
   3908   1.63   thorpej 			}
   3909   1.63   thorpej 
   3910   1.61   thorpej 			switch (flags & (PGO_CLEANIT|PGO_FREE|PGO_DEACTIVATE)) {
   3911   1.85       chs 
   3912   1.61   thorpej 			/*
   3913  1.115       chs 			 * In these first 3 cases, we just deactivate the page.
   3914   1.61   thorpej 			 */
   3915   1.85       chs 
   3916   1.61   thorpej 			case PGO_CLEANIT|PGO_FREE:
   3917   1.61   thorpej 			case PGO_CLEANIT|PGO_DEACTIVATE:
   3918   1.61   thorpej 			case PGO_DEACTIVATE:
   3919   1.68   thorpej  deactivate_it:
   3920   1.61   thorpej 				/*
   3921  1.115       chs 				 * skip the page if it's loaned or wired,
   3922  1.115       chs 				 * since it shouldn't be on a paging queue
   3923  1.115       chs 				 * at all in these cases.
   3924   1.61   thorpej 				 */
   3925   1.85       chs 
   3926  1.248        ad 				mutex_enter(&uvm_pageqlock);
   3927  1.115       chs 				if (pg->loan_count != 0 ||
   3928  1.115       chs 				    pg->wire_count != 0) {
   3929  1.248        ad 					mutex_exit(&uvm_pageqlock);
   3930  1.248        ad 					mutex_exit(&anon->an_lock);
   3931   1.61   thorpej 					continue;
   3932   1.61   thorpej 				}
   3933   1.85       chs 				KASSERT(pg->uanon == anon);
   3934   1.61   thorpej 				uvm_pagedeactivate(pg);
   3935  1.248        ad 				mutex_exit(&uvm_pageqlock);
   3936  1.248        ad 				mutex_exit(&anon->an_lock);
   3937   1.61   thorpej 				continue;
   3938   1.61   thorpej 
   3939   1.61   thorpej 			case PGO_FREE:
   3940   1.85       chs 
   3941   1.68   thorpej 				/*
   3942   1.68   thorpej 				 * If there are multiple references to
   3943   1.68   thorpej 				 * the amap, just deactivate the page.
   3944   1.68   thorpej 				 */
   3945   1.85       chs 
   3946   1.68   thorpej 				if (amap_refs(amap) > 1)
   3947   1.68   thorpej 					goto deactivate_it;
   3948   1.68   thorpej 
   3949  1.115       chs 				/* skip the page if it's wired */
   3950   1.62   thorpej 				if (pg->wire_count != 0) {
   3951  1.248        ad 					mutex_exit(&anon->an_lock);
   3952   1.62   thorpej 					continue;
   3953   1.62   thorpej 				}
   3954   1.66   thorpej 				amap_unadd(&current->aref, offset);
   3955   1.61   thorpej 				refs = --anon->an_ref;
   3956  1.248        ad 				mutex_exit(&anon->an_lock);
   3957   1.61   thorpej 				if (refs == 0)
   3958   1.61   thorpej 					uvm_anfree(anon);
   3959   1.61   thorpej 				continue;
   3960   1.61   thorpej 			}
   3961   1.61   thorpej 		}
   3962   1.61   thorpej 		amap_unlock(amap);
   3963    1.1       mrg 
   3964   1.61   thorpej  flush_object:
   3965   1.10       mrg 		/*
   3966   1.33     chuck 		 * flush pages if we've got a valid backing object.
   3967  1.116       chs 		 * note that we must always clean object pages before
   3968  1.116       chs 		 * freeing them since otherwise we could reveal stale
   3969  1.116       chs 		 * data from files.
   3970   1.10       mrg 		 */
   3971    1.1       mrg 
   3972  1.188       dbj 		uoff = current->offset + (start - current->start);
   3973   1.90       chs 		size = MIN(end, current->end) - start;
   3974   1.61   thorpej 		if (uobj != NULL) {
   3975  1.248        ad 			mutex_enter(&uobj->vmobjlock);
   3976  1.136   thorpej 			if (uobj->pgops->pgo_put != NULL)
   3977  1.188       dbj 				error = (uobj->pgops->pgo_put)(uobj, uoff,
   3978  1.188       dbj 				    uoff + size, flags | PGO_CLEANIT);
   3979  1.136   thorpej 			else
   3980  1.136   thorpej 				error = 0;
   3981   1.10       mrg 		}
   3982   1.10       mrg 		start += size;
   3983   1.10       mrg 	}
   3984    1.1       mrg 	vm_map_unlock_read(map);
   3985   1.98       chs 	return (error);
   3986    1.1       mrg }
   3987    1.1       mrg 
   3988    1.1       mrg 
   3989    1.1       mrg /*
   3990    1.1       mrg  * uvm_map_checkprot: check protection in map
   3991    1.1       mrg  *
   3992    1.1       mrg  * => must allow specified protection in a fully allocated region.
   3993    1.1       mrg  * => map must be read or write locked by caller.
   3994    1.1       mrg  */
   3995    1.1       mrg 
   3996  1.233   thorpej bool
   3997  1.138     enami uvm_map_checkprot(struct vm_map *map, vaddr_t start, vaddr_t end,
   3998  1.138     enami     vm_prot_t protection)
   3999   1.10       mrg {
   4000   1.99       chs 	struct vm_map_entry *entry;
   4001   1.99       chs 	struct vm_map_entry *tmp_entry;
   4002   1.10       mrg 
   4003   1.94       chs 	if (!uvm_map_lookup_entry(map, start, &tmp_entry)) {
   4004  1.234   thorpej 		return (false);
   4005   1.94       chs 	}
   4006   1.94       chs 	entry = tmp_entry;
   4007   1.94       chs 	while (start < end) {
   4008   1.94       chs 		if (entry == &map->header) {
   4009  1.234   thorpej 			return (false);
   4010   1.94       chs 		}
   4011   1.85       chs 
   4012   1.10       mrg 		/*
   4013   1.10       mrg 		 * no holes allowed
   4014   1.10       mrg 		 */
   4015   1.10       mrg 
   4016   1.94       chs 		if (start < entry->start) {
   4017  1.234   thorpej 			return (false);
   4018   1.94       chs 		}
   4019   1.10       mrg 
   4020   1.10       mrg 		/*
   4021   1.10       mrg 		 * check protection associated with entry
   4022   1.10       mrg 		 */
   4023    1.1       mrg 
   4024   1.94       chs 		if ((entry->protection & protection) != protection) {
   4025  1.234   thorpej 			return (false);
   4026   1.94       chs 		}
   4027   1.94       chs 		start = entry->end;
   4028   1.94       chs 		entry = entry->next;
   4029   1.94       chs 	}
   4030  1.234   thorpej 	return (true);
   4031    1.1       mrg }
   4032    1.1       mrg 
   4033    1.1       mrg /*
   4034    1.1       mrg  * uvmspace_alloc: allocate a vmspace structure.
   4035    1.1       mrg  *
   4036    1.1       mrg  * - structure includes vm_map and pmap
   4037    1.1       mrg  * - XXX: no locking on this structure
   4038    1.1       mrg  * - refcnt set to 1, rest must be init'd by caller
   4039    1.1       mrg  */
   4040   1.10       mrg struct vmspace *
   4041  1.199  christos uvmspace_alloc(vaddr_t vmin, vaddr_t vmax)
   4042   1.10       mrg {
   4043   1.10       mrg 	struct vmspace *vm;
   4044   1.10       mrg 	UVMHIST_FUNC("uvmspace_alloc"); UVMHIST_CALLED(maphist);
   4045   1.10       mrg 
   4046  1.248        ad 	vm = pool_cache_get(&uvm_vmspace_cache, PR_WAITOK);
   4047  1.199  christos 	uvmspace_init(vm, NULL, vmin, vmax);
   4048   1.15   thorpej 	UVMHIST_LOG(maphist,"<- done (vm=0x%x)", vm,0,0,0);
   4049   1.15   thorpej 	return (vm);
   4050   1.15   thorpej }
   4051   1.15   thorpej 
   4052   1.15   thorpej /*
   4053   1.15   thorpej  * uvmspace_init: initialize a vmspace structure.
   4054   1.15   thorpej  *
   4055   1.15   thorpej  * - XXX: no locking on this structure
   4056  1.132      matt  * - refcnt set to 1, rest must be init'd by caller
   4057   1.15   thorpej  */
   4058   1.15   thorpej void
   4059  1.199  christos uvmspace_init(struct vmspace *vm, struct pmap *pmap, vaddr_t vmin, vaddr_t vmax)
   4060   1.15   thorpej {
   4061   1.15   thorpej 	UVMHIST_FUNC("uvmspace_init"); UVMHIST_CALLED(maphist);
   4062   1.15   thorpej 
   4063   1.23     perry 	memset(vm, 0, sizeof(*vm));
   4064  1.199  christos 	uvm_map_setup(&vm->vm_map, vmin, vmax, VM_MAP_PAGEABLE
   4065  1.131    atatat #ifdef __USING_TOPDOWN_VM
   4066  1.131    atatat 	    | VM_MAP_TOPDOWN
   4067  1.131    atatat #endif
   4068  1.131    atatat 	    );
   4069   1.15   thorpej 	if (pmap)
   4070   1.15   thorpej 		pmap_reference(pmap);
   4071   1.15   thorpej 	else
   4072   1.15   thorpej 		pmap = pmap_create();
   4073   1.15   thorpej 	vm->vm_map.pmap = pmap;
   4074   1.10       mrg 	vm->vm_refcnt = 1;
   4075   1.15   thorpej 	UVMHIST_LOG(maphist,"<- done",0,0,0,0);
   4076    1.1       mrg }
   4077    1.1       mrg 
   4078    1.1       mrg /*
   4079  1.168  junyoung  * uvmspace_share: share a vmspace between two processes
   4080    1.1       mrg  *
   4081    1.1       mrg  * - used for vfork, threads(?)
   4082    1.1       mrg  */
   4083    1.1       mrg 
   4084   1.10       mrg void
   4085  1.138     enami uvmspace_share(struct proc *p1, struct proc *p2)
   4086    1.1       mrg {
   4087  1.139     enami 
   4088  1.215      yamt 	uvmspace_addref(p1->p_vmspace);
   4089   1.10       mrg 	p2->p_vmspace = p1->p_vmspace;
   4090    1.1       mrg }
   4091    1.1       mrg 
   4092    1.1       mrg /*
   4093    1.1       mrg  * uvmspace_unshare: ensure that process "p" has its own, unshared, vmspace
   4094    1.1       mrg  *
   4095    1.1       mrg  * - XXX: no locking on vmspace
   4096    1.1       mrg  */
   4097    1.1       mrg 
   4098   1.10       mrg void
   4099  1.138     enami uvmspace_unshare(struct lwp *l)
   4100   1.10       mrg {
   4101  1.128   thorpej 	struct proc *p = l->l_proc;
   4102   1.10       mrg 	struct vmspace *nvm, *ovm = p->p_vmspace;
   4103   1.85       chs 
   4104   1.10       mrg 	if (ovm->vm_refcnt == 1)
   4105   1.10       mrg 		/* nothing to do: vmspace isn't shared in the first place */
   4106   1.10       mrg 		return;
   4107   1.85       chs 
   4108   1.10       mrg 	/* make a new vmspace, still holding old one */
   4109   1.10       mrg 	nvm = uvmspace_fork(ovm);
   4110   1.10       mrg 
   4111  1.254        ad 	kpreempt_disable();
   4112  1.128   thorpej 	pmap_deactivate(l);		/* unbind old vmspace */
   4113   1.98       chs 	p->p_vmspace = nvm;
   4114  1.128   thorpej 	pmap_activate(l);		/* switch to new vmspace */
   4115  1.254        ad 	kpreempt_enable();
   4116   1.13   thorpej 
   4117   1.10       mrg 	uvmspace_free(ovm);		/* drop reference to old vmspace */
   4118    1.1       mrg }
   4119    1.1       mrg 
   4120    1.1       mrg /*
   4121    1.1       mrg  * uvmspace_exec: the process wants to exec a new program
   4122    1.1       mrg  */
   4123    1.1       mrg 
   4124   1.10       mrg void
   4125  1.138     enami uvmspace_exec(struct lwp *l, vaddr_t start, vaddr_t end)
   4126    1.1       mrg {
   4127  1.128   thorpej 	struct proc *p = l->l_proc;
   4128   1.10       mrg 	struct vmspace *nvm, *ovm = p->p_vmspace;
   4129   1.99       chs 	struct vm_map *map = &ovm->vm_map;
   4130    1.1       mrg 
   4131   1.71       chs #ifdef __sparc__
   4132   1.10       mrg 	/* XXX cgd 960926: the sparc #ifdef should be a MD hook */
   4133  1.128   thorpej 	kill_user_windows(l);   /* before stack addresses go away */
   4134    1.1       mrg #endif
   4135    1.1       mrg 
   4136   1.10       mrg 	/*
   4137   1.10       mrg 	 * see if more than one process is using this vmspace...
   4138   1.10       mrg 	 */
   4139    1.1       mrg 
   4140   1.10       mrg 	if (ovm->vm_refcnt == 1) {
   4141    1.1       mrg 
   4142   1.10       mrg 		/*
   4143   1.10       mrg 		 * if p is the only process using its vmspace then we can safely
   4144   1.10       mrg 		 * recycle that vmspace for the program that is being exec'd.
   4145   1.10       mrg 		 */
   4146    1.1       mrg 
   4147    1.1       mrg #ifdef SYSVSHM
   4148   1.10       mrg 		/*
   4149   1.10       mrg 		 * SYSV SHM semantics require us to kill all segments on an exec
   4150   1.10       mrg 		 */
   4151   1.99       chs 
   4152   1.10       mrg 		if (ovm->vm_shm)
   4153   1.10       mrg 			shmexit(ovm);
   4154   1.10       mrg #endif
   4155   1.54   thorpej 
   4156   1.54   thorpej 		/*
   4157   1.54   thorpej 		 * POSIX 1003.1b -- "lock future mappings" is revoked
   4158   1.54   thorpej 		 * when a process execs another program image.
   4159   1.54   thorpej 		 */
   4160   1.99       chs 
   4161  1.238        ad 		map->flags &= ~VM_MAP_WIREFUTURE;
   4162   1.10       mrg 
   4163   1.10       mrg 		/*
   4164   1.10       mrg 		 * now unmap the old program
   4165   1.10       mrg 		 */
   4166   1.99       chs 
   4167  1.120       chs 		pmap_remove_all(map->pmap);
   4168  1.184       chs 		uvm_unmap(map, vm_map_min(map), vm_map_max(map));
   4169  1.144      yamt 		KASSERT(map->header.prev == &map->header);
   4170  1.144      yamt 		KASSERT(map->nentries == 0);
   4171   1.93       eeh 
   4172   1.93       eeh 		/*
   4173   1.93       eeh 		 * resize the map
   4174   1.93       eeh 		 */
   4175   1.99       chs 
   4176  1.184       chs 		vm_map_setmin(map, start);
   4177  1.184       chs 		vm_map_setmax(map, end);
   4178   1.10       mrg 	} else {
   4179   1.10       mrg 
   4180   1.10       mrg 		/*
   4181   1.10       mrg 		 * p's vmspace is being shared, so we can't reuse it for p since
   4182   1.10       mrg 		 * it is still being used for others.   allocate a new vmspace
   4183   1.10       mrg 		 * for p
   4184   1.10       mrg 		 */
   4185   1.99       chs 
   4186  1.101       chs 		nvm = uvmspace_alloc(start, end);
   4187    1.1       mrg 
   4188   1.10       mrg 		/*
   4189   1.10       mrg 		 * install new vmspace and drop our ref to the old one.
   4190   1.10       mrg 		 */
   4191   1.10       mrg 
   4192  1.254        ad 		kpreempt_disable();
   4193  1.128   thorpej 		pmap_deactivate(l);
   4194   1.10       mrg 		p->p_vmspace = nvm;
   4195  1.128   thorpej 		pmap_activate(l);
   4196  1.254        ad 		kpreempt_enable();
   4197   1.13   thorpej 
   4198   1.10       mrg 		uvmspace_free(ovm);
   4199   1.10       mrg 	}
   4200    1.1       mrg }
   4201    1.1       mrg 
   4202    1.1       mrg /*
   4203  1.215      yamt  * uvmspace_addref: add a referece to a vmspace.
   4204  1.215      yamt  */
   4205  1.215      yamt 
   4206  1.215      yamt void
   4207  1.215      yamt uvmspace_addref(struct vmspace *vm)
   4208  1.215      yamt {
   4209  1.215      yamt 	struct vm_map *map = &vm->vm_map;
   4210  1.215      yamt 
   4211  1.215      yamt 	KASSERT((map->flags & VM_MAP_DYING) == 0);
   4212  1.215      yamt 
   4213  1.238        ad 	mutex_enter(&map->misc_lock);
   4214  1.215      yamt 	KASSERT(vm->vm_refcnt > 0);
   4215  1.215      yamt 	vm->vm_refcnt++;
   4216  1.238        ad 	mutex_exit(&map->misc_lock);
   4217  1.215      yamt }
   4218  1.215      yamt 
   4219  1.215      yamt /*
   4220    1.1       mrg  * uvmspace_free: free a vmspace data structure
   4221    1.1       mrg  */
   4222    1.1       mrg 
   4223   1.10       mrg void
   4224  1.138     enami uvmspace_free(struct vmspace *vm)
   4225    1.1       mrg {
   4226   1.99       chs 	struct vm_map_entry *dead_entries;
   4227  1.171        pk 	struct vm_map *map = &vm->vm_map;
   4228  1.172        he 	int n;
   4229  1.172        he 
   4230   1.10       mrg 	UVMHIST_FUNC("uvmspace_free"); UVMHIST_CALLED(maphist);
   4231    1.1       mrg 
   4232   1.10       mrg 	UVMHIST_LOG(maphist,"(vm=0x%x) ref=%d", vm, vm->vm_refcnt,0,0);
   4233  1.238        ad 	mutex_enter(&map->misc_lock);
   4234  1.172        he 	n = --vm->vm_refcnt;
   4235  1.238        ad 	mutex_exit(&map->misc_lock);
   4236  1.171        pk 	if (n > 0)
   4237  1.120       chs 		return;
   4238   1.99       chs 
   4239  1.120       chs 	/*
   4240  1.120       chs 	 * at this point, there should be no other references to the map.
   4241  1.120       chs 	 * delete all of the mappings, then destroy the pmap.
   4242  1.120       chs 	 */
   4243   1.99       chs 
   4244  1.120       chs 	map->flags |= VM_MAP_DYING;
   4245  1.120       chs 	pmap_remove_all(map->pmap);
   4246   1.92   thorpej #ifdef SYSVSHM
   4247  1.120       chs 	/* Get rid of any SYSV shared memory segments. */
   4248  1.120       chs 	if (vm->vm_shm != NULL)
   4249  1.120       chs 		shmexit(vm);
   4250   1.92   thorpej #endif
   4251  1.120       chs 	if (map->nentries) {
   4252  1.184       chs 		uvm_unmap_remove(map, vm_map_min(map), vm_map_max(map),
   4253  1.187      yamt 		    &dead_entries, NULL, 0);
   4254  1.120       chs 		if (dead_entries != NULL)
   4255  1.120       chs 			uvm_unmap_detach(dead_entries, 0);
   4256   1.10       mrg 	}
   4257  1.146      yamt 	KASSERT(map->nentries == 0);
   4258  1.146      yamt 	KASSERT(map->size == 0);
   4259  1.239        ad 	mutex_destroy(&map->misc_lock);
   4260  1.239        ad 	mutex_destroy(&map->mutex);
   4261  1.239        ad 	rw_destroy(&map->lock);
   4262  1.255        ad 	cv_destroy(&map->cv);
   4263  1.120       chs 	pmap_destroy(map->pmap);
   4264  1.248        ad 	pool_cache_put(&uvm_vmspace_cache, vm);
   4265    1.1       mrg }
   4266    1.1       mrg 
   4267    1.1       mrg /*
   4268    1.1       mrg  *   F O R K   -   m a i n   e n t r y   p o i n t
   4269    1.1       mrg  */
   4270    1.1       mrg /*
   4271    1.1       mrg  * uvmspace_fork: fork a process' main map
   4272    1.1       mrg  *
   4273    1.1       mrg  * => create a new vmspace for child process from parent.
   4274    1.1       mrg  * => parent's map must not be locked.
   4275    1.1       mrg  */
   4276    1.1       mrg 
   4277   1.10       mrg struct vmspace *
   4278  1.138     enami uvmspace_fork(struct vmspace *vm1)
   4279   1.10       mrg {
   4280   1.10       mrg 	struct vmspace *vm2;
   4281   1.99       chs 	struct vm_map *old_map = &vm1->vm_map;
   4282   1.99       chs 	struct vm_map *new_map;
   4283   1.99       chs 	struct vm_map_entry *old_entry;
   4284   1.99       chs 	struct vm_map_entry *new_entry;
   4285   1.10       mrg 	UVMHIST_FUNC("uvmspace_fork"); UVMHIST_CALLED(maphist);
   4286    1.1       mrg 
   4287   1.10       mrg 	vm_map_lock(old_map);
   4288    1.1       mrg 
   4289  1.184       chs 	vm2 = uvmspace_alloc(vm_map_min(old_map), vm_map_max(old_map));
   4290   1.23     perry 	memcpy(&vm2->vm_startcopy, &vm1->vm_startcopy,
   4291  1.235  christos 	    (char *) (vm1 + 1) - (char *) &vm1->vm_startcopy);
   4292   1.10       mrg 	new_map = &vm2->vm_map;		  /* XXX */
   4293   1.10       mrg 
   4294   1.10       mrg 	old_entry = old_map->header.next;
   4295  1.162     pooka 	new_map->size = old_map->size;
   4296   1.10       mrg 
   4297   1.10       mrg 	/*
   4298   1.10       mrg 	 * go entry-by-entry
   4299   1.10       mrg 	 */
   4300    1.1       mrg 
   4301   1.10       mrg 	while (old_entry != &old_map->header) {
   4302    1.1       mrg 
   4303   1.10       mrg 		/*
   4304   1.10       mrg 		 * first, some sanity checks on the old entry
   4305   1.10       mrg 		 */
   4306   1.99       chs 
   4307   1.94       chs 		KASSERT(!UVM_ET_ISSUBMAP(old_entry));
   4308   1.94       chs 		KASSERT(UVM_ET_ISCOPYONWRITE(old_entry) ||
   4309   1.94       chs 			!UVM_ET_ISNEEDSCOPY(old_entry));
   4310    1.1       mrg 
   4311   1.10       mrg 		switch (old_entry->inheritance) {
   4312   1.80       wiz 		case MAP_INHERIT_NONE:
   4313   1.99       chs 
   4314   1.10       mrg 			/*
   4315  1.162     pooka 			 * drop the mapping, modify size
   4316   1.10       mrg 			 */
   4317  1.162     pooka 			new_map->size -= old_entry->end - old_entry->start;
   4318   1.10       mrg 			break;
   4319   1.10       mrg 
   4320   1.80       wiz 		case MAP_INHERIT_SHARE:
   4321   1.99       chs 
   4322   1.10       mrg 			/*
   4323   1.10       mrg 			 * share the mapping: this means we want the old and
   4324   1.10       mrg 			 * new entries to share amaps and backing objects.
   4325   1.10       mrg 			 */
   4326   1.10       mrg 			/*
   4327   1.10       mrg 			 * if the old_entry needs a new amap (due to prev fork)
   4328   1.10       mrg 			 * then we need to allocate it now so that we have
   4329   1.10       mrg 			 * something we own to share with the new_entry.   [in
   4330   1.10       mrg 			 * other words, we need to clear needs_copy]
   4331   1.10       mrg 			 */
   4332   1.10       mrg 
   4333   1.10       mrg 			if (UVM_ET_ISNEEDSCOPY(old_entry)) {
   4334   1.10       mrg 				/* get our own amap, clears needs_copy */
   4335  1.212      yamt 				amap_copy(old_map, old_entry, AMAP_COPY_NOCHUNK,
   4336   1.98       chs 				    0, 0);
   4337   1.10       mrg 				/* XXXCDC: WAITOK??? */
   4338   1.10       mrg 			}
   4339   1.10       mrg 
   4340  1.126    bouyer 			new_entry = uvm_mapent_alloc(new_map, 0);
   4341   1.10       mrg 			/* old_entry -> new_entry */
   4342   1.10       mrg 			uvm_mapent_copy(old_entry, new_entry);
   4343   1.10       mrg 
   4344   1.10       mrg 			/* new pmap has nothing wired in it */
   4345   1.10       mrg 			new_entry->wired_count = 0;
   4346   1.10       mrg 
   4347   1.10       mrg 			/*
   4348   1.29     chuck 			 * gain reference to object backing the map (can't
   4349   1.29     chuck 			 * be a submap, already checked this case).
   4350   1.10       mrg 			 */
   4351   1.99       chs 
   4352   1.10       mrg 			if (new_entry->aref.ar_amap)
   4353   1.85       chs 				uvm_map_reference_amap(new_entry, AMAP_SHARED);
   4354   1.10       mrg 
   4355   1.10       mrg 			if (new_entry->object.uvm_obj &&
   4356   1.10       mrg 			    new_entry->object.uvm_obj->pgops->pgo_reference)
   4357   1.10       mrg 				new_entry->object.uvm_obj->
   4358   1.10       mrg 				    pgops->pgo_reference(
   4359   1.10       mrg 				        new_entry->object.uvm_obj);
   4360   1.10       mrg 
   4361   1.10       mrg 			/* insert entry at end of new_map's entry list */
   4362   1.10       mrg 			uvm_map_entry_link(new_map, new_map->header.prev,
   4363   1.10       mrg 			    new_entry);
   4364   1.10       mrg 
   4365   1.10       mrg 			break;
   4366   1.10       mrg 
   4367   1.80       wiz 		case MAP_INHERIT_COPY:
   4368   1.10       mrg 
   4369   1.10       mrg 			/*
   4370   1.10       mrg 			 * copy-on-write the mapping (using mmap's
   4371   1.10       mrg 			 * MAP_PRIVATE semantics)
   4372   1.29     chuck 			 *
   4373   1.98       chs 			 * allocate new_entry, adjust reference counts.
   4374   1.29     chuck 			 * (note that new references are read-only).
   4375   1.10       mrg 			 */
   4376   1.10       mrg 
   4377  1.126    bouyer 			new_entry = uvm_mapent_alloc(new_map, 0);
   4378   1.10       mrg 			/* old_entry -> new_entry */
   4379   1.10       mrg 			uvm_mapent_copy(old_entry, new_entry);
   4380   1.10       mrg 
   4381   1.10       mrg 			if (new_entry->aref.ar_amap)
   4382   1.85       chs 				uvm_map_reference_amap(new_entry, 0);
   4383   1.10       mrg 
   4384   1.10       mrg 			if (new_entry->object.uvm_obj &&
   4385   1.10       mrg 			    new_entry->object.uvm_obj->pgops->pgo_reference)
   4386   1.10       mrg 				new_entry->object.uvm_obj->pgops->pgo_reference
   4387   1.10       mrg 				    (new_entry->object.uvm_obj);
   4388   1.10       mrg 
   4389   1.10       mrg 			/* new pmap has nothing wired in it */
   4390   1.10       mrg 			new_entry->wired_count = 0;
   4391   1.10       mrg 
   4392   1.10       mrg 			new_entry->etype |=
   4393   1.10       mrg 			    (UVM_ET_COPYONWRITE|UVM_ET_NEEDSCOPY);
   4394   1.10       mrg 			uvm_map_entry_link(new_map, new_map->header.prev,
   4395   1.10       mrg 			    new_entry);
   4396   1.85       chs 
   4397   1.14     chuck 			/*
   4398   1.10       mrg 			 * the new entry will need an amap.  it will either
   4399   1.10       mrg 			 * need to be copied from the old entry or created
   4400   1.14     chuck 			 * from scratch (if the old entry does not have an
   4401   1.14     chuck 			 * amap).  can we defer this process until later
   4402   1.14     chuck 			 * (by setting "needs_copy") or do we need to copy
   4403   1.14     chuck 			 * the amap now?
   4404   1.10       mrg 			 *
   4405   1.14     chuck 			 * we must copy the amap now if any of the following
   4406   1.10       mrg 			 * conditions hold:
   4407   1.14     chuck 			 * 1. the old entry has an amap and that amap is
   4408   1.14     chuck 			 *    being shared.  this means that the old (parent)
   4409   1.98       chs 			 *    process is sharing the amap with another
   4410   1.14     chuck 			 *    process.  if we do not clear needs_copy here
   4411   1.14     chuck 			 *    we will end up in a situation where both the
   4412   1.14     chuck 			 *    parent and child process are refering to the
   4413   1.98       chs 			 *    same amap with "needs_copy" set.  if the
   4414   1.14     chuck 			 *    parent write-faults, the fault routine will
   4415   1.14     chuck 			 *    clear "needs_copy" in the parent by allocating
   4416   1.98       chs 			 *    a new amap.   this is wrong because the
   4417   1.14     chuck 			 *    parent is supposed to be sharing the old amap
   4418   1.14     chuck 			 *    and the new amap will break that.
   4419   1.10       mrg 			 *
   4420   1.14     chuck 			 * 2. if the old entry has an amap and a non-zero
   4421   1.14     chuck 			 *    wire count then we are going to have to call
   4422   1.98       chs 			 *    amap_cow_now to avoid page faults in the
   4423   1.14     chuck 			 *    parent process.   since amap_cow_now requires
   4424   1.14     chuck 			 *    "needs_copy" to be clear we might as well
   4425   1.14     chuck 			 *    clear it here as well.
   4426   1.10       mrg 			 *
   4427   1.10       mrg 			 */
   4428   1.10       mrg 
   4429   1.14     chuck 			if (old_entry->aref.ar_amap != NULL) {
   4430   1.99       chs 				if ((amap_flags(old_entry->aref.ar_amap) &
   4431   1.99       chs 				     AMAP_SHARED) != 0 ||
   4432   1.99       chs 				    VM_MAPENT_ISWIRED(old_entry)) {
   4433   1.99       chs 
   4434  1.212      yamt 					amap_copy(new_map, new_entry,
   4435  1.212      yamt 					    AMAP_COPY_NOCHUNK, 0, 0);
   4436   1.99       chs 					/* XXXCDC: M_WAITOK ... ok? */
   4437   1.99       chs 				}
   4438   1.10       mrg 			}
   4439   1.85       chs 
   4440   1.10       mrg 			/*
   4441   1.14     chuck 			 * if the parent's entry is wired down, then the
   4442   1.14     chuck 			 * parent process does not want page faults on
   4443   1.14     chuck 			 * access to that memory.  this means that we
   4444   1.14     chuck 			 * cannot do copy-on-write because we can't write
   4445   1.14     chuck 			 * protect the old entry.   in this case we
   4446   1.14     chuck 			 * resolve all copy-on-write faults now, using
   4447   1.14     chuck 			 * amap_cow_now.   note that we have already
   4448   1.14     chuck 			 * allocated any needed amap (above).
   4449   1.10       mrg 			 */
   4450   1.10       mrg 
   4451   1.55   thorpej 			if (VM_MAPENT_ISWIRED(old_entry)) {
   4452    1.1       mrg 
   4453   1.98       chs 			  /*
   4454   1.14     chuck 			   * resolve all copy-on-write faults now
   4455   1.98       chs 			   * (note that there is nothing to do if
   4456   1.14     chuck 			   * the old mapping does not have an amap).
   4457   1.14     chuck 			   */
   4458   1.14     chuck 			  if (old_entry->aref.ar_amap)
   4459   1.14     chuck 			    amap_cow_now(new_map, new_entry);
   4460   1.14     chuck 
   4461   1.98       chs 			} else {
   4462   1.14     chuck 
   4463   1.14     chuck 			  /*
   4464   1.14     chuck 			   * setup mappings to trigger copy-on-write faults
   4465   1.14     chuck 			   * we must write-protect the parent if it has
   4466   1.14     chuck 			   * an amap and it is not already "needs_copy"...
   4467   1.14     chuck 			   * if it is already "needs_copy" then the parent
   4468   1.14     chuck 			   * has already been write-protected by a previous
   4469   1.14     chuck 			   * fork operation.
   4470   1.14     chuck 			   */
   4471   1.14     chuck 
   4472  1.113       chs 			  if (old_entry->aref.ar_amap &&
   4473  1.113       chs 			      !UVM_ET_ISNEEDSCOPY(old_entry)) {
   4474   1.14     chuck 			      if (old_entry->max_protection & VM_PROT_WRITE) {
   4475   1.14     chuck 				pmap_protect(old_map->pmap,
   4476   1.14     chuck 					     old_entry->start,
   4477   1.14     chuck 					     old_entry->end,
   4478   1.14     chuck 					     old_entry->protection &
   4479   1.14     chuck 					     ~VM_PROT_WRITE);
   4480   1.14     chuck 			      }
   4481   1.14     chuck 			      old_entry->etype |= UVM_ET_NEEDSCOPY;
   4482   1.14     chuck 			  }
   4483   1.10       mrg 			}
   4484   1.10       mrg 			break;
   4485   1.14     chuck 		}  /* end of switch statement */
   4486   1.10       mrg 		old_entry = old_entry->next;
   4487    1.1       mrg 	}
   4488    1.1       mrg 
   4489  1.268        ad 	pmap_update(old_map->pmap);
   4490   1.98       chs 	vm_map_unlock(old_map);
   4491    1.1       mrg 
   4492    1.1       mrg #ifdef SYSVSHM
   4493   1.10       mrg 	if (vm1->vm_shm)
   4494   1.10       mrg 		shmfork(vm1, vm2);
   4495   1.39   thorpej #endif
   4496   1.39   thorpej 
   4497   1.39   thorpej #ifdef PMAP_FORK
   4498   1.39   thorpej 	pmap_fork(vm1->vm_map.pmap, vm2->vm_map.pmap);
   4499    1.1       mrg #endif
   4500    1.1       mrg 
   4501   1.10       mrg 	UVMHIST_LOG(maphist,"<- done",0,0,0,0);
   4502  1.139     enami 	return (vm2);
   4503    1.1       mrg }
   4504    1.1       mrg 
   4505    1.1       mrg 
   4506  1.174      yamt /*
   4507  1.174      yamt  * in-kernel map entry allocation.
   4508  1.174      yamt  */
   4509  1.174      yamt 
   4510  1.174      yamt struct uvm_kmapent_hdr {
   4511  1.174      yamt 	LIST_ENTRY(uvm_kmapent_hdr) ukh_listq;
   4512  1.174      yamt 	int ukh_nused;
   4513  1.174      yamt 	struct vm_map_entry *ukh_freelist;
   4514  1.174      yamt 	struct vm_map *ukh_map;
   4515  1.178      yamt 	struct vm_map_entry ukh_entries[0];
   4516  1.174      yamt };
   4517  1.174      yamt 
   4518  1.174      yamt #define	UVM_KMAPENT_CHUNK				\
   4519  1.174      yamt 	((PAGE_SIZE - sizeof(struct uvm_kmapent_hdr))	\
   4520  1.174      yamt 	/ sizeof(struct vm_map_entry))
   4521  1.174      yamt 
   4522  1.174      yamt #define	UVM_KHDR_FIND(entry)	\
   4523  1.174      yamt 	((struct uvm_kmapent_hdr *)(((vaddr_t)entry) & ~PAGE_MASK))
   4524  1.174      yamt 
   4525  1.174      yamt 
   4526  1.201       dsl #ifdef DIAGNOSTIC
   4527  1.203   thorpej static struct vm_map *
   4528  1.174      yamt uvm_kmapent_map(struct vm_map_entry *entry)
   4529  1.174      yamt {
   4530  1.174      yamt 	const struct uvm_kmapent_hdr *ukh;
   4531  1.174      yamt 
   4532  1.174      yamt 	ukh = UVM_KHDR_FIND(entry);
   4533  1.174      yamt 	return ukh->ukh_map;
   4534  1.174      yamt }
   4535  1.201       dsl #endif
   4536  1.174      yamt 
   4537  1.206     perry static inline struct vm_map_entry *
   4538  1.174      yamt uvm_kmapent_get(struct uvm_kmapent_hdr *ukh)
   4539  1.174      yamt {
   4540  1.174      yamt 	struct vm_map_entry *entry;
   4541  1.174      yamt 
   4542  1.174      yamt 	KASSERT(ukh->ukh_nused <= UVM_KMAPENT_CHUNK);
   4543  1.174      yamt 	KASSERT(ukh->ukh_nused >= 0);
   4544  1.174      yamt 
   4545  1.174      yamt 	entry = ukh->ukh_freelist;
   4546  1.174      yamt 	if (entry) {
   4547  1.174      yamt 		KASSERT((entry->flags & (UVM_MAP_KERNEL | UVM_MAP_KMAPENT))
   4548  1.174      yamt 		    == UVM_MAP_KERNEL);
   4549  1.174      yamt 		ukh->ukh_freelist = entry->next;
   4550  1.174      yamt 		ukh->ukh_nused++;
   4551  1.174      yamt 		KASSERT(ukh->ukh_nused <= UVM_KMAPENT_CHUNK);
   4552  1.174      yamt 	} else {
   4553  1.174      yamt 		KASSERT(ukh->ukh_nused == UVM_KMAPENT_CHUNK);
   4554  1.174      yamt 	}
   4555  1.174      yamt 
   4556  1.174      yamt 	return entry;
   4557  1.174      yamt }
   4558  1.174      yamt 
   4559  1.206     perry static inline void
   4560  1.174      yamt uvm_kmapent_put(struct uvm_kmapent_hdr *ukh, struct vm_map_entry *entry)
   4561  1.174      yamt {
   4562  1.174      yamt 
   4563  1.174      yamt 	KASSERT((entry->flags & (UVM_MAP_KERNEL | UVM_MAP_KMAPENT))
   4564  1.174      yamt 	    == UVM_MAP_KERNEL);
   4565  1.174      yamt 	KASSERT(ukh->ukh_nused <= UVM_KMAPENT_CHUNK);
   4566  1.174      yamt 	KASSERT(ukh->ukh_nused > 0);
   4567  1.174      yamt 	KASSERT(ukh->ukh_freelist != NULL ||
   4568  1.174      yamt 	    ukh->ukh_nused == UVM_KMAPENT_CHUNK);
   4569  1.174      yamt 	KASSERT(ukh->ukh_freelist == NULL ||
   4570  1.174      yamt 	    ukh->ukh_nused < UVM_KMAPENT_CHUNK);
   4571  1.174      yamt 
   4572  1.174      yamt 	ukh->ukh_nused--;
   4573  1.174      yamt 	entry->next = ukh->ukh_freelist;
   4574  1.174      yamt 	ukh->ukh_freelist = entry;
   4575  1.174      yamt }
   4576  1.174      yamt 
   4577  1.174      yamt /*
   4578  1.174      yamt  * uvm_kmapent_alloc: allocate a map entry for in-kernel map
   4579  1.174      yamt  */
   4580  1.174      yamt 
   4581  1.174      yamt static struct vm_map_entry *
   4582  1.174      yamt uvm_kmapent_alloc(struct vm_map *map, int flags)
   4583  1.174      yamt {
   4584  1.174      yamt 	struct vm_page *pg;
   4585  1.174      yamt 	struct uvm_map_args args;
   4586  1.174      yamt 	struct uvm_kmapent_hdr *ukh;
   4587  1.174      yamt 	struct vm_map_entry *entry;
   4588  1.174      yamt 	uvm_flag_t mapflags = UVM_MAPFLAG(UVM_PROT_ALL, UVM_PROT_ALL,
   4589  1.174      yamt 	    UVM_INH_NONE, UVM_ADV_RANDOM, flags | UVM_FLAG_NOMERGE);
   4590  1.174      yamt 	vaddr_t va;
   4591  1.174      yamt 	int error;
   4592  1.174      yamt 	int i;
   4593  1.174      yamt 
   4594  1.174      yamt 	KDASSERT(UVM_KMAPENT_CHUNK > 2);
   4595  1.174      yamt 	KDASSERT(kernel_map != NULL);
   4596  1.174      yamt 	KASSERT(vm_map_pmap(map) == pmap_kernel());
   4597  1.174      yamt 
   4598  1.208      yamt 	UVMMAP_EVCNT_INCR(uke_alloc);
   4599  1.174      yamt 	entry = NULL;
   4600  1.174      yamt again:
   4601  1.174      yamt 	/*
   4602  1.174      yamt 	 * try to grab an entry from freelist.
   4603  1.174      yamt 	 */
   4604  1.238        ad 	mutex_spin_enter(&uvm_kentry_lock);
   4605  1.175      yamt 	ukh = LIST_FIRST(&vm_map_to_kernel(map)->vmk_kentry_free);
   4606  1.174      yamt 	if (ukh) {
   4607  1.174      yamt 		entry = uvm_kmapent_get(ukh);
   4608  1.174      yamt 		if (ukh->ukh_nused == UVM_KMAPENT_CHUNK)
   4609  1.174      yamt 			LIST_REMOVE(ukh, ukh_listq);
   4610  1.174      yamt 	}
   4611  1.238        ad 	mutex_spin_exit(&uvm_kentry_lock);
   4612  1.174      yamt 
   4613  1.174      yamt 	if (entry)
   4614  1.174      yamt 		return entry;
   4615  1.174      yamt 
   4616  1.174      yamt 	/*
   4617  1.174      yamt 	 * there's no free entry for this vm_map.
   4618  1.174      yamt 	 * now we need to allocate some vm_map_entry.
   4619  1.174      yamt 	 * for simplicity, always allocate one page chunk of them at once.
   4620  1.174      yamt 	 */
   4621  1.174      yamt 
   4622  1.265        ad 	pg = uvm_pagealloc(NULL, 0, NULL,
   4623  1.265        ad 	    (flags & UVM_KMF_NOWAIT) != 0 ? UVM_PGA_USERESERVE : 0);
   4624  1.174      yamt 	if (__predict_false(pg == NULL)) {
   4625  1.174      yamt 		if (flags & UVM_FLAG_NOWAIT)
   4626  1.174      yamt 			return NULL;
   4627  1.174      yamt 		uvm_wait("kme_alloc");
   4628  1.174      yamt 		goto again;
   4629  1.174      yamt 	}
   4630  1.174      yamt 
   4631  1.242     skrll 	error = uvm_map_prepare(map, 0, PAGE_SIZE, NULL, UVM_UNKNOWN_OFFSET,
   4632  1.242     skrll 	    0, mapflags, &args);
   4633  1.174      yamt 	if (error) {
   4634  1.174      yamt 		uvm_pagefree(pg);
   4635  1.174      yamt 		return NULL;
   4636  1.174      yamt 	}
   4637  1.174      yamt 
   4638  1.174      yamt 	va = args.uma_start;
   4639  1.174      yamt 
   4640  1.262      matt 	pmap_kenter_pa(va, VM_PAGE_TO_PHYS(pg),
   4641  1.262      matt 	    VM_PROT_READ|VM_PROT_WRITE|PMAP_KMPAGE);
   4642  1.174      yamt 	pmap_update(vm_map_pmap(map));
   4643  1.174      yamt 
   4644  1.174      yamt 	ukh = (void *)va;
   4645  1.174      yamt 
   4646  1.174      yamt 	/*
   4647  1.174      yamt 	 * use the first entry for ukh itsself.
   4648  1.174      yamt 	 */
   4649  1.174      yamt 
   4650  1.174      yamt 	entry = &ukh->ukh_entries[0];
   4651  1.174      yamt 	entry->flags = UVM_MAP_KERNEL | UVM_MAP_KMAPENT;
   4652  1.174      yamt 	error = uvm_map_enter(map, &args, entry);
   4653  1.174      yamt 	KASSERT(error == 0);
   4654  1.174      yamt 
   4655  1.174      yamt 	ukh->ukh_nused = UVM_KMAPENT_CHUNK;
   4656  1.174      yamt 	ukh->ukh_map = map;
   4657  1.174      yamt 	ukh->ukh_freelist = NULL;
   4658  1.174      yamt 	for (i = UVM_KMAPENT_CHUNK - 1; i >= 2; i--) {
   4659  1.199  christos 		struct vm_map_entry *xentry = &ukh->ukh_entries[i];
   4660  1.174      yamt 
   4661  1.199  christos 		xentry->flags = UVM_MAP_KERNEL;
   4662  1.199  christos 		uvm_kmapent_put(ukh, xentry);
   4663  1.174      yamt 	}
   4664  1.174      yamt 	KASSERT(ukh->ukh_nused == 2);
   4665  1.174      yamt 
   4666  1.238        ad 	mutex_spin_enter(&uvm_kentry_lock);
   4667  1.175      yamt 	LIST_INSERT_HEAD(&vm_map_to_kernel(map)->vmk_kentry_free,
   4668  1.175      yamt 	    ukh, ukh_listq);
   4669  1.238        ad 	mutex_spin_exit(&uvm_kentry_lock);
   4670  1.174      yamt 
   4671  1.174      yamt 	/*
   4672  1.174      yamt 	 * return second entry.
   4673  1.174      yamt 	 */
   4674  1.174      yamt 
   4675  1.174      yamt 	entry = &ukh->ukh_entries[1];
   4676  1.174      yamt 	entry->flags = UVM_MAP_KERNEL;
   4677  1.208      yamt 	UVMMAP_EVCNT_INCR(ukh_alloc);
   4678  1.174      yamt 	return entry;
   4679  1.174      yamt }
   4680  1.174      yamt 
   4681  1.174      yamt /*
   4682  1.174      yamt  * uvm_mapent_free: free map entry for in-kernel map
   4683  1.174      yamt  */
   4684  1.174      yamt 
   4685  1.174      yamt static void
   4686  1.174      yamt uvm_kmapent_free(struct vm_map_entry *entry)
   4687  1.174      yamt {
   4688  1.174      yamt 	struct uvm_kmapent_hdr *ukh;
   4689  1.174      yamt 	struct vm_page *pg;
   4690  1.174      yamt 	struct vm_map *map;
   4691  1.174      yamt 	struct pmap *pmap;
   4692  1.174      yamt 	vaddr_t va;
   4693  1.174      yamt 	paddr_t pa;
   4694  1.174      yamt 	struct vm_map_entry *deadentry;
   4695  1.174      yamt 
   4696  1.208      yamt 	UVMMAP_EVCNT_INCR(uke_free);
   4697  1.174      yamt 	ukh = UVM_KHDR_FIND(entry);
   4698  1.174      yamt 	map = ukh->ukh_map;
   4699  1.174      yamt 
   4700  1.238        ad 	mutex_spin_enter(&uvm_kentry_lock);
   4701  1.174      yamt 	uvm_kmapent_put(ukh, entry);
   4702  1.174      yamt 	if (ukh->ukh_nused > 1) {
   4703  1.174      yamt 		if (ukh->ukh_nused == UVM_KMAPENT_CHUNK - 1)
   4704  1.175      yamt 			LIST_INSERT_HEAD(
   4705  1.175      yamt 			    &vm_map_to_kernel(map)->vmk_kentry_free,
   4706  1.175      yamt 			    ukh, ukh_listq);
   4707  1.238        ad 		mutex_spin_exit(&uvm_kentry_lock);
   4708  1.174      yamt 		return;
   4709  1.174      yamt 	}
   4710  1.174      yamt 
   4711  1.174      yamt 	/*
   4712  1.174      yamt 	 * now we can free this ukh.
   4713  1.174      yamt 	 *
   4714  1.174      yamt 	 * however, keep an empty ukh to avoid ping-pong.
   4715  1.174      yamt 	 */
   4716  1.174      yamt 
   4717  1.175      yamt 	if (LIST_FIRST(&vm_map_to_kernel(map)->vmk_kentry_free) == ukh &&
   4718  1.174      yamt 	    LIST_NEXT(ukh, ukh_listq) == NULL) {
   4719  1.238        ad 		mutex_spin_exit(&uvm_kentry_lock);
   4720  1.174      yamt 		return;
   4721  1.174      yamt 	}
   4722  1.174      yamt 	LIST_REMOVE(ukh, ukh_listq);
   4723  1.238        ad 	mutex_spin_exit(&uvm_kentry_lock);
   4724  1.174      yamt 
   4725  1.174      yamt 	KASSERT(ukh->ukh_nused == 1);
   4726  1.174      yamt 
   4727  1.174      yamt 	/*
   4728  1.174      yamt 	 * remove map entry for ukh itsself.
   4729  1.174      yamt 	 */
   4730  1.174      yamt 
   4731  1.174      yamt 	va = (vaddr_t)ukh;
   4732  1.174      yamt 	KASSERT((va & PAGE_MASK) == 0);
   4733  1.198      yamt 	vm_map_lock(map);
   4734  1.187      yamt 	uvm_unmap_remove(map, va, va + PAGE_SIZE, &deadentry, NULL, 0);
   4735  1.174      yamt 	KASSERT(deadentry->flags & UVM_MAP_KERNEL);
   4736  1.174      yamt 	KASSERT(deadentry->flags & UVM_MAP_KMAPENT);
   4737  1.174      yamt 	KASSERT(deadentry->next == NULL);
   4738  1.174      yamt 	KASSERT(deadentry == &ukh->ukh_entries[0]);
   4739  1.174      yamt 
   4740  1.174      yamt 	/*
   4741  1.174      yamt 	 * unmap the page from pmap and free it.
   4742  1.174      yamt 	 */
   4743  1.174      yamt 
   4744  1.174      yamt 	pmap = vm_map_pmap(map);
   4745  1.174      yamt 	KASSERT(pmap == pmap_kernel());
   4746  1.174      yamt 	if (!pmap_extract(pmap, va, &pa))
   4747  1.174      yamt 		panic("%s: no mapping", __func__);
   4748  1.174      yamt 	pmap_kremove(va, PAGE_SIZE);
   4749  1.251     chris 	pmap_update(vm_map_pmap(map));
   4750  1.198      yamt 	vm_map_unlock(map);
   4751  1.174      yamt 	pg = PHYS_TO_VM_PAGE(pa);
   4752  1.174      yamt 	uvm_pagefree(pg);
   4753  1.208      yamt 	UVMMAP_EVCNT_INCR(ukh_free);
   4754  1.174      yamt }
   4755  1.174      yamt 
   4756  1.219      yamt static vsize_t
   4757  1.219      yamt uvm_kmapent_overhead(vsize_t size)
   4758  1.219      yamt {
   4759  1.219      yamt 
   4760  1.219      yamt 	/*
   4761  1.219      yamt 	 * - the max number of unmerged entries is howmany(size, PAGE_SIZE)
   4762  1.219      yamt 	 *   as the min allocation unit is PAGE_SIZE.
   4763  1.219      yamt 	 * - UVM_KMAPENT_CHUNK "kmapent"s are allocated from a page.
   4764  1.219      yamt 	 *   one of them are used to map the page itself.
   4765  1.219      yamt 	 */
   4766  1.219      yamt 
   4767  1.219      yamt 	return howmany(howmany(size, PAGE_SIZE), (UVM_KMAPENT_CHUNK - 1)) *
   4768  1.219      yamt 	    PAGE_SIZE;
   4769  1.219      yamt }
   4770  1.219      yamt 
   4771  1.174      yamt /*
   4772  1.174      yamt  * map entry reservation
   4773  1.174      yamt  */
   4774  1.174      yamt 
   4775  1.174      yamt /*
   4776  1.174      yamt  * uvm_mapent_reserve: reserve map entries for clipping before locking map.
   4777  1.174      yamt  *
   4778  1.174      yamt  * => needed when unmapping entries allocated without UVM_FLAG_QUANTUM.
   4779  1.174      yamt  * => caller shouldn't hold map locked.
   4780  1.174      yamt  */
   4781  1.174      yamt int
   4782  1.174      yamt uvm_mapent_reserve(struct vm_map *map, struct uvm_mapent_reservation *umr,
   4783  1.174      yamt     int nentries, int flags)
   4784  1.174      yamt {
   4785  1.174      yamt 
   4786  1.174      yamt 	umr->umr_nentries = 0;
   4787  1.174      yamt 
   4788  1.179      yamt 	if ((flags & UVM_FLAG_QUANTUM) != 0)
   4789  1.179      yamt 		return 0;
   4790  1.179      yamt 
   4791  1.174      yamt 	if (!VM_MAP_USE_KMAPENT(map))
   4792  1.174      yamt 		return 0;
   4793  1.174      yamt 
   4794  1.174      yamt 	while (nentries--) {
   4795  1.174      yamt 		struct vm_map_entry *ent;
   4796  1.174      yamt 		ent = uvm_kmapent_alloc(map, flags);
   4797  1.174      yamt 		if (!ent) {
   4798  1.174      yamt 			uvm_mapent_unreserve(map, umr);
   4799  1.174      yamt 			return ENOMEM;
   4800  1.174      yamt 		}
   4801  1.174      yamt 		UMR_PUTENTRY(umr, ent);
   4802  1.174      yamt 	}
   4803  1.174      yamt 
   4804  1.174      yamt 	return 0;
   4805  1.174      yamt }
   4806  1.174      yamt 
   4807  1.174      yamt /*
   4808  1.174      yamt  * uvm_mapent_unreserve:
   4809  1.174      yamt  *
   4810  1.174      yamt  * => caller shouldn't hold map locked.
   4811  1.174      yamt  * => never fail or sleep.
   4812  1.174      yamt  */
   4813  1.174      yamt void
   4814  1.232      yamt uvm_mapent_unreserve(struct vm_map *map, struct uvm_mapent_reservation *umr)
   4815  1.174      yamt {
   4816  1.174      yamt 
   4817  1.174      yamt 	while (!UMR_EMPTY(umr))
   4818  1.174      yamt 		uvm_kmapent_free(UMR_GETENTRY(umr));
   4819  1.174      yamt }
   4820  1.174      yamt 
   4821  1.194      yamt /*
   4822  1.194      yamt  * uvm_mapent_trymerge: try to merge an entry with its neighbors.
   4823  1.194      yamt  *
   4824  1.194      yamt  * => called with map locked.
   4825  1.194      yamt  * => return non zero if successfully merged.
   4826  1.194      yamt  */
   4827  1.194      yamt 
   4828  1.194      yamt int
   4829  1.194      yamt uvm_mapent_trymerge(struct vm_map *map, struct vm_map_entry *entry, int flags)
   4830  1.194      yamt {
   4831  1.194      yamt 	struct uvm_object *uobj;
   4832  1.194      yamt 	struct vm_map_entry *next;
   4833  1.194      yamt 	struct vm_map_entry *prev;
   4834  1.195      yamt 	vsize_t size;
   4835  1.194      yamt 	int merged = 0;
   4836  1.233   thorpej 	bool copying;
   4837  1.194      yamt 	int newetype;
   4838  1.194      yamt 
   4839  1.194      yamt 	if (VM_MAP_USE_KMAPENT(map)) {
   4840  1.194      yamt 		return 0;
   4841  1.194      yamt 	}
   4842  1.194      yamt 	if (entry->aref.ar_amap != NULL) {
   4843  1.194      yamt 		return 0;
   4844  1.194      yamt 	}
   4845  1.194      yamt 	if ((entry->flags & UVM_MAP_NOMERGE) != 0) {
   4846  1.194      yamt 		return 0;
   4847  1.194      yamt 	}
   4848  1.194      yamt 
   4849  1.194      yamt 	uobj = entry->object.uvm_obj;
   4850  1.195      yamt 	size = entry->end - entry->start;
   4851  1.194      yamt 	copying = (flags & UVM_MERGE_COPYING) != 0;
   4852  1.194      yamt 	newetype = copying ? (entry->etype & ~UVM_ET_NEEDSCOPY) : entry->etype;
   4853  1.194      yamt 
   4854  1.194      yamt 	next = entry->next;
   4855  1.194      yamt 	if (next != &map->header &&
   4856  1.194      yamt 	    next->start == entry->end &&
   4857  1.194      yamt 	    ((copying && next->aref.ar_amap != NULL &&
   4858  1.194      yamt 	    amap_refs(next->aref.ar_amap) == 1) ||
   4859  1.194      yamt 	    (!copying && next->aref.ar_amap == NULL)) &&
   4860  1.194      yamt 	    UVM_ET_ISCOMPATIBLE(next, newetype,
   4861  1.194      yamt 	    uobj, entry->flags, entry->protection,
   4862  1.194      yamt 	    entry->max_protection, entry->inheritance, entry->advice,
   4863  1.195      yamt 	    entry->wired_count) &&
   4864  1.195      yamt 	    (uobj == NULL || entry->offset + size == next->offset)) {
   4865  1.194      yamt 		int error;
   4866  1.194      yamt 
   4867  1.194      yamt 		if (copying) {
   4868  1.195      yamt 			error = amap_extend(next, size,
   4869  1.194      yamt 			    AMAP_EXTEND_NOWAIT|AMAP_EXTEND_BACKWARDS);
   4870  1.194      yamt 		} else {
   4871  1.194      yamt 			error = 0;
   4872  1.194      yamt 		}
   4873  1.194      yamt 		if (error == 0) {
   4874  1.197      yamt 			if (uobj) {
   4875  1.197      yamt 				if (uobj->pgops->pgo_detach) {
   4876  1.197      yamt 					uobj->pgops->pgo_detach(uobj);
   4877  1.197      yamt 				}
   4878  1.194      yamt 			}
   4879  1.194      yamt 
   4880  1.194      yamt 			entry->end = next->end;
   4881  1.221      yamt 			clear_hints(map, next);
   4882  1.194      yamt 			uvm_map_entry_unlink(map, next);
   4883  1.194      yamt 			if (copying) {
   4884  1.194      yamt 				entry->aref = next->aref;
   4885  1.194      yamt 				entry->etype &= ~UVM_ET_NEEDSCOPY;
   4886  1.194      yamt 			}
   4887  1.222      yamt 			uvm_map_check(map, "trymerge forwardmerge");
   4888  1.194      yamt 			uvm_mapent_free_merged(map, next);
   4889  1.194      yamt 			merged++;
   4890  1.194      yamt 		}
   4891  1.194      yamt 	}
   4892  1.194      yamt 
   4893  1.194      yamt 	prev = entry->prev;
   4894  1.194      yamt 	if (prev != &map->header &&
   4895  1.194      yamt 	    prev->end == entry->start &&
   4896  1.194      yamt 	    ((copying && !merged && prev->aref.ar_amap != NULL &&
   4897  1.194      yamt 	    amap_refs(prev->aref.ar_amap) == 1) ||
   4898  1.194      yamt 	    (!copying && prev->aref.ar_amap == NULL)) &&
   4899  1.194      yamt 	    UVM_ET_ISCOMPATIBLE(prev, newetype,
   4900  1.194      yamt 	    uobj, entry->flags, entry->protection,
   4901  1.194      yamt 	    entry->max_protection, entry->inheritance, entry->advice,
   4902  1.195      yamt 	    entry->wired_count) &&
   4903  1.196      yamt 	    (uobj == NULL ||
   4904  1.196      yamt 	    prev->offset + prev->end - prev->start == entry->offset)) {
   4905  1.194      yamt 		int error;
   4906  1.194      yamt 
   4907  1.194      yamt 		if (copying) {
   4908  1.195      yamt 			error = amap_extend(prev, size,
   4909  1.194      yamt 			    AMAP_EXTEND_NOWAIT|AMAP_EXTEND_FORWARDS);
   4910  1.194      yamt 		} else {
   4911  1.194      yamt 			error = 0;
   4912  1.194      yamt 		}
   4913  1.194      yamt 		if (error == 0) {
   4914  1.197      yamt 			if (uobj) {
   4915  1.197      yamt 				if (uobj->pgops->pgo_detach) {
   4916  1.197      yamt 					uobj->pgops->pgo_detach(uobj);
   4917  1.197      yamt 				}
   4918  1.197      yamt 				entry->offset = prev->offset;
   4919  1.194      yamt 			}
   4920  1.194      yamt 
   4921  1.194      yamt 			entry->start = prev->start;
   4922  1.221      yamt 			clear_hints(map, prev);
   4923  1.194      yamt 			uvm_map_entry_unlink(map, prev);
   4924  1.194      yamt 			if (copying) {
   4925  1.194      yamt 				entry->aref = prev->aref;
   4926  1.194      yamt 				entry->etype &= ~UVM_ET_NEEDSCOPY;
   4927  1.194      yamt 			}
   4928  1.222      yamt 			uvm_map_check(map, "trymerge backmerge");
   4929  1.194      yamt 			uvm_mapent_free_merged(map, prev);
   4930  1.194      yamt 			merged++;
   4931  1.194      yamt 		}
   4932  1.194      yamt 	}
   4933  1.194      yamt 
   4934  1.194      yamt 	return merged;
   4935  1.194      yamt }
   4936  1.194      yamt 
   4937    1.1       mrg #if defined(DDB)
   4938    1.1       mrg 
   4939    1.1       mrg /*
   4940    1.1       mrg  * DDB hooks
   4941    1.1       mrg  */
   4942    1.1       mrg 
   4943    1.1       mrg /*
   4944    1.1       mrg  * uvm_map_printit: actually prints the map
   4945    1.1       mrg  */
   4946    1.1       mrg 
   4947   1.10       mrg void
   4948  1.233   thorpej uvm_map_printit(struct vm_map *map, bool full,
   4949  1.138     enami     void (*pr)(const char *, ...))
   4950   1.10       mrg {
   4951   1.99       chs 	struct vm_map_entry *entry;
   4952   1.10       mrg 
   4953  1.184       chs 	(*pr)("MAP %p: [0x%lx->0x%lx]\n", map, vm_map_min(map),
   4954  1.184       chs 	    vm_map_max(map));
   4955   1.53   thorpej 	(*pr)("\t#ent=%d, sz=%d, ref=%d, version=%d, flags=0x%x\n",
   4956   1.53   thorpej 	    map->nentries, map->size, map->ref_count, map->timestamp,
   4957   1.53   thorpej 	    map->flags);
   4958  1.173      yamt 	(*pr)("\tpmap=%p(resident=%ld, wired=%ld)\n", map->pmap,
   4959  1.173      yamt 	    pmap_resident_count(map->pmap), pmap_wired_count(map->pmap));
   4960   1.10       mrg 	if (!full)
   4961   1.10       mrg 		return;
   4962   1.10       mrg 	for (entry = map->header.next; entry != &map->header;
   4963   1.10       mrg 	    entry = entry->next) {
   4964   1.70    kleink 		(*pr)(" - %p: 0x%lx->0x%lx: obj=%p/0x%llx, amap=%p/%d\n",
   4965   1.10       mrg 		    entry, entry->start, entry->end, entry->object.uvm_obj,
   4966   1.85       chs 		    (long long)entry->offset, entry->aref.ar_amap,
   4967   1.85       chs 		    entry->aref.ar_pageoff);
   4968   1.10       mrg 		(*pr)(
   4969   1.85       chs 		    "\tsubmap=%c, cow=%c, nc=%c, prot(max)=%d/%d, inh=%d, "
   4970   1.85       chs 		    "wc=%d, adv=%d\n",
   4971   1.10       mrg 		    (entry->etype & UVM_ET_SUBMAP) ? 'T' : 'F',
   4972   1.98       chs 		    (entry->etype & UVM_ET_COPYONWRITE) ? 'T' : 'F',
   4973   1.10       mrg 		    (entry->etype & UVM_ET_NEEDSCOPY) ? 'T' : 'F',
   4974   1.10       mrg 		    entry->protection, entry->max_protection,
   4975   1.10       mrg 		    entry->inheritance, entry->wired_count, entry->advice);
   4976   1.10       mrg 	}
   4977   1.98       chs }
   4978    1.1       mrg 
   4979    1.1       mrg /*
   4980    1.1       mrg  * uvm_object_printit: actually prints the object
   4981    1.1       mrg  */
   4982    1.1       mrg 
   4983   1.10       mrg void
   4984  1.233   thorpej uvm_object_printit(struct uvm_object *uobj, bool full,
   4985  1.138     enami     void (*pr)(const char *, ...))
   4986   1.10       mrg {
   4987   1.10       mrg 	struct vm_page *pg;
   4988   1.10       mrg 	int cnt = 0;
   4989   1.10       mrg 
   4990   1.71       chs 	(*pr)("OBJECT %p: locked=%d, pgops=%p, npages=%d, ",
   4991  1.248        ad 	    uobj, mutex_owned(&uobj->vmobjlock), uobj->pgops, uobj->uo_npages);
   4992   1.42   thorpej 	if (UVM_OBJ_IS_KERN_OBJECT(uobj))
   4993   1.10       mrg 		(*pr)("refs=<SYSTEM>\n");
   4994   1.10       mrg 	else
   4995   1.10       mrg 		(*pr)("refs=%d\n", uobj->uo_refs);
   4996   1.10       mrg 
   4997   1.71       chs 	if (!full) {
   4998   1.71       chs 		return;
   4999   1.71       chs 	}
   5000   1.10       mrg 	(*pr)("  PAGES <pg,offset>:\n  ");
   5001  1.257        ad 	TAILQ_FOREACH(pg, &uobj->memq, listq.queue) {
   5002  1.106       chs 		cnt++;
   5003   1.85       chs 		(*pr)("<%p,0x%llx> ", pg, (long long)pg->offset);
   5004  1.106       chs 		if ((cnt % 3) == 0) {
   5005   1.71       chs 			(*pr)("\n  ");
   5006   1.71       chs 		}
   5007   1.71       chs 	}
   5008  1.106       chs 	if ((cnt % 3) != 0) {
   5009   1.71       chs 		(*pr)("\n");
   5010   1.10       mrg 	}
   5011   1.98       chs }
   5012    1.1       mrg 
   5013    1.1       mrg /*
   5014    1.1       mrg  * uvm_page_printit: actually print the page
   5015    1.1       mrg  */
   5016    1.1       mrg 
   5017  1.228      yamt static const char page_flagbits[] = UVM_PGFLAGBITS;
   5018  1.228      yamt static const char page_pqflagbits[] = UVM_PQFLAGBITS;
   5019   1.86       chs 
   5020   1.10       mrg void
   5021  1.233   thorpej uvm_page_printit(struct vm_page *pg, bool full,
   5022  1.138     enami     void (*pr)(const char *, ...))
   5023   1.10       mrg {
   5024   1.85       chs 	struct vm_page *tpg;
   5025   1.10       mrg 	struct uvm_object *uobj;
   5026  1.257        ad 	struct pgflist *pgl;
   5027   1.71       chs 	char pgbuf[128];
   5028   1.71       chs 	char pqbuf[128];
   5029    1.1       mrg 
   5030   1.10       mrg 	(*pr)("PAGE %p:\n", pg);
   5031  1.266  christos 	snprintb(pgbuf, sizeof(pgbuf), page_flagbits, pg->flags);
   5032  1.266  christos 	snprintb(pqbuf, sizeof(pqbuf), page_pqflagbits, pg->pqflags);
   5033  1.106       chs 	(*pr)("  flags=%s, pqflags=%s, wire_count=%d, pa=0x%lx\n",
   5034  1.137      yamt 	    pgbuf, pqbuf, pg->wire_count, (long)VM_PAGE_TO_PHYS(pg));
   5035   1.86       chs 	(*pr)("  uobject=%p, uanon=%p, offset=0x%llx loan_count=%d\n",
   5036   1.86       chs 	    pg->uobject, pg->uanon, (long long)pg->offset, pg->loan_count);
   5037    1.1       mrg #if defined(UVM_PAGE_TRKOWN)
   5038   1.10       mrg 	if (pg->flags & PG_BUSY)
   5039   1.10       mrg 		(*pr)("  owning process = %d, tag=%s\n",
   5040   1.10       mrg 		    pg->owner, pg->owner_tag);
   5041   1.10       mrg 	else
   5042   1.10       mrg 		(*pr)("  page not busy, no owner\n");
   5043    1.1       mrg #else
   5044   1.10       mrg 	(*pr)("  [page ownership tracking disabled]\n");
   5045    1.1       mrg #endif
   5046    1.1       mrg 
   5047   1.10       mrg 	if (!full)
   5048   1.10       mrg 		return;
   5049   1.10       mrg 
   5050   1.10       mrg 	/* cross-verify object/anon */
   5051   1.10       mrg 	if ((pg->pqflags & PQ_FREE) == 0) {
   5052   1.10       mrg 		if (pg->pqflags & PQ_ANON) {
   5053  1.192      yamt 			if (pg->uanon == NULL || pg->uanon->an_page != pg)
   5054   1.85       chs 			    (*pr)("  >>> ANON DOES NOT POINT HERE <<< (%p)\n",
   5055  1.192      yamt 				(pg->uanon) ? pg->uanon->an_page : NULL);
   5056   1.10       mrg 			else
   5057   1.10       mrg 				(*pr)("  anon backpointer is OK\n");
   5058   1.10       mrg 		} else {
   5059   1.10       mrg 			uobj = pg->uobject;
   5060   1.10       mrg 			if (uobj) {
   5061   1.10       mrg 				(*pr)("  checking object list\n");
   5062  1.257        ad 				TAILQ_FOREACH(tpg, &uobj->memq, listq.queue) {
   5063   1.85       chs 					if (tpg == pg) {
   5064   1.85       chs 						break;
   5065   1.85       chs 					}
   5066   1.10       mrg 				}
   5067   1.85       chs 				if (tpg)
   5068   1.10       mrg 					(*pr)("  page found on object list\n");
   5069   1.10       mrg 				else
   5070   1.10       mrg 			(*pr)("  >>> PAGE NOT FOUND ON OBJECT LIST! <<<\n");
   5071   1.10       mrg 			}
   5072   1.10       mrg 		}
   5073   1.10       mrg 	}
   5074    1.1       mrg 
   5075   1.10       mrg 	/* cross-verify page queue */
   5076   1.73   thorpej 	if (pg->pqflags & PQ_FREE) {
   5077   1.73   thorpej 		int fl = uvm_page_lookup_freelist(pg);
   5078   1.96   thorpej 		int color = VM_PGCOLOR_BUCKET(pg);
   5079   1.96   thorpej 		pgl = &uvm.page_free[fl].pgfl_buckets[color].pgfl_queues[
   5080   1.96   thorpej 		    ((pg)->flags & PG_ZERO) ? PGFL_ZEROS : PGFL_UNKNOWN];
   5081  1.139     enami 	} else {
   5082   1.10       mrg 		pgl = NULL;
   5083   1.85       chs 	}
   5084   1.10       mrg 
   5085   1.10       mrg 	if (pgl) {
   5086   1.10       mrg 		(*pr)("  checking pageq list\n");
   5087  1.257        ad 		LIST_FOREACH(tpg, pgl, pageq.list) {
   5088   1.85       chs 			if (tpg == pg) {
   5089   1.85       chs 				break;
   5090   1.85       chs 			}
   5091   1.10       mrg 		}
   5092   1.85       chs 		if (tpg)
   5093   1.10       mrg 			(*pr)("  page found on pageq list\n");
   5094   1.10       mrg 		else
   5095   1.10       mrg 			(*pr)("  >>> PAGE NOT FOUND ON PAGEQ LIST! <<<\n");
   5096   1.10       mrg 	}
   5097    1.1       mrg }
   5098  1.213     bjh21 
   5099  1.213     bjh21 /*
   5100  1.213     bjh21  * uvm_pages_printthem - print a summary of all managed pages
   5101  1.213     bjh21  */
   5102  1.213     bjh21 
   5103  1.213     bjh21 void
   5104  1.213     bjh21 uvm_page_printall(void (*pr)(const char *, ...))
   5105  1.213     bjh21 {
   5106  1.213     bjh21 	unsigned i;
   5107  1.213     bjh21 	struct vm_page *pg;
   5108  1.213     bjh21 
   5109  1.231       uwe 	(*pr)("%18s %4s %4s %18s %18s"
   5110  1.214     bjh21 #ifdef UVM_PAGE_TRKOWN
   5111  1.214     bjh21 	    " OWNER"
   5112  1.214     bjh21 #endif
   5113  1.214     bjh21 	    "\n", "PAGE", "FLAG", "PQ", "UOBJECT", "UANON");
   5114  1.213     bjh21 	for (i = 0; i < vm_nphysseg; i++) {
   5115  1.213     bjh21 		for (pg = vm_physmem[i].pgs; pg <= vm_physmem[i].lastpg; pg++) {
   5116  1.231       uwe 			(*pr)("%18p %04x %04x %18p %18p",
   5117  1.213     bjh21 			    pg, pg->flags, pg->pqflags, pg->uobject,
   5118  1.213     bjh21 			    pg->uanon);
   5119  1.214     bjh21 #ifdef UVM_PAGE_TRKOWN
   5120  1.214     bjh21 			if (pg->flags & PG_BUSY)
   5121  1.214     bjh21 				(*pr)(" %d [%s]", pg->owner, pg->owner_tag);
   5122  1.214     bjh21 #endif
   5123  1.214     bjh21 			(*pr)("\n");
   5124  1.213     bjh21 		}
   5125  1.213     bjh21 	}
   5126  1.213     bjh21 }
   5127  1.213     bjh21 
   5128    1.1       mrg #endif
   5129  1.211      yamt 
   5130  1.211      yamt /*
   5131  1.211      yamt  * uvm_map_create: create map
   5132  1.211      yamt  */
   5133  1.211      yamt 
   5134  1.211      yamt struct vm_map *
   5135  1.211      yamt uvm_map_create(pmap_t pmap, vaddr_t vmin, vaddr_t vmax, int flags)
   5136  1.211      yamt {
   5137  1.211      yamt 	struct vm_map *result;
   5138  1.211      yamt 
   5139  1.267    cegger 	result = malloc(sizeof(struct vm_map), M_VMMAP, M_WAITOK);
   5140  1.211      yamt 	uvm_map_setup(result, vmin, vmax, flags);
   5141  1.211      yamt 	result->pmap = pmap;
   5142  1.211      yamt 	return(result);
   5143  1.211      yamt }
   5144  1.211      yamt 
   5145  1.211      yamt /*
   5146  1.211      yamt  * uvm_map_setup: init map
   5147  1.211      yamt  *
   5148  1.211      yamt  * => map must not be in service yet.
   5149  1.211      yamt  */
   5150  1.211      yamt 
   5151  1.211      yamt void
   5152  1.211      yamt uvm_map_setup(struct vm_map *map, vaddr_t vmin, vaddr_t vmax, int flags)
   5153  1.211      yamt {
   5154  1.238        ad 	int ipl;
   5155  1.211      yamt 
   5156  1.263      matt 	rb_tree_init(&map->rb_tree, &uvm_map_tree_ops);
   5157  1.211      yamt 	map->header.next = map->header.prev = &map->header;
   5158  1.211      yamt 	map->nentries = 0;
   5159  1.211      yamt 	map->size = 0;
   5160  1.211      yamt 	map->ref_count = 1;
   5161  1.211      yamt 	vm_map_setmin(map, vmin);
   5162  1.211      yamt 	vm_map_setmax(map, vmax);
   5163  1.211      yamt 	map->flags = flags;
   5164  1.211      yamt 	map->first_free = &map->header;
   5165  1.211      yamt 	map->hint = &map->header;
   5166  1.211      yamt 	map->timestamp = 0;
   5167  1.238        ad 	map->busy = NULL;
   5168  1.238        ad 
   5169  1.238        ad 	if ((flags & VM_MAP_INTRSAFE) != 0) {
   5170  1.238        ad 		ipl = IPL_VM;
   5171  1.238        ad 	} else {
   5172  1.238        ad 		ipl = IPL_NONE;
   5173  1.238        ad 	}
   5174  1.238        ad 
   5175  1.240        ad 	rw_init(&map->lock);
   5176  1.238        ad 	cv_init(&map->cv, "vm_map");
   5177  1.238        ad 	mutex_init(&map->misc_lock, MUTEX_DRIVER, ipl);
   5178  1.238        ad 	mutex_init(&map->mutex, MUTEX_DRIVER, ipl);
   5179  1.211      yamt }
   5180  1.211      yamt 
   5181  1.211      yamt 
   5182  1.211      yamt /*
   5183  1.211      yamt  *   U N M A P   -   m a i n   e n t r y   p o i n t
   5184  1.211      yamt  */
   5185  1.211      yamt 
   5186  1.211      yamt /*
   5187  1.211      yamt  * uvm_unmap1: remove mappings from a vm_map (from "start" up to "stop")
   5188  1.211      yamt  *
   5189  1.211      yamt  * => caller must check alignment and size
   5190  1.211      yamt  * => map must be unlocked (we will lock it)
   5191  1.211      yamt  * => flags is UVM_FLAG_QUANTUM or 0.
   5192  1.211      yamt  */
   5193  1.211      yamt 
   5194  1.211      yamt void
   5195  1.211      yamt uvm_unmap1(struct vm_map *map, vaddr_t start, vaddr_t end, int flags)
   5196  1.211      yamt {
   5197  1.211      yamt 	struct vm_map_entry *dead_entries;
   5198  1.211      yamt 	struct uvm_mapent_reservation umr;
   5199  1.211      yamt 	UVMHIST_FUNC("uvm_unmap"); UVMHIST_CALLED(maphist);
   5200  1.211      yamt 
   5201  1.211      yamt 	UVMHIST_LOG(maphist, "  (map=0x%x, start=0x%x, end=0x%x)",
   5202  1.211      yamt 	    map, start, end, 0);
   5203  1.246   xtraeme 	if (map == kernel_map) {
   5204  1.244      yamt 		LOCKDEBUG_MEM_CHECK((void *)start, end - start);
   5205  1.246   xtraeme 	}
   5206  1.211      yamt 	/*
   5207  1.211      yamt 	 * work now done by helper functions.   wipe the pmap's and then
   5208  1.211      yamt 	 * detach from the dead entries...
   5209  1.211      yamt 	 */
   5210  1.211      yamt 	uvm_mapent_reserve(map, &umr, 2, flags);
   5211  1.211      yamt 	vm_map_lock(map);
   5212  1.211      yamt 	uvm_unmap_remove(map, start, end, &dead_entries, &umr, flags);
   5213  1.211      yamt 	vm_map_unlock(map);
   5214  1.211      yamt 	uvm_mapent_unreserve(map, &umr);
   5215  1.211      yamt 
   5216  1.211      yamt 	if (dead_entries != NULL)
   5217  1.211      yamt 		uvm_unmap_detach(dead_entries, 0);
   5218  1.211      yamt 
   5219  1.211      yamt 	UVMHIST_LOG(maphist, "<- done", 0,0,0,0);
   5220  1.211      yamt }
   5221  1.211      yamt 
   5222  1.211      yamt 
   5223  1.211      yamt /*
   5224  1.211      yamt  * uvm_map_reference: add reference to a map
   5225  1.211      yamt  *
   5226  1.238        ad  * => map need not be locked (we use misc_lock).
   5227  1.211      yamt  */
   5228  1.211      yamt 
   5229  1.211      yamt void
   5230  1.211      yamt uvm_map_reference(struct vm_map *map)
   5231  1.211      yamt {
   5232  1.238        ad 	mutex_enter(&map->misc_lock);
   5233  1.211      yamt 	map->ref_count++;
   5234  1.238        ad 	mutex_exit(&map->misc_lock);
   5235  1.211      yamt }
   5236  1.211      yamt 
   5237  1.211      yamt struct vm_map_kernel *
   5238  1.211      yamt vm_map_to_kernel(struct vm_map *map)
   5239  1.211      yamt {
   5240  1.211      yamt 
   5241  1.211      yamt 	KASSERT(VM_MAP_IS_KERNEL(map));
   5242  1.211      yamt 
   5243  1.211      yamt 	return (struct vm_map_kernel *)map;
   5244  1.211      yamt }
   5245  1.226      yamt 
   5246  1.233   thorpej bool
   5247  1.226      yamt vm_map_starved_p(struct vm_map *map)
   5248  1.226      yamt {
   5249  1.226      yamt 
   5250  1.226      yamt 	if ((map->flags & VM_MAP_WANTVA) != 0) {
   5251  1.234   thorpej 		return true;
   5252  1.226      yamt 	}
   5253  1.226      yamt 	/* XXX */
   5254  1.226      yamt 	if ((vm_map_max(map) - vm_map_min(map)) / 16 * 15 < map->size) {
   5255  1.234   thorpej 		return true;
   5256  1.226      yamt 	}
   5257  1.234   thorpej 	return false;
   5258  1.226      yamt }
   5259  1.247      yamt 
   5260  1.247      yamt #if defined(DDB)
   5261  1.247      yamt void
   5262  1.247      yamt uvm_whatis(uintptr_t addr, void (*pr)(const char *, ...))
   5263  1.247      yamt {
   5264  1.247      yamt 	struct vm_map *map;
   5265  1.247      yamt 
   5266  1.247      yamt 	for (map = kernel_map;;) {
   5267  1.247      yamt 		struct vm_map_entry *entry;
   5268  1.247      yamt 
   5269  1.247      yamt 		if (!uvm_map_lookup_entry_bytree(map, (vaddr_t)addr, &entry)) {
   5270  1.247      yamt 			break;
   5271  1.247      yamt 		}
   5272  1.247      yamt 		(*pr)("%p is %p+%zu from VMMAP %p\n",
   5273  1.247      yamt 		    (void *)addr, (void *)entry->start,
   5274  1.247      yamt 		    (size_t)(addr - (uintptr_t)entry->start), map);
   5275  1.247      yamt 		if (!UVM_ET_ISSUBMAP(entry)) {
   5276  1.247      yamt 			break;
   5277  1.247      yamt 		}
   5278  1.247      yamt 		map = entry->object.sub_map;
   5279  1.247      yamt 	}
   5280  1.247      yamt }
   5281  1.247      yamt #endif /* defined(DDB) */
   5282