pmap.c revision 108533
1138627Stakawata/* 2138627Stakawata * Copyright (c) 1991 Regents of the University of California. 3147196Smarkus * All rights reserved. 4138627Stakawata * Copyright (c) 1994 John S. Dyson 5138627Stakawata * All rights reserved. 6138627Stakawata * Copyright (c) 1994 David Greenman 7138627Stakawata * All rights reserved. 8138627Stakawata * 9138627Stakawata * This code is derived from software contributed to Berkeley by 10138627Stakawata * the Systems Programming Group of the University of Utah Computer 11138627Stakawata * Science Department and William Jolitz of UUNET Technologies Inc. 12138627Stakawata * 13138627Stakawata * Redistribution and use in source and binary forms, with or without 14138627Stakawata * modification, are permitted provided that the following conditions 15138627Stakawata * are met: 16138627Stakawata * 1. Redistributions of source code must retain the above copyright 17138627Stakawata * notice, this list of conditions and the following disclaimer. 18138627Stakawata * 2. Redistributions in binary form must reproduce the above copyright 19138627Stakawata * notice, this list of conditions and the following disclaimer in the 20138627Stakawata * documentation and/or other materials provided with the distribution. 21138627Stakawata * 3. All advertising materials mentioning features or use of this software 22138627Stakawata * must display the following acknowledgement: 23138627Stakawata * This product includes software developed by the University of 24138627Stakawata * California, Berkeley and its contributors. 25138627Stakawata * 4. Neither the name of the University nor the names of its contributors 26138627Stakawata * may be used to endorse or promote products derived from this software 27138627Stakawata * without specific prior written permission. 28143002Sobrien * 29143002Sobrien * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 30143002Sobrien * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 31147196Smarkus * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 32147196Smarkus * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 33147196Smarkus * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 34147196Smarkus * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 35147196Smarkus * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 36147196Smarkus * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 37147196Smarkus * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 38147196Smarkus * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 39147196Smarkus * SUCH DAMAGE. 40138627Stakawata * 41138627Stakawata * from: @(#)pmap.c 7.7 (Berkeley) 5/12/91 42138627Stakawata * $FreeBSD: head/sys/i386/i386/pmap.c 108533 2003-01-01 18:49:04Z schweikh $ 43138627Stakawata */ 44138627Stakawata 45193530Sjkim/* 46193530Sjkim * Manages physical address maps. 47193530Sjkim * 48193530Sjkim * In addition to hardware address maps, this 49138627Stakawata * module is called upon to provide software-use-only 50138627Stakawata * maps which may or may not be stored in the same 51138627Stakawata * form as hardware maps. These pseudo-maps are 52147196Smarkus * used to store intermediate results from copy 53237493Siwasaki * operations to and from address spaces. 54237493Siwasaki * 55138627Stakawata * Since the information managed by this module is 56178193Sphk * also stored by the logical address mapping module, 57138627Stakawata * this module may throw away valid virtual-to-physical 58138825Snjl * mappings at almost any time. However, invalidations 59138774Sscottl * of virtual-to-physical mappings must be done as 60138774Sscottl * requested. 61147196Smarkus * 62147196Smarkus * In order to cope with hardware architectures which 63147196Smarkus * make virtual-to-physical map invalidates expensive, 64147196Smarkus * this module may delay invalidate or reduced protection 65147196Smarkus * operations until such time as they are actually 66147196Smarkus * necessary. This module is given full information as 67147196Smarkus * to which processors are currently using which maps, 68147196Smarkus * and to when physical maps must be made correct. 69147196Smarkus */ 70147196Smarkus 71147196Smarkus#include "opt_pmap.h" 72154326Smarkus#include "opt_msgbuf.h" 73154326Smarkus#include "opt_kstack_pages.h" 74154326Smarkus 75237493Siwasaki#include <sys/param.h> 76138627Stakawata#include <sys/systm.h> 77147196Smarkus#include <sys/kernel.h> 78147196Smarkus#include <sys/lock.h> 79147196Smarkus#include <sys/mman.h> 80147196Smarkus#include <sys/msgbuf.h> 81147196Smarkus#include <sys/mutex.h> 82147196Smarkus#include <sys/proc.h> 83147196Smarkus#include <sys/sx.h> 84147196Smarkus#include <sys/user.h> 85147196Smarkus#include <sys/vmmeter.h> 86147196Smarkus#include <sys/sysctl.h> 87147196Smarkus#ifdef SMP 88147196Smarkus#include <sys/smp.h> 89147196Smarkus#endif 90147196Smarkus 91147196Smarkus#include <vm/vm.h> 92147196Smarkus#include <vm/vm_param.h> 93147196Smarkus#include <vm/vm_kern.h> 94147196Smarkus#include <vm/vm_page.h> 95147196Smarkus#include <vm/vm_map.h> 96138627Stakawata#include <vm/vm_object.h> 97147196Smarkus#include <vm/vm_extern.h> 98147196Smarkus#include <vm/vm_pageout.h> 99147196Smarkus#include <vm/vm_pager.h> 100147196Smarkus#include <vm/uma.h> 101147196Smarkus 102147196Smarkus#include <machine/cpu.h> 103147196Smarkus#include <machine/cputypes.h> 104154326Smarkus#include <machine/md_var.h> 105154326Smarkus#include <machine/specialreg.h> 106147196Smarkus#if defined(SMP) || defined(APIC_IO) 107147196Smarkus#include <machine/smp.h> 108147196Smarkus#include <machine/apic.h> 109147196Smarkus#include <machine/segments.h> 110147196Smarkus#include <machine/tss.h> 111147196Smarkus#endif /* SMP || APIC_IO */ 112147196Smarkus 113147196Smarkus#define PMAP_KEEP_PDIRS 114147196Smarkus#ifndef PMAP_SHPGPERPROC 115147196Smarkus#define PMAP_SHPGPERPROC 200 116147196Smarkus#endif 117147196Smarkus 118147196Smarkus#if defined(DIAGNOSTIC) 119147196Smarkus#define PMAP_DIAGNOSTIC 120147196Smarkus#endif 121147196Smarkus 122147196Smarkus#define MINPV 2048 123147196Smarkus 124147196Smarkus#if !defined(PMAP_DIAGNOSTIC) 125147196Smarkus#define PMAP_INLINE __inline 126147196Smarkus#else 127147196Smarkus#define PMAP_INLINE 128147196Smarkus#endif 129147196Smarkus 130147196Smarkus/* 131147196Smarkus * Get PDEs and PTEs for user/kernel address space 132237493Siwasaki */ 133237493Siwasaki#define pmap_pde(m, v) (&((m)->pm_pdir[(vm_offset_t)(v) >> PDRSHIFT])) 134237493Siwasaki#define pdir_pde(m, v) (m[(vm_offset_t)(v) >> PDRSHIFT]) 135237493Siwasaki 136237493Siwasaki#define pmap_pde_v(pte) ((*(int *)pte & PG_V) != 0) 137237493Siwasaki#define pmap_pte_w(pte) ((*(int *)pte & PG_W) != 0) 138237493Siwasaki#define pmap_pte_m(pte) ((*(int *)pte & PG_M) != 0) 139237493Siwasaki#define pmap_pte_u(pte) ((*(int *)pte & PG_A) != 0) 140237493Siwasaki#define pmap_pte_v(pte) ((*(int *)pte & PG_V) != 0) 141237493Siwasaki 142237493Siwasaki#define pmap_pte_set_w(pte, v) ((v)?(*(int *)pte |= PG_W):(*(int *)pte &= ~PG_W)) 143237493Siwasaki#define pmap_pte_set_prot(pte, v) ((*(int *)pte &= ~PG_PROT), (*(int *)pte |= (v))) 144237493Siwasaki 145237493Siwasaki/* 146237493Siwasaki * Given a map and a machine independent protection code, 147147196Smarkus * convert to a vax protection code. 148147196Smarkus */ 149138627Stakawata#define pte_prot(m, p) (protection_codes[p]) 150147196Smarkusstatic int protection_codes[8]; 151147196Smarkus 152147196Smarkusstruct pmap kernel_pmap_store; 153147196SmarkusLIST_HEAD(pmaplist, pmap); 154147196Smarkusstruct pmaplist allpmaps; 155147196Smarkus 156147196Smarkusvm_offset_t avail_start; /* PA of first available physical page */ 157147196Smarkusvm_offset_t avail_end; /* PA of last available physical page */ 158147196Smarkusvm_offset_t virtual_avail; /* VA of first avail page (after kernel bss) */ 159147196Smarkusvm_offset_t virtual_end; /* VA of last avail page (end of kernel AS) */ 160147196Smarkusstatic boolean_t pmap_initialized = FALSE; /* Has pmap_init completed? */ 161147196Smarkusstatic int pgeflag; /* PG_G or-in */ 162147196Smarkusstatic int pseflag; /* PG_PS or-in */ 163147196Smarkus 164147196Smarkusstatic vm_object_t kptobj; 165147196Smarkus 166147196Smarkusstatic int nkpt; 167147196Smarkusvm_offset_t kernel_vm_end; 168147196Smarkusextern u_int32_t KERNend; 169147196Smarkus 170147196Smarkus/* 171148710Smarkus * Data for the pv entry allocation mechanism 172148710Smarkus */ 173147196Smarkusstatic uma_zone_t pvzone; 174148710Smarkusstatic struct vm_object pvzone_obj; 175148710Smarkusstatic int pv_entry_count = 0, pv_entry_max = 0, pv_entry_high_water = 0; 176147196Smarkusint pmap_pagedaemon_waken; 177147196Smarkus 178147196Smarkus/* 179147196Smarkus * All those kernel PT submaps that BSD is so fond of 180147196Smarkus */ 181147196Smarkuspt_entry_t *CMAP1 = 0; 182147196Smarkusstatic pt_entry_t *CMAP2, *CMAP3, *ptmmap; 183147196Smarkuscaddr_t CADDR1 = 0, ptvmmap = 0; 184147196Smarkusstatic caddr_t CADDR2, CADDR3; 185237493Siwasakistatic pt_entry_t *msgbufmap; 186237493Siwasakistruct msgbuf *msgbufp = 0; 187147196Smarkus 188147196Smarkus/* 189138627Stakawata * Crashdump maps. 190138627Stakawata */ 191147196Smarkusstatic pt_entry_t *pt_crashdumpmap; 192147196Smarkusstatic caddr_t crashdumpmap; 193147196Smarkus 194147196Smarkus#ifdef SMP 195273377Shselaskyextern pt_entry_t *SMPpt; 196147196Smarkus#endif 197147196Smarkusstatic pt_entry_t *PMAP1 = 0; 198147196Smarkusstatic pt_entry_t *PADDR1 = 0; 199147196Smarkus 200147196Smarkusstatic PMAP_INLINE void free_pv_entry(pv_entry_t pv); 201147196Smarkusstatic pt_entry_t *get_ptbase(pmap_t pmap); 202147196Smarkusstatic pv_entry_t get_pv_entry(void); 203147196Smarkusstatic void i386_protection_init(void); 204147196Smarkusstatic __inline void pmap_changebit(vm_page_t m, int bit, boolean_t setem); 205147196Smarkus 206147196Smarkusstatic vm_page_t pmap_enter_quick(pmap_t pmap, vm_offset_t va, 207147196Smarkus vm_page_t m, vm_page_t mpte); 208147196Smarkusstatic int pmap_remove_pte(pmap_t pmap, pt_entry_t *ptq, vm_offset_t sva); 209147196Smarkusstatic void pmap_remove_page(struct pmap *pmap, vm_offset_t va); 210147196Smarkusstatic int pmap_remove_entry(struct pmap *pmap, vm_page_t m, 211273377Shselasky vm_offset_t va); 212147196Smarkusstatic boolean_t pmap_testbit(vm_page_t m, int bit); 213147196Smarkusstatic void pmap_insert_entry(pmap_t pmap, vm_offset_t va, 214147196Smarkus vm_page_t mpte, vm_page_t m); 215147196Smarkus 216147196Smarkusstatic vm_page_t pmap_allocpte(pmap_t pmap, vm_offset_t va); 217147196Smarkus 218147196Smarkusstatic int pmap_release_free_page(pmap_t pmap, vm_page_t p); 219147196Smarkusstatic vm_page_t _pmap_allocpte(pmap_t pmap, unsigned ptepindex); 220147196Smarkusstatic pt_entry_t *pmap_pte_quick(pmap_t pmap, vm_offset_t va); 221147196Smarkusstatic vm_page_t pmap_page_lookup(vm_object_t object, vm_pindex_t pindex); 222147196Smarkusstatic int pmap_unuse_pt(pmap_t, vm_offset_t, vm_page_t); 223147196Smarkusstatic vm_offset_t pmap_kmem_choose(vm_offset_t addr); 224147196Smarkusstatic void *pmap_allocf(uma_zone_t zone, int bytes, u_int8_t *flags, int wait); 225147196Smarkus 226147196Smarkusstatic pd_entry_t pdir4mb; 227147196Smarkus 228147196Smarkus/* 229147196Smarkus * Routine: pmap_pte 230147196Smarkus * Function: 231147196Smarkus * Extract the page table entry associated 232147196Smarkus * with the given map/virtual_address pair. 233147196Smarkus */ 234147196Smarkus 235147196SmarkusPMAP_INLINE pt_entry_t * 236147196Smarkuspmap_pte(pmap, va) 237147196Smarkus register pmap_t pmap; 238147196Smarkus vm_offset_t va; 239147196Smarkus{ 240147196Smarkus pd_entry_t *pdeaddr; 241147196Smarkus 242273377Shselasky if (pmap) { 243147196Smarkus pdeaddr = pmap_pde(pmap, va); 244147196Smarkus if (*pdeaddr & PG_PS) 245147196Smarkus return pdeaddr; 246147196Smarkus if (*pdeaddr) { 247147196Smarkus return get_ptbase(pmap) + i386_btop(va); 248273377Shselasky } 249147196Smarkus } 250147196Smarkus return (0); 251154326Smarkus} 252154326Smarkus 253154326Smarkus/* 254154326Smarkus * Move the kernel virtual free pointer to the next 255154326Smarkus * 4MB. This is used to help improve performance 256147196Smarkus * by using a large (4MB) page for much of the kernel 257147196Smarkus * (.text, .data, .bss) 258147196Smarkus */ 259147196Smarkusstatic vm_offset_t 260147196Smarkuspmap_kmem_choose(vm_offset_t addr) 261147196Smarkus{ 262147196Smarkus vm_offset_t newaddr = addr; 263147196Smarkus 264147196Smarkus#ifndef DISABLE_PSE 265147196Smarkus if (cpu_feature & CPUID_PSE) 266138627Stakawata newaddr = (addr + (NBPDR - 1)) & ~(NBPDR - 1); 267138627Stakawata#endif 268138627Stakawata return newaddr; 269201605Siwasaki} 270138627Stakawata 271148710Smarkus/* 272148710Smarkus * Bootstrap the system enough to run with virtual memory. 273148710Smarkus * 274147196Smarkus * On the i386 this is called after mapping has already been enabled 275147196Smarkus * and just syncs the pmap module with what has already been done. 276147196Smarkus * [We can't call it easily with mapping off since the kernel is not 277147196Smarkus * mapped with PA == VA, hence we would have to relocate every address 278147196Smarkus * from the linked base (virtual) address "KERNBASE" to the actual 279147196Smarkus * (physical) address starting relative to 0] 280147196Smarkus */ 281237493Siwasakivoid 282147196Smarkuspmap_bootstrap(firstaddr, loadaddr) 283147196Smarkus vm_offset_t firstaddr; 284237493Siwasaki vm_offset_t loadaddr; 285237493Siwasaki{ 286237493Siwasaki vm_offset_t va; 287237493Siwasaki pt_entry_t *pte; 288237493Siwasaki int i; 289237493Siwasaki 290138627Stakawata avail_start = firstaddr; 291138627Stakawata 292138627Stakawata /* 293138627Stakawata * XXX The calculation of virtual_avail is wrong. It's NKPT*PAGE_SIZE too 294138627Stakawata * large. It should instead be correctly calculated in locore.s and 295201605Siwasaki * not based on 'first' (which is a physical address, not a virtual 296138627Stakawata * address, for the start of unused physical memory). The kernel 297246128Ssbz * page tables are NOT double mapped and thus should not be included 298138627Stakawata * in this calculation. 299138627Stakawata */ 300138627Stakawata virtual_avail = (vm_offset_t) KERNBASE + firstaddr; 301138627Stakawata virtual_avail = pmap_kmem_choose(virtual_avail); 302138627Stakawata 303138627Stakawata virtual_end = VM_MAX_KERNEL_ADDRESS; 304138627Stakawata 305138627Stakawata /* 306138627Stakawata * Initialize protection array. 307138627Stakawata */ 308138627Stakawata i386_protection_init(); 309138627Stakawata 310138627Stakawata /* 311242305Sbapt * Initialize the kernel pmap (which is statically allocated). 312138627Stakawata */ 313147196Smarkus kernel_pmap->pm_pdir = (pd_entry_t *) (KERNBASE + (u_int)IdlePTD); 314147196Smarkus kernel_pmap->pm_active = -1; /* don't allow deactivation */ 315147196Smarkus TAILQ_INIT(&kernel_pmap->pm_pvlist); 316148710Smarkus LIST_INIT(&allpmaps); 317148710Smarkus LIST_INSERT_HEAD(&allpmaps, kernel_pmap, pm_list); 318148710Smarkus nkpt = NKPT; 319148710Smarkus 320148710Smarkus /* 321148710Smarkus * Reserve some special page table entries/VA space for temporary 322148710Smarkus * mapping of pages. 323148710Smarkus */ 324148710Smarkus#define SYSMAP(c, p, v, n) \ 325148710Smarkus v = (c)va; va += ((n)*PAGE_SIZE); p = pte; pte += (n); 326167814Sjkim 327148710Smarkus va = virtual_avail; 328148710Smarkus pte = (pt_entry_t *) pmap_pte(kernel_pmap, va); 329148710Smarkus 330148710Smarkus /* 331148710Smarkus * CMAP1/CMAP2 are used for zeroing and copying pages. 332148710Smarkus * CMAP3 is used for the idle process page zeroing. 333148710Smarkus */ 334147196Smarkus SYSMAP(caddr_t, CMAP1, CADDR1, 1) 335148710Smarkus SYSMAP(caddr_t, CMAP2, CADDR2, 1) 336147196Smarkus SYSMAP(caddr_t, CMAP3, CADDR3, 1) 337148710Smarkus 338148710Smarkus /* 339147196Smarkus * Crashdump maps. 340147196Smarkus */ 341138627Stakawata SYSMAP(caddr_t, pt_crashdumpmap, crashdumpmap, MAXDUMPPGS); 342138627Stakawata 343138627Stakawata /* 344147196Smarkus * ptvmmap is used for reading arbitrary physical pages via /dev/mem. 345147196Smarkus * XXX ptmmap is not used. 346147196Smarkus */ 347147196Smarkus SYSMAP(caddr_t, ptmmap, ptvmmap, 1) 348138627Stakawata 349147196Smarkus /* 350138627Stakawata * msgbufp is used to map the system message buffer. 351147196Smarkus * XXX msgbufmap is not used. 352138627Stakawata */ 353138627Stakawata SYSMAP(struct msgbuf *, msgbufmap, msgbufp, 354138627Stakawata atop(round_page(MSGBUF_SIZE))) 355147196Smarkus 356138627Stakawata /* 357147196Smarkus * ptemap is used for pmap_pte_quick 358147196Smarkus */ 359138627Stakawata SYSMAP(pt_entry_t *, PMAP1, PADDR1, 1); 360138627Stakawata 361138627Stakawata virtual_avail = va; 362138627Stakawata 363147196Smarkus *CMAP1 = *CMAP2 = 0; 364147196Smarkus for (i = 0; i < NKPT; i++) 365147196Smarkus PTD[i] = 0; 366147196Smarkus 367147196Smarkus pgeflag = 0; 368147196Smarkus#ifndef DISABLE_PG_G 369147196Smarkus if (cpu_feature & CPUID_PGE) 370147196Smarkus pgeflag = PG_G; 371138627Stakawata#endif 372147196Smarkus 373147196Smarkus/* 374147196Smarkus * Initialize the 4MB page size flag 375147196Smarkus */ 376147196Smarkus pseflag = 0; 377147196Smarkus/* 378138627Stakawata * The 4MB page version of the initial 379147196Smarkus * kernel page mapping. 380147196Smarkus */ 381147196Smarkus pdir4mb = 0; 382138627Stakawata 383147196Smarkus#ifndef DISABLE_PSE 384147196Smarkus if (cpu_feature & CPUID_PSE) { 385147196Smarkus pd_entry_t ptditmp; 386138627Stakawata /* 387147196Smarkus * Note that we have enabled PSE mode 388217323Smdf */ 389147196Smarkus pseflag = PG_PS; 390147196Smarkus ptditmp = *(PTmap + i386_btop(KERNBASE)); 391147196Smarkus ptditmp &= ~(NBPDR - 1); 392138627Stakawata ptditmp |= PG_V | PG_RW | PG_PS | PG_U | pgeflag; 393147196Smarkus pdir4mb = ptditmp; 394147196Smarkus } 395147196Smarkus#endif 396147196Smarkus#ifndef SMP 397138627Stakawata /* 398217323Smdf * Turn on PGE/PSE. SMP does this later on since the 399147196Smarkus * 4K page tables are required for AP boot (for now). 400147196Smarkus * XXX fixme. 401147196Smarkus */ 402147196Smarkus pmap_set_opt(); 403138627Stakawata#endif 404147196Smarkus#ifdef SMP 405147196Smarkus if (cpu_apic_address == 0) 406147196Smarkus panic("pmap_bootstrap: no local apic! (non-SMP hardware?)"); 407147196Smarkus 408147196Smarkus /* local apic is mapped on last page */ 409273377Shselasky SMPpt[NPTEPG - 1] = (pt_entry_t)(PG_V | PG_RW | PG_N | pgeflag | 410273377Shselasky (cpu_apic_address & PG_FRAME)); 411273377Shselasky#endif 412273377Shselasky invltlb(); 413273377Shselasky} 414273377Shselasky 415273377Shselasky/* 416273377Shselasky * Enable 4MB page mode for MP startup. Turn on PG_G support. 417273377Shselasky * BSP will run this after all the AP's have started up. 418273377Shselasky */ 419273377Shselaskyvoid 420273377Shselaskypmap_set_opt(void) 421273377Shselasky{ 422138627Stakawata pt_entry_t *pte; 423147196Smarkus vm_offset_t va, endva; 424147196Smarkus 425147196Smarkus if (pgeflag && (cpu_feature & CPUID_PGE)) { 426147196Smarkus load_cr4(rcr4() | CR4_PGE); 427147196Smarkus invltlb(); /* Insurance */ 428217566Smdf } 429147196Smarkus#ifndef DISABLE_PSE 430147196Smarkus if (pseflag && (cpu_feature & CPUID_PSE)) { 431147196Smarkus load_cr4(rcr4() | CR4_PSE); 432147196Smarkus invltlb(); /* Insurance */ 433237493Siwasaki } 434237493Siwasaki#endif 435237493Siwasaki if (PCPU_GET(cpuid) == 0) { 436237493Siwasaki#ifndef DISABLE_PSE 437237493Siwasaki if (pdir4mb) { 438237493Siwasaki kernel_pmap->pm_pdir[KPTDI] = PTD[KPTDI] = pdir4mb; 439237493Siwasaki invltlb(); /* Insurance */ 440237493Siwasaki } 441237493Siwasaki#endif 442147196Smarkus if (pgeflag) { 443147196Smarkus /* Turn on PG_G for text, data, bss pages. */ 444147196Smarkus va = (vm_offset_t)btext; 445147196Smarkus#ifndef DISABLE_PSE 446147196Smarkus if (pseflag && (cpu_feature & CPUID_PSE)) { 447147246Smarkus if (va < KERNBASE + (1 << PDRSHIFT)) 448169031Smarkus va = KERNBASE + (1 << PDRSHIFT); 449147196Smarkus } 450147196Smarkus#endif 451138627Stakawata endva = KERNBASE + KERNend; 452138627Stakawata while (va < endva) { 453138627Stakawata pte = vtopte(va); 454138627Stakawata if (*pte) 455138627Stakawata *pte |= pgeflag; 456138774Sscottl va += PAGE_SIZE; 457138774Sscottl } 458138627Stakawata invltlb(); /* Insurance */ 459138627Stakawata } 460147196Smarkus /* 461147196Smarkus * We do not need to broadcast the invltlb here, because 462147196Smarkus * each AP does it the moment it is released from the boot 463147196Smarkus * lock. See ap_init(). 464147196Smarkus */ 465147196Smarkus } 466147196Smarkus} 467147196Smarkus 468147246Smarkusstatic void * 469147246Smarkuspmap_allocf(uma_zone_t zone, int bytes, u_int8_t *flags, int wait) 470147246Smarkus{ 471147196Smarkus *flags = UMA_SLAB_PRIV; 472138627Stakawata return (void *)kmem_alloc(kernel_map, bytes); 473147196Smarkus} 474138627Stakawata 475201605Siwasaki/* 476201605Siwasaki * Initialize the pmap module. 477201605Siwasaki * Called by vm_init, to initialize any structures that the pmap 478201605Siwasaki * system needs to map virtual memory. 479201605Siwasaki * pmap_init has been enhanced to support in a fairly consistant 480201605Siwasaki * way, discontiguous physical memory. 481201605Siwasaki */ 482201605Siwasakivoid 483201605Siwasakipmap_init(phys_start, phys_end) 484201605Siwasaki vm_offset_t phys_start, phys_end; 485201605Siwasaki{ 486201605Siwasaki int i; 487273377Shselasky int initial_pvs; 488201605Siwasaki 489201605Siwasaki /* 490201605Siwasaki * object for kernel page table pages 491201605Siwasaki */ 492201605Siwasaki kptobj = vm_object_allocate(OBJT_DEFAULT, NKPDE); 493201605Siwasaki 494201605Siwasaki /* 495201605Siwasaki * Allocate memory for random pmap data structures. Includes the 496201605Siwasaki * pv_head_table. 497201605Siwasaki */ 498147196Smarkus 499138627Stakawata for(i = 0; i < vm_page_array_size; i++) { 500147196Smarkus vm_page_t m; 501147196Smarkus 502147196Smarkus m = &vm_page_array[i]; 503147196Smarkus TAILQ_INIT(&m->md.pv_list); 504147196Smarkus m->md.pv_list_count = 0; 505147196Smarkus } 506147196Smarkus 507147196Smarkus /* 508147196Smarkus * init the pv free list 509147196Smarkus */ 510147196Smarkus initial_pvs = vm_page_array_size; 511147196Smarkus if (initial_pvs < MINPV) 512147196Smarkus initial_pvs = MINPV; 513147196Smarkus pvzone = uma_zcreate("PV ENTRY", sizeof (struct pv_entry), NULL, NULL, 514147196Smarkus NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_VM); 515147196Smarkus uma_zone_set_allocf(pvzone, pmap_allocf); 516147196Smarkus uma_prealloc(pvzone, initial_pvs); 517147196Smarkus 518147196Smarkus /* 519147196Smarkus * Now it is safe to enable pv_table recording. 520147196Smarkus */ 521147196Smarkus pmap_initialized = TRUE; 522147196Smarkus} 523138627Stakawata 524138627Stakawata/* 525138627Stakawata * Initialize the address space (zone) for the pv_entries. Set a 526147196Smarkus * high water mark so that the system can recover from excessive 527138627Stakawata * numbers of pv entries. 528147196Smarkus */ 529147196Smarkusvoid 530147196Smarkuspmap_init2() 531147196Smarkus{ 532147196Smarkus int shpgperproc = PMAP_SHPGPERPROC; 533147196Smarkus 534147196Smarkus TUNABLE_INT_FETCH("vm.pmap.shpgperproc", &shpgperproc); 535147196Smarkus pv_entry_max = shpgperproc * maxproc + vm_page_array_size; 536147196Smarkus TUNABLE_INT_FETCH("vm.pmap.pv_entries", &pv_entry_max); 537147196Smarkus pv_entry_high_water = 9 * (pv_entry_max / 10); 538147196Smarkus uma_zone_set_obj(pvzone, &pvzone_obj, pv_entry_max); 539147196Smarkus} 540147196Smarkus 541147196Smarkus 542147196Smarkus/*************************************************** 543147196Smarkus * Low level helper routines..... 544147196Smarkus ***************************************************/ 545147196Smarkus 546147196Smarkus#if defined(PMAP_DIAGNOSTIC) 547147196Smarkus 548147196Smarkus/* 549147196Smarkus * This code checks for non-writeable/modified pages. 550147196Smarkus * This should be an invalid condition. 551147196Smarkus */ 552147196Smarkusstatic int 553147196Smarkuspmap_nw_modified(pt_entry_t ptea) 554138627Stakawata{ 555147196Smarkus int pte; 556147196Smarkus 557147196Smarkus pte = (int) ptea; 558138627Stakawata 559202771Sjkim if ((pte & (PG_M|PG_RW)) == PG_M) 560147196Smarkus return 1; 561138627Stakawata else 562147196Smarkus return 0; 563147196Smarkus} 564138627Stakawata#endif 565147196Smarkus 566147196Smarkus 567147196Smarkus/* 568147196Smarkus * this routine defines the region(s) of memory that should 569138627Stakawata * not be tested for the modified bit. 570147196Smarkus */ 571147196Smarkusstatic PMAP_INLINE int 572147196Smarkuspmap_track_modified(vm_offset_t va) 573147196Smarkus{ 574147196Smarkus if ((va < kmi.clean_sva) || (va >= kmi.clean_eva)) 575147196Smarkus return 1; 576147196Smarkus else 577147196Smarkus return 0; 578147196Smarkus} 579147196Smarkus 580147196Smarkus#ifdef I386_CPU 581147196Smarkus/* 582147196Smarkus * i386 only has "invalidate everything" and no SMP to worry about. 583147196Smarkus */ 584147196SmarkusPMAP_INLINE void 585147196Smarkuspmap_invalidate_page(pmap_t pmap, vm_offset_t va) 586147196Smarkus{ 587147196Smarkus 588147196Smarkus if (pmap == kernel_pmap || pmap->pm_active) 589147196Smarkus invltlb(); 590147196Smarkus} 591147196Smarkus 592147196SmarkusPMAP_INLINE void 593147196Smarkuspmap_invalidate_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva) 594147196Smarkus{ 595147196Smarkus 596147196Smarkus if (pmap == kernel_pmap || pmap->pm_active) 597147196Smarkus invltlb(); 598147196Smarkus} 599147196Smarkus 600147196SmarkusPMAP_INLINE void 601147196Smarkuspmap_invalidate_all(pmap_t pmap) 602147196Smarkus{ 603147196Smarkus 604147196Smarkus if (pmap == kernel_pmap || pmap->pm_active) 605147196Smarkus invltlb(); 606147196Smarkus} 607147196Smarkus#else /* !I386_CPU */ 608147196Smarkus#ifdef SMP 609147196Smarkus/* 610147196Smarkus * For SMP, these functions have to use the IPI mechanism for coherence. 611147196Smarkus */ 612147196Smarkusvoid 613147196Smarkuspmap_invalidate_page(pmap_t pmap, vm_offset_t va) 614147196Smarkus{ 615147196Smarkus u_int cpumask; 616147196Smarkus u_int other_cpus; 617147196Smarkus 618147196Smarkus critical_enter(); 619147246Smarkus /* 620147196Smarkus * We need to disable interrupt preemption but MUST NOT have 621147196Smarkus * interrupts disabled here. 622147196Smarkus * XXX we may need to hold schedlock to get a coherent pm_active 623147196Smarkus */ 624147196Smarkus if (pmap->pm_active == -1 || pmap->pm_active == all_cpus) { 625147196Smarkus invlpg(va); 626147196Smarkus smp_invlpg(va); 627147196Smarkus } else { 628147196Smarkus cpumask = PCPU_GET(cpumask); 629147196Smarkus other_cpus = PCPU_GET(other_cpus); 630147196Smarkus if (pmap->pm_active & cpumask) 631147196Smarkus invlpg(va); 632147196Smarkus if (pmap->pm_active & other_cpus) 633147196Smarkus smp_masked_invlpg(pmap->pm_active & other_cpus, va); 634147196Smarkus } 635147196Smarkus critical_exit(); 636147196Smarkus} 637147196Smarkus 638147196Smarkusvoid 639147196Smarkuspmap_invalidate_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva) 640147196Smarkus{ 641147196Smarkus u_int cpumask; 642147196Smarkus u_int other_cpus; 643147196Smarkus vm_offset_t addr; 644147196Smarkus 645147196Smarkus critical_enter(); 646147196Smarkus /* 647147196Smarkus * We need to disable interrupt preemption but MUST NOT have 648147196Smarkus * interrupts disabled here. 649147196Smarkus * XXX we may need to hold schedlock to get a coherent pm_active 650138627Stakawata */ 651147196Smarkus if (pmap->pm_active == -1 || pmap->pm_active == all_cpus) { 652147196Smarkus for (addr = sva; addr < eva; addr += PAGE_SIZE) 653147196Smarkus invlpg(addr); 654147196Smarkus smp_invlpg_range(sva, eva); 655147196Smarkus } else { 656138627Stakawata cpumask = PCPU_GET(cpumask); 657154326Smarkus other_cpus = PCPU_GET(other_cpus); 658154326Smarkus if (pmap->pm_active & cpumask) 659154326Smarkus for (addr = sva; addr < eva; addr += PAGE_SIZE) 660154326Smarkus invlpg(addr); 661154326Smarkus if (pmap->pm_active & other_cpus) 662154326Smarkus smp_masked_invlpg_range(pmap->pm_active & other_cpus, 663154326Smarkus sva, eva); 664154326Smarkus } 665154326Smarkus critical_exit(); 666154326Smarkus} 667154326Smarkus 668154326Smarkusvoid 669154326Smarkuspmap_invalidate_all(pmap_t pmap) 670154326Smarkus{ 671154326Smarkus u_int cpumask; 672154326Smarkus u_int other_cpus; 673147196Smarkus 674147196Smarkus#ifdef SWTCH_OPTIM_STATS 675147196Smarkus tlb_flush_count++; 676147196Smarkus#endif 677138627Stakawata critical_enter(); 678147196Smarkus /* 679147196Smarkus * We need to disable interrupt preemption but MUST NOT have 680147196Smarkus * interrupts disabled here. 681138627Stakawata * XXX we may need to hold schedlock to get a coherent pm_active 682147196Smarkus */ 683147196Smarkus if (pmap->pm_active == -1 || pmap->pm_active == all_cpus) { 684138627Stakawata invltlb(); 685138627Stakawata smp_invltlb(); 686138627Stakawata } else { 687147196Smarkus cpumask = PCPU_GET(cpumask); 688138627Stakawata other_cpus = PCPU_GET(other_cpus); 689237493Siwasaki if (pmap->pm_active & cpumask) 690202771Sjkim invltlb(); 691147196Smarkus if (pmap->pm_active & other_cpus) 692138627Stakawata smp_masked_invltlb(pmap->pm_active & other_cpus); 693147196Smarkus } 694147196Smarkus critical_exit(); 695138627Stakawata} 696147196Smarkus#else /* !SMP */ 697147196Smarkus/* 698147196Smarkus * Normal, non-SMP, 486+ invalidation functions. 699147196Smarkus * We inline these within pmap.c for speed. 700138627Stakawata */ 701147196SmarkusPMAP_INLINE void 702147196Smarkuspmap_invalidate_page(pmap_t pmap, vm_offset_t va) 703147196Smarkus{ 704147196Smarkus 705147196Smarkus if (pmap == kernel_pmap || pmap->pm_active) 706147196Smarkus invlpg(va); 707138627Stakawata} 708147196Smarkus 709147196SmarkusPMAP_INLINE void 710147196Smarkuspmap_invalidate_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva) 711147196Smarkus{ 712138627Stakawata vm_offset_t addr; 713147196Smarkus 714237493Siwasaki if (pmap == kernel_pmap || pmap->pm_active) 715147196Smarkus for (addr = sva; addr < eva; addr += PAGE_SIZE) 716138627Stakawata invlpg(addr); 717147196Smarkus} 718237493Siwasaki 719147196SmarkusPMAP_INLINE void 720138627Stakawatapmap_invalidate_all(pmap_t pmap) 721147196Smarkus{ 722237493Siwasaki 723147196Smarkus if (pmap == kernel_pmap || pmap->pm_active) 724147196Smarkus invltlb(); 725147196Smarkus} 726237493Siwasaki#endif /* !SMP */ 727147196Smarkus#endif /* !I386_CPU */ 728147196Smarkus 729147196Smarkus/* 730237493Siwasaki * Return an address which is the base of the Virtual mapping of 731147196Smarkus * all the PTEs for the given pmap. Note this doesn't say that 732154326Smarkus * all the PTEs will be present or that the pages there are valid. 733154326Smarkus * The PTEs are made available by the recursive mapping trick. 734154326Smarkus * It will map in the alternate PTE space if needed. 735154326Smarkus */ 736154326Smarkusstatic pt_entry_t * 737154326Smarkusget_ptbase(pmap) 738154326Smarkus pmap_t pmap; 739154326Smarkus{ 740154326Smarkus pd_entry_t frame; 741154326Smarkus 742154326Smarkus /* are we current address space or kernel? */ 743154326Smarkus if (pmap == kernel_pmap) 744154326Smarkus return PTmap; 745154326Smarkus frame = pmap->pm_pdir[PTDPTDI] & PG_FRAME; 746154326Smarkus if (frame == (PTDpde & PG_FRAME)) 747154326Smarkus return PTmap; 748154326Smarkus /* otherwise, we are alternate address space */ 749154326Smarkus if (frame != (APTDpde & PG_FRAME)) { 750154326Smarkus APTDpde = (pd_entry_t) (frame | PG_RW | PG_V); 751154326Smarkus pmap_invalidate_all(kernel_pmap); /* XXX Bandaid */ 752154326Smarkus } 753154326Smarkus return APTmap; 754154326Smarkus} 755154326Smarkus 756154326Smarkus/* 757154326Smarkus * Super fast pmap_pte routine best used when scanning 758147196Smarkus * the pv lists. This eliminates many coarse-grained 759147196Smarkus * invltlb calls. Note that many of the pv list 760147196Smarkus * scans are across different pmaps. It is very wasteful 761138627Stakawata * to do an entire invltlb for checking a single mapping. 762138627Stakawata */ 763147196Smarkus 764147196Smarkusstatic pt_entry_t * 765138627Stakawatapmap_pte_quick(pmap, va) 766147196Smarkus register pmap_t pmap; 767147196Smarkus vm_offset_t va; 768147196Smarkus{ 769138627Stakawata pd_entry_t pde, newpf; 770147196Smarkus pde = pmap->pm_pdir[va >> PDRSHIFT]; 771147196Smarkus if (pde != 0) { 772147196Smarkus pd_entry_t frame = pmap->pm_pdir[PTDPTDI] & PG_FRAME; 773147196Smarkus unsigned index = i386_btop(va); 774138627Stakawata /* are we current address space or kernel? */ 775147196Smarkus if (pmap == kernel_pmap || frame == (PTDpde & PG_FRAME)) 776147196Smarkus return PTmap + index; 777147196Smarkus newpf = pde & PG_FRAME; 778147196Smarkus if (((*PMAP1) & PG_FRAME) != newpf) { 779147196Smarkus *PMAP1 = newpf | PG_RW | PG_V; 780147196Smarkus pmap_invalidate_page(kernel_pmap, (vm_offset_t)PADDR1); 781147196Smarkus } 782147196Smarkus return PADDR1 + (index & (NPTEPG - 1)); 783147196Smarkus } 784147196Smarkus return (0); 785147196Smarkus} 786147196Smarkus 787169031Smarkus/* 788169031Smarkus * Routine: pmap_extract 789147196Smarkus * Function: 790147196Smarkus * Extract the physical page address associated 791147196Smarkus * with the given map/virtual_address pair. 792147196Smarkus */ 793147196Smarkusvm_offset_t 794147196Smarkuspmap_extract(pmap, va) 795147196Smarkus register pmap_t pmap; 796147196Smarkus vm_offset_t va; 797147196Smarkus{ 798147196Smarkus vm_offset_t rtval; /* XXX FIXME */ 799147196Smarkus vm_offset_t pdirindex; 800147196Smarkus 801147196Smarkus if (pmap == 0) 802147196Smarkus return 0; 803147196Smarkus pdirindex = va >> PDRSHIFT; 804147196Smarkus rtval = pmap->pm_pdir[pdirindex]; 805147196Smarkus if (rtval != 0) { 806147196Smarkus pt_entry_t *pte; 807147196Smarkus if ((rtval & PG_PS) != 0) { 808147196Smarkus rtval &= ~(NBPDR - 1); 809169031Smarkus rtval |= va & (NBPDR - 1); 810169031Smarkus return rtval; 811169031Smarkus } 812169031Smarkus pte = get_ptbase(pmap) + i386_btop(va); 813147196Smarkus rtval = ((*pte & PG_FRAME) | (va & PAGE_MASK)); 814147196Smarkus return rtval; 815147196Smarkus } 816147196Smarkus return 0; 817169031Smarkus 818169031Smarkus} 819147196Smarkus 820147196Smarkus/*************************************************** 821147196Smarkus * Low level mapping routines..... 822147196Smarkus ***************************************************/ 823147196Smarkus 824147196Smarkus/* 825147196Smarkus * Add a wired page to the kva. 826147196Smarkus * Note: not SMP coherent. 827147196Smarkus */ 828147196SmarkusPMAP_INLINE void 829147196Smarkuspmap_kenter(vm_offset_t va, vm_offset_t pa) 830147196Smarkus{ 831147196Smarkus pt_entry_t *pte; 832147196Smarkus 833147196Smarkus pte = vtopte(va); 834147196Smarkus *pte = pa | PG_RW | PG_V | pgeflag; 835154326Smarkus} 836147196Smarkus 837147196Smarkus/* 838147196Smarkus * Remove a page from the kernel pagetables. 839147196Smarkus * Note: not SMP coherent. 840147196Smarkus */ 841147196SmarkusPMAP_INLINE void 842147196Smarkuspmap_kremove(vm_offset_t va) 843147196Smarkus{ 844147196Smarkus pt_entry_t *pte; 845147196Smarkus 846147196Smarkus pte = vtopte(va); 847147196Smarkus *pte = 0; 848147196Smarkus} 849147196Smarkus 850147196Smarkus/* 851237493Siwasaki * Used to map a range of physical addresses into kernel 852237493Siwasaki * virtual address space. 853237493Siwasaki * 854147196Smarkus * The value passed in '*virt' is a suggested virtual address for 855147196Smarkus * the mapping. Architectures which can support a direct-mapped 856138627Stakawata * physical to virtual region can return the appropriate address 857138627Stakawata * within that region, leaving '*virt' unchanged. Other 858138627Stakawata * architectures should map the pages starting at '*virt' and 859147196Smarkus * update '*virt' with the first usable address after the mapped 860138627Stakawata * region. 861147196Smarkus */ 862147196Smarkusvm_offset_t 863147196Smarkuspmap_map(vm_offset_t *virt, vm_offset_t start, vm_offset_t end, int prot) 864147196Smarkus{ 865138627Stakawata vm_offset_t va, sva; 866147196Smarkus 867138627Stakawata va = sva = *virt; 868147196Smarkus while (start < end) { 869138627Stakawata pmap_kenter(va, start); 870147196Smarkus va += PAGE_SIZE; 871138627Stakawata start += PAGE_SIZE; 872147196Smarkus } 873147196Smarkus pmap_invalidate_range(kernel_pmap, sva, va); 874147196Smarkus *virt = va; 875147196Smarkus return (sva); 876147196Smarkus} 877147196Smarkus 878147196Smarkus 879147196Smarkus/* 880147196Smarkus * Add a list of wired pages to the kva 881147196Smarkus * this routine is only used for temporary 882147196Smarkus * kernel mappings that do not need to have 883147196Smarkus * page modification or references recorded. 884147196Smarkus * Note that old mappings are simply written 885147196Smarkus * over. The page *must* be wired. 886147196Smarkus * Note: SMP coherent. Uses a ranged shootdown IPI. 887147196Smarkus */ 888147196Smarkusvoid 889147196Smarkuspmap_qenter(vm_offset_t sva, vm_page_t *m, int count) 890147196Smarkus{ 891138627Stakawata vm_offset_t va; 892138627Stakawata 893237493Siwasaki va = sva; 894237493Siwasaki while (count-- > 0) { 895237493Siwasaki pmap_kenter(va, VM_PAGE_TO_PHYS(*m)); 896237493Siwasaki va += PAGE_SIZE; 897237493Siwasaki m++; 898237493Siwasaki } 899237493Siwasaki pmap_invalidate_range(kernel_pmap, sva, va); 900237493Siwasaki} 901237493Siwasaki 902273773Shselasky/* 903237493Siwasaki * This routine tears out page mappings from the 904237493Siwasaki * kernel -- it is meant only for temporary mappings. 905237493Siwasaki * Note: SMP coherent. Uses a ranged shootdown IPI. 906237493Siwasaki */ 907237493Siwasakivoid 908237493Siwasakipmap_qremove(vm_offset_t sva, int count) 909237493Siwasaki{ 910237493Siwasaki vm_offset_t va; 911237493Siwasaki 912237493Siwasaki va = sva; 913237493Siwasaki while (count-- > 0) { 914237493Siwasaki pmap_kremove(va); 915237493Siwasaki va += PAGE_SIZE; 916237493Siwasaki } 917237493Siwasaki pmap_invalidate_range(kernel_pmap, sva, va); 918237493Siwasaki} 919237493Siwasaki 920237493Siwasakistatic vm_page_t 921237493Siwasakipmap_page_lookup(vm_object_t object, vm_pindex_t pindex) 922237493Siwasaki{ 923237493Siwasaki vm_page_t m; 924273773Shselasky 925237493Siwasakiretry: 926237493Siwasaki m = vm_page_lookup(object, pindex); 927273773Shselasky if (m != NULL) { 928273773Shselasky vm_page_lock_queues(); 929273773Shselasky if (vm_page_sleep_if_busy(m, FALSE, "pplookp")) 930237493Siwasaki goto retry; 931237493Siwasaki vm_page_unlock_queues(); 932237493Siwasaki } 933237493Siwasaki return m; 934237493Siwasaki} 935273773Shselasky 936237493Siwasaki#ifndef KSTACK_MAX_PAGES 937237493Siwasaki#define KSTACK_MAX_PAGES 32 938237493Siwasaki#endif 939237493Siwasaki 940237493Siwasaki/* 941237493Siwasaki * Create the kernel stack (including pcb for i386) for a new thread. 942237493Siwasaki * This routine directly affects the fork perf for a process and 943237493Siwasaki * create performance for a thread. 944237493Siwasaki */ 945237493Siwasakivoid 946237493Siwasakipmap_new_thread(struct thread *td, int pages) 947237493Siwasaki{ 948237493Siwasaki int i; 949237493Siwasaki vm_page_t ma[KSTACK_MAX_PAGES]; 950237493Siwasaki vm_object_t ksobj; 951237493Siwasaki vm_page_t m; 952237493Siwasaki vm_offset_t ks; 953237493Siwasaki 954237493Siwasaki /* Bounds check */ 955237493Siwasaki if (pages <= 1) 956237493Siwasaki pages = KSTACK_PAGES; 957237493Siwasaki else if (pages > KSTACK_MAX_PAGES) 958237493Siwasaki pages = KSTACK_MAX_PAGES; 959237493Siwasaki 960237493Siwasaki /* 961237493Siwasaki * allocate object for the kstack 962237493Siwasaki */ 963237493Siwasaki ksobj = vm_object_allocate(OBJT_DEFAULT, pages); 964237493Siwasaki td->td_kstack_obj = ksobj; 965237493Siwasaki 966237493Siwasaki /* get a kernel virtual address for the kstack for this thread */ 967237493Siwasaki#ifdef KSTACK_GUARD 968237493Siwasaki ks = kmem_alloc_nofault(kernel_map, (pages + 1) * PAGE_SIZE); 969237493Siwasaki if (ks == 0) 970237493Siwasaki panic("pmap_new_thread: kstack allocation failed"); 971237493Siwasaki if (*vtopte(ks) != 0) 972237493Siwasaki pmap_qremove(ks, 1); 973237493Siwasaki ks += PAGE_SIZE; 974237493Siwasaki td->td_kstack = ks; 975237493Siwasaki#else 976237493Siwasaki /* get a kernel virtual address for the kstack for this thread */ 977237493Siwasaki ks = kmem_alloc_nofault(kernel_map, pages * PAGE_SIZE); 978237493Siwasaki if (ks == 0) 979237493Siwasaki panic("pmap_new_thread: kstack allocation failed"); 980237493Siwasaki td->td_kstack = ks; 981237493Siwasaki#endif 982237493Siwasaki /* 983237493Siwasaki * Knowing the number of pages allocated is useful when you 984237493Siwasaki * want to deallocate them. 985237493Siwasaki */ 986237493Siwasaki td->td_kstack_pages = pages; 987237493Siwasaki 988237493Siwasaki /* 989237493Siwasaki * For the length of the stack, link in a real page of ram for each 990237493Siwasaki * page of stack. 991237493Siwasaki */ 992237493Siwasaki for (i = 0; i < pages; i++) { 993237493Siwasaki /* 994237493Siwasaki * Get a kernel stack page 995237493Siwasaki */ 996237493Siwasaki m = vm_page_grab(ksobj, i, 997237493Siwasaki VM_ALLOC_NORMAL | VM_ALLOC_RETRY | VM_ALLOC_WIRED); 998237493Siwasaki ma[i] = m; 999237493Siwasaki 1000237493Siwasaki vm_page_lock_queues(); 1001237493Siwasaki vm_page_wakeup(m); 1002237493Siwasaki vm_page_flag_clear(m, PG_ZERO); 1003237493Siwasaki m->valid = VM_PAGE_BITS_ALL; 1004237493Siwasaki vm_page_unlock_queues(); 1005237493Siwasaki } 1006237493Siwasaki pmap_qenter(ks, ma, pages); 1007237493Siwasaki} 1008237493Siwasaki 1009237493Siwasaki/* 1010237493Siwasaki * Dispose the kernel stack for a thread that has exited. 1011237493Siwasaki * This routine directly impacts the exit perf of a process and thread. 1012237493Siwasaki */ 1013237493Siwasakivoid 1014237493Siwasakipmap_dispose_thread(td) 1015237493Siwasaki struct thread *td; 1016237493Siwasaki{ 1017237493Siwasaki int i; 1018237493Siwasaki int pages; 1019237493Siwasaki vm_object_t ksobj; 1020237493Siwasaki vm_offset_t ks; 1021237493Siwasaki vm_page_t m; 1022237493Siwasaki 1023237493Siwasaki pages = td->td_kstack_pages; 1024237493Siwasaki ksobj = td->td_kstack_obj; 1025237493Siwasaki ks = td->td_kstack; 1026237493Siwasaki pmap_qremove(ks, pages); 1027237493Siwasaki for (i = 0; i < pages; i++) { 1028237493Siwasaki m = vm_page_lookup(ksobj, i); 1029237493Siwasaki if (m == NULL) 1030237493Siwasaki panic("pmap_dispose_thread: kstack already missing?"); 1031237493Siwasaki vm_page_lock_queues(); 1032237493Siwasaki vm_page_busy(m); 1033237493Siwasaki vm_page_unwire(m, 0); 1034237493Siwasaki vm_page_free(m); 1035237493Siwasaki vm_page_unlock_queues(); 1036237493Siwasaki } 1037237493Siwasaki /* 1038237493Siwasaki * Free the space that this stack was mapped to in the kernel 1039237493Siwasaki * address map. 1040237493Siwasaki */ 1041237493Siwasaki#ifdef KSTACK_GUARD 1042237493Siwasaki kmem_free(kernel_map, ks - PAGE_SIZE, (pages + 1) * PAGE_SIZE); 1043237493Siwasaki#else 1044237493Siwasaki kmem_free(kernel_map, ks, pages * PAGE_SIZE); 1045237493Siwasaki#endif 1046237493Siwasaki vm_object_deallocate(ksobj); 1047237493Siwasaki} 1048237493Siwasaki 1049237493Siwasaki/* 1050237493Siwasaki * Set up a variable sized alternate kstack. Though it may look MI, it may 1051237493Siwasaki * need to be different on certain arches like ia64. 1052237493Siwasaki */ 1053237493Siwasakivoid 1054237493Siwasakipmap_new_altkstack(struct thread *td, int pages) 1055237493Siwasaki{ 1056237493Siwasaki /* shuffle the original stack */ 1057237493Siwasaki td->td_altkstack_obj = td->td_kstack_obj; 1058237493Siwasaki td->td_altkstack = td->td_kstack; 1059237493Siwasaki td->td_altkstack_pages = td->td_kstack_pages; 1060237493Siwasaki 1061237493Siwasaki pmap_new_thread(td, pages); 1062237493Siwasaki} 1063237493Siwasaki 1064237493Siwasakivoid 1065237493Siwasakipmap_dispose_altkstack(td) 1066237493Siwasaki struct thread *td; 1067237493Siwasaki{ 1068237493Siwasaki pmap_dispose_thread(td); 1069237493Siwasaki 1070237493Siwasaki /* restore the original kstack */ 1071237493Siwasaki td->td_kstack = td->td_altkstack; 1072237493Siwasaki td->td_kstack_obj = td->td_altkstack_obj; 1073237493Siwasaki td->td_kstack_pages = td->td_altkstack_pages; 1074237493Siwasaki td->td_altkstack = 0; 1075237493Siwasaki td->td_altkstack_obj = NULL; 1076237493Siwasaki td->td_altkstack_pages = 0; 1077237493Siwasaki} 1078237493Siwasaki 1079237493Siwasaki/* 1080237493Siwasaki * Allow the Kernel stack for a thread to be prejudicially paged out. 1081237493Siwasaki */ 1082237493Siwasakivoid 1083237493Siwasakipmap_swapout_thread(td) 1084237493Siwasaki struct thread *td; 1085237493Siwasaki{ 1086237493Siwasaki int i; 1087237493Siwasaki int pages; 1088237493Siwasaki vm_object_t ksobj; 1089237493Siwasaki vm_offset_t ks; 1090237493Siwasaki vm_page_t m; 1091237493Siwasaki 1092237493Siwasaki pages = td->td_kstack_pages; 1093237493Siwasaki ksobj = td->td_kstack_obj; 1094237493Siwasaki ks = td->td_kstack; 1095237493Siwasaki pmap_qremove(ks, pages); 1096237493Siwasaki for (i = 0; i < pages; i++) { 1097237493Siwasaki m = vm_page_lookup(ksobj, i); 1098237493Siwasaki if (m == NULL) 1099237493Siwasaki panic("pmap_swapout_thread: kstack already missing?"); 1100237493Siwasaki vm_page_lock_queues(); 1101237493Siwasaki vm_page_dirty(m); 1102237493Siwasaki vm_page_unwire(m, 0); 1103237493Siwasaki vm_page_unlock_queues(); 1104237493Siwasaki } 1105237493Siwasaki} 1106237493Siwasaki 1107237493Siwasaki/* 1108237493Siwasaki * Bring the kernel stack for a specified thread back in. 1109237493Siwasaki */ 1110237493Siwasakivoid 1111237493Siwasakipmap_swapin_thread(td) 1112237493Siwasaki struct thread *td; 1113237493Siwasaki{ 1114237493Siwasaki int i, rv; 1115237493Siwasaki int pages; 1116237493Siwasaki vm_page_t ma[KSTACK_MAX_PAGES]; 1117237493Siwasaki vm_object_t ksobj; 1118237493Siwasaki vm_offset_t ks; 1119237493Siwasaki vm_page_t m; 1120237493Siwasaki 1121237493Siwasaki pages = td->td_kstack_pages; 1122237493Siwasaki ksobj = td->td_kstack_obj; 1123237493Siwasaki ks = td->td_kstack; 1124237493Siwasaki for (i = 0; i < pages; i++) { 1125237493Siwasaki m = vm_page_grab(ksobj, i, VM_ALLOC_NORMAL | VM_ALLOC_RETRY); 1126237493Siwasaki if (m->valid != VM_PAGE_BITS_ALL) { 1127237493Siwasaki rv = vm_pager_get_pages(ksobj, &m, 1, 0); 1128237493Siwasaki if (rv != VM_PAGER_OK) 1129237493Siwasaki panic("pmap_swapin_thread: cannot get kstack for proc: %d\n", td->td_proc->p_pid); 1130237493Siwasaki m = vm_page_lookup(ksobj, i); 1131237493Siwasaki m->valid = VM_PAGE_BITS_ALL; 1132237493Siwasaki } 1133237493Siwasaki ma[i] = m; 1134237493Siwasaki vm_page_lock_queues(); 1135237493Siwasaki vm_page_wire(m); 1136237493Siwasaki vm_page_wakeup(m); 1137237493Siwasaki vm_page_unlock_queues(); 1138237493Siwasaki } 1139237493Siwasaki pmap_qenter(ks, ma, pages); 1140237493Siwasaki} 1141237493Siwasaki 1142237493Siwasaki/*************************************************** 1143237493Siwasaki * Page table page management routines..... 1144237493Siwasaki ***************************************************/ 1145237493Siwasaki 1146237493Siwasaki/* 1147237493Siwasaki * This routine unholds page table pages, and if the hold count 1148237493Siwasaki * drops to zero, then it decrements the wire count. 1149237493Siwasaki */ 1150237493Siwasakistatic int 1151237493Siwasaki_pmap_unwire_pte_hold(pmap_t pmap, vm_page_t m) 1152237493Siwasaki{ 1153237493Siwasaki 1154237493Siwasaki while (vm_page_sleep_if_busy(m, FALSE, "pmuwpt")) 1155147196Smarkus vm_page_lock_queues(); 1156237493Siwasaki 1157237493Siwasaki if (m->hold_count == 0) { 1158237493Siwasaki vm_offset_t pteva; 1159237493Siwasaki /* 1160237493Siwasaki * unmap the page table page 1161237493Siwasaki */ 1162237493Siwasaki pmap->pm_pdir[m->pindex] = 0; 1163237493Siwasaki --pmap->pm_stats.resident_count; 1164237493Siwasaki if ((pmap->pm_pdir[PTDPTDI] & PG_FRAME) == 1165237493Siwasaki (PTDpde & PG_FRAME)) { 1166237493Siwasaki /* 1167237493Siwasaki * Do an invltlb to make the invalidated mapping 1168237493Siwasaki * take effect immediately. 1169237493Siwasaki */ 1170237493Siwasaki pteva = VM_MAXUSER_ADDRESS + i386_ptob(m->pindex); 1171237493Siwasaki pmap_invalidate_page(pmap, pteva); 1172237493Siwasaki } 1173237493Siwasaki 1174237493Siwasaki if (pmap->pm_ptphint == m) 1175237493Siwasaki pmap->pm_ptphint = NULL; 1176237493Siwasaki 1177237493Siwasaki /* 1178237493Siwasaki * If the page is finally unwired, simply free it. 1179237493Siwasaki */ 1180237493Siwasaki --m->wire_count; 1181237493Siwasaki if (m->wire_count == 0) { 1182237493Siwasaki vm_page_busy(m); 1183237493Siwasaki vm_page_free_zero(m); 1184237493Siwasaki --cnt.v_wire_count; 1185237493Siwasaki } 1186237493Siwasaki return 1; 1187237493Siwasaki } 1188237493Siwasaki return 0; 1189237493Siwasaki} 1190237493Siwasaki 1191237493Siwasakistatic PMAP_INLINE int 1192237493Siwasakipmap_unwire_pte_hold(pmap_t pmap, vm_page_t m) 1193237493Siwasaki{ 1194237493Siwasaki vm_page_unhold(m); 1195237493Siwasaki if (m->hold_count == 0) 1196237493Siwasaki return _pmap_unwire_pte_hold(pmap, m); 1197237493Siwasaki else 1198237493Siwasaki return 0; 1199237493Siwasaki} 1200237493Siwasaki 1201237493Siwasaki/* 1202237493Siwasaki * After removing a page table entry, this routine is used to 1203237493Siwasaki * conditionally free the page, and manage the hold/wire counts. 1204237493Siwasaki */ 1205237493Siwasakistatic int 1206237493Siwasakipmap_unuse_pt(pmap_t pmap, vm_offset_t va, vm_page_t mpte) 1207237493Siwasaki{ 1208237493Siwasaki unsigned ptepindex; 1209237493Siwasaki if (va >= VM_MAXUSER_ADDRESS) 1210237493Siwasaki return 0; 1211237493Siwasaki 1212237493Siwasaki if (mpte == NULL) { 1213237493Siwasaki ptepindex = (va >> PDRSHIFT); 1214237493Siwasaki if (pmap->pm_ptphint && 1215237493Siwasaki (pmap->pm_ptphint->pindex == ptepindex)) { 1216237493Siwasaki mpte = pmap->pm_ptphint; 1217237493Siwasaki } else { 1218147196Smarkus while ((mpte = vm_page_lookup(pmap->pm_pteobj, ptepindex)) != NULL && 1219138627Stakawata vm_page_sleep_if_busy(mpte, FALSE, "pulook")) 1220147196Smarkus vm_page_lock_queues(); 1221147196Smarkus pmap->pm_ptphint = mpte; 1222138627Stakawata } 1223138627Stakawata } 1224147196Smarkus 1225138627Stakawata return pmap_unwire_pte_hold(pmap, mpte); 1226147196Smarkus} 1227161289Stakawata 1228138627Stakawatavoid 1229147196Smarkuspmap_pinit0(pmap) 1230147196Smarkus struct pmap *pmap; 1231138627Stakawata{ 1232147196Smarkus pmap->pm_pdir = 1233147196Smarkus (pd_entry_t *)kmem_alloc_pageable(kernel_map, PAGE_SIZE); 1234147196Smarkus pmap_kenter((vm_offset_t)pmap->pm_pdir, (vm_offset_t)IdlePTD); 1235147196Smarkus#ifndef I386_CPU 1236147196Smarkus invlpg((vm_offset_t)pmap->pm_pdir); 1237147196Smarkus#else 1238147196Smarkus invltlb(); 1239147196Smarkus#endif 1240147196Smarkus pmap->pm_ptphint = NULL; 1241161289Stakawata pmap->pm_active = 0; 1242147196Smarkus TAILQ_INIT(&pmap->pm_pvlist); 1243147196Smarkus bzero(&pmap->pm_stats, sizeof pmap->pm_stats); 1244147196Smarkus LIST_INSERT_HEAD(&allpmaps, pmap, pm_list); 1245237493Siwasaki} 1246237493Siwasaki 1247237493Siwasaki/* 1248237493Siwasaki * Initialize a preallocated and zeroed pmap structure, 1249147196Smarkus * such as one in a vmspace structure. 1250147196Smarkus */ 1251147196Smarkusvoid 1252147196Smarkuspmap_pinit(pmap) 1253147196Smarkus register struct pmap *pmap; 1254147196Smarkus{ 1255147196Smarkus vm_page_t ptdpg; 1256138627Stakawata 1257 /* 1258 * No need to allocate page table space yet but we do need a valid 1259 * page directory table. 1260 */ 1261 if (pmap->pm_pdir == NULL) 1262 pmap->pm_pdir = 1263 (pd_entry_t *)kmem_alloc_pageable(kernel_map, PAGE_SIZE); 1264 1265 /* 1266 * allocate object for the ptes 1267 */ 1268 if (pmap->pm_pteobj == NULL) 1269 pmap->pm_pteobj = vm_object_allocate(OBJT_DEFAULT, PTDPTDI + 1); 1270 1271 /* 1272 * allocate the page directory page 1273 */ 1274 ptdpg = vm_page_grab(pmap->pm_pteobj, PTDPTDI, 1275 VM_ALLOC_NORMAL | VM_ALLOC_RETRY | VM_ALLOC_WIRED | VM_ALLOC_ZERO); 1276 vm_page_lock_queues(); 1277 vm_page_flag_clear(ptdpg, PG_BUSY); 1278 ptdpg->valid = VM_PAGE_BITS_ALL; 1279 vm_page_unlock_queues(); 1280 1281 pmap_qenter((vm_offset_t) pmap->pm_pdir, &ptdpg, 1); 1282 if ((ptdpg->flags & PG_ZERO) == 0) 1283 bzero(pmap->pm_pdir, PAGE_SIZE); 1284 1285 LIST_INSERT_HEAD(&allpmaps, pmap, pm_list); 1286 /* Wire in kernel global address entries. */ 1287 /* XXX copies current process, does not fill in MPPTDI */ 1288 bcopy(PTD + KPTDI, pmap->pm_pdir + KPTDI, nkpt * PTESIZE); 1289#ifdef SMP 1290 pmap->pm_pdir[MPPTDI] = PTD[MPPTDI]; 1291#endif 1292 1293 /* install self-referential address mapping entry */ 1294 pmap->pm_pdir[PTDPTDI] = 1295 VM_PAGE_TO_PHYS(ptdpg) | PG_V | PG_RW | PG_A | PG_M; 1296 1297 pmap->pm_active = 0; 1298 pmap->pm_ptphint = NULL; 1299 TAILQ_INIT(&pmap->pm_pvlist); 1300 bzero(&pmap->pm_stats, sizeof pmap->pm_stats); 1301} 1302 1303/* 1304 * Wire in kernel global address entries. To avoid a race condition 1305 * between pmap initialization and pmap_growkernel, this procedure 1306 * should be called after the vmspace is attached to the process 1307 * but before this pmap is activated. 1308 */ 1309void 1310pmap_pinit2(pmap) 1311 struct pmap *pmap; 1312{ 1313 /* XXX: Remove this stub when no longer called */ 1314} 1315 1316static int 1317pmap_release_free_page(pmap_t pmap, vm_page_t p) 1318{ 1319 pd_entry_t *pde = pmap->pm_pdir; 1320 1321 /* 1322 * This code optimizes the case of freeing non-busy 1323 * page-table pages. Those pages are zero now, and 1324 * might as well be placed directly into the zero queue. 1325 */ 1326 vm_page_lock_queues(); 1327 if (vm_page_sleep_if_busy(p, FALSE, "pmaprl")) 1328 return (0); 1329 vm_page_busy(p); 1330 1331 /* 1332 * Remove the page table page from the processes address space. 1333 */ 1334 pde[p->pindex] = 0; 1335 pmap->pm_stats.resident_count--; 1336 1337 if (p->hold_count) { 1338 panic("pmap_release: freeing held page table page"); 1339 } 1340 /* 1341 * Page directory pages need to have the kernel 1342 * stuff cleared, so they can go into the zero queue also. 1343 */ 1344 if (p->pindex == PTDPTDI) { 1345 bzero(pde + KPTDI, nkpt * PTESIZE); 1346#ifdef SMP 1347 pde[MPPTDI] = 0; 1348#endif 1349 pde[APTDPTDI] = 0; 1350 pmap_kremove((vm_offset_t) pmap->pm_pdir); 1351 } 1352 1353 if (pmap->pm_ptphint == p) 1354 pmap->pm_ptphint = NULL; 1355 1356 p->wire_count--; 1357 cnt.v_wire_count--; 1358 vm_page_free_zero(p); 1359 vm_page_unlock_queues(); 1360 return 1; 1361} 1362 1363/* 1364 * this routine is called if the page table page is not 1365 * mapped correctly. 1366 */ 1367static vm_page_t 1368_pmap_allocpte(pmap, ptepindex) 1369 pmap_t pmap; 1370 unsigned ptepindex; 1371{ 1372 vm_offset_t pteva, ptepa; /* XXXPA */ 1373 vm_page_t m; 1374 1375 /* 1376 * Find or fabricate a new pagetable page 1377 */ 1378 m = vm_page_grab(pmap->pm_pteobj, ptepindex, 1379 VM_ALLOC_WIRED | VM_ALLOC_ZERO | VM_ALLOC_RETRY); 1380 1381 KASSERT(m->queue == PQ_NONE, 1382 ("_pmap_allocpte: %p->queue != PQ_NONE", m)); 1383 1384 /* 1385 * Increment the hold count for the page table page 1386 * (denoting a new mapping.) 1387 */ 1388 m->hold_count++; 1389 1390 /* 1391 * Map the pagetable page into the process address space, if 1392 * it isn't already there. 1393 */ 1394 1395 pmap->pm_stats.resident_count++; 1396 1397 ptepa = VM_PAGE_TO_PHYS(m); 1398 pmap->pm_pdir[ptepindex] = 1399 (pd_entry_t) (ptepa | PG_U | PG_RW | PG_V | PG_A | PG_M); 1400 1401 /* 1402 * Set the page table hint 1403 */ 1404 pmap->pm_ptphint = m; 1405 1406 /* 1407 * Try to use the new mapping, but if we cannot, then 1408 * do it with the routine that maps the page explicitly. 1409 */ 1410 if ((m->flags & PG_ZERO) == 0) { 1411 if ((pmap->pm_pdir[PTDPTDI] & PG_FRAME) == 1412 (PTDpde & PG_FRAME)) { 1413 pteva = VM_MAXUSER_ADDRESS + i386_ptob(ptepindex); 1414 bzero((caddr_t) pteva, PAGE_SIZE); 1415 } else { 1416 pmap_zero_page(m); 1417 } 1418 } 1419 vm_page_lock_queues(); 1420 m->valid = VM_PAGE_BITS_ALL; 1421 vm_page_flag_clear(m, PG_ZERO); 1422 vm_page_wakeup(m); 1423 vm_page_unlock_queues(); 1424 1425 return m; 1426} 1427 1428static vm_page_t 1429pmap_allocpte(pmap_t pmap, vm_offset_t va) 1430{ 1431 unsigned ptepindex; 1432 pd_entry_t ptepa; 1433 vm_page_t m; 1434 1435 /* 1436 * Calculate pagetable page index 1437 */ 1438 ptepindex = va >> PDRSHIFT; 1439 1440 /* 1441 * Get the page directory entry 1442 */ 1443 ptepa = (vm_offset_t) pmap->pm_pdir[ptepindex]; 1444 1445 /* 1446 * This supports switching from a 4MB page to a 1447 * normal 4K page. 1448 */ 1449 if (ptepa & PG_PS) { 1450 pmap->pm_pdir[ptepindex] = 0; 1451 ptepa = 0; 1452 pmap_invalidate_all(kernel_pmap); 1453 } 1454 1455 /* 1456 * If the page table page is mapped, we just increment the 1457 * hold count, and activate it. 1458 */ 1459 if (ptepa) { 1460 /* 1461 * In order to get the page table page, try the 1462 * hint first. 1463 */ 1464 if (pmap->pm_ptphint && 1465 (pmap->pm_ptphint->pindex == ptepindex)) { 1466 m = pmap->pm_ptphint; 1467 } else { 1468 m = pmap_page_lookup(pmap->pm_pteobj, ptepindex); 1469 pmap->pm_ptphint = m; 1470 } 1471 m->hold_count++; 1472 return m; 1473 } 1474 /* 1475 * Here if the pte page isn't mapped, or if it has been deallocated. 1476 */ 1477 return _pmap_allocpte(pmap, ptepindex); 1478} 1479 1480 1481/*************************************************** 1482* Pmap allocation/deallocation routines. 1483 ***************************************************/ 1484 1485/* 1486 * Release any resources held by the given physical map. 1487 * Called when a pmap initialized by pmap_pinit is being released. 1488 * Should only be called if the map contains no valid mappings. 1489 */ 1490void 1491pmap_release(pmap_t pmap) 1492{ 1493 vm_page_t p,n,ptdpg; 1494 vm_object_t object = pmap->pm_pteobj; 1495 int curgeneration; 1496 1497#if defined(DIAGNOSTIC) 1498 if (object->ref_count != 1) 1499 panic("pmap_release: pteobj reference count != 1"); 1500#endif 1501 1502 ptdpg = NULL; 1503 LIST_REMOVE(pmap, pm_list); 1504retry: 1505 curgeneration = object->generation; 1506 for (p = TAILQ_FIRST(&object->memq); p != NULL; p = n) { 1507 n = TAILQ_NEXT(p, listq); 1508 if (p->pindex == PTDPTDI) { 1509 ptdpg = p; 1510 continue; 1511 } 1512 while (1) { 1513 if (!pmap_release_free_page(pmap, p) && 1514 (object->generation != curgeneration)) 1515 goto retry; 1516 } 1517 } 1518 1519 if (ptdpg && !pmap_release_free_page(pmap, ptdpg)) 1520 goto retry; 1521} 1522 1523static int 1524kvm_size(SYSCTL_HANDLER_ARGS) 1525{ 1526 unsigned long ksize = VM_MAX_KERNEL_ADDRESS - KERNBASE; 1527 1528 return sysctl_handle_long(oidp, &ksize, 0, req); 1529} 1530SYSCTL_PROC(_vm, OID_AUTO, kvm_size, CTLTYPE_LONG|CTLFLAG_RD, 1531 0, 0, kvm_size, "IU", "Size of KVM"); 1532 1533static int 1534kvm_free(SYSCTL_HANDLER_ARGS) 1535{ 1536 unsigned long kfree = VM_MAX_KERNEL_ADDRESS - kernel_vm_end; 1537 1538 return sysctl_handle_long(oidp, &kfree, 0, req); 1539} 1540SYSCTL_PROC(_vm, OID_AUTO, kvm_free, CTLTYPE_LONG|CTLFLAG_RD, 1541 0, 0, kvm_free, "IU", "Amount of KVM free"); 1542 1543/* 1544 * grow the number of kernel page table entries, if needed 1545 */ 1546void 1547pmap_growkernel(vm_offset_t addr) 1548{ 1549 struct pmap *pmap; 1550 int s; 1551 vm_offset_t ptppaddr; 1552 vm_page_t nkpg; 1553 pd_entry_t newpdir; 1554 1555 s = splhigh(); 1556 if (kernel_vm_end == 0) { 1557 kernel_vm_end = KERNBASE; 1558 nkpt = 0; 1559 while (pdir_pde(PTD, kernel_vm_end)) { 1560 kernel_vm_end = (kernel_vm_end + PAGE_SIZE * NPTEPG) & ~(PAGE_SIZE * NPTEPG - 1); 1561 nkpt++; 1562 } 1563 } 1564 addr = roundup2(addr, PAGE_SIZE * NPTEPG); 1565 while (kernel_vm_end < addr) { 1566 if (pdir_pde(PTD, kernel_vm_end)) { 1567 kernel_vm_end = (kernel_vm_end + PAGE_SIZE * NPTEPG) & ~(PAGE_SIZE * NPTEPG - 1); 1568 continue; 1569 } 1570 1571 /* 1572 * This index is bogus, but out of the way 1573 */ 1574 nkpg = vm_page_alloc(kptobj, nkpt, 1575 VM_ALLOC_SYSTEM | VM_ALLOC_WIRED); 1576 if (!nkpg) 1577 panic("pmap_growkernel: no memory to grow kernel"); 1578 1579 nkpt++; 1580 1581 pmap_zero_page(nkpg); 1582 ptppaddr = VM_PAGE_TO_PHYS(nkpg); 1583 newpdir = (pd_entry_t) (ptppaddr | PG_V | PG_RW | PG_A | PG_M); 1584 pdir_pde(PTD, kernel_vm_end) = newpdir; 1585 1586 LIST_FOREACH(pmap, &allpmaps, pm_list) { 1587 *pmap_pde(pmap, kernel_vm_end) = newpdir; 1588 } 1589 kernel_vm_end = (kernel_vm_end + PAGE_SIZE * NPTEPG) & ~(PAGE_SIZE * NPTEPG - 1); 1590 } 1591 splx(s); 1592} 1593 1594 1595/*************************************************** 1596 * page management routines. 1597 ***************************************************/ 1598 1599/* 1600 * free the pv_entry back to the free list 1601 */ 1602static PMAP_INLINE void 1603free_pv_entry(pv_entry_t pv) 1604{ 1605 pv_entry_count--; 1606 uma_zfree(pvzone, pv); 1607} 1608 1609/* 1610 * get a new pv_entry, allocating a block from the system 1611 * when needed. 1612 * the memory allocation is performed bypassing the malloc code 1613 * because of the possibility of allocations at interrupt time. 1614 */ 1615static pv_entry_t 1616get_pv_entry(void) 1617{ 1618 pv_entry_count++; 1619 if (pv_entry_high_water && 1620 (pv_entry_count > pv_entry_high_water) && 1621 (pmap_pagedaemon_waken == 0)) { 1622 pmap_pagedaemon_waken = 1; 1623 wakeup (&vm_pages_needed); 1624 } 1625 return uma_zalloc(pvzone, M_NOWAIT); 1626} 1627 1628/* 1629 * If it is the first entry on the list, it is actually 1630 * in the header and we must copy the following entry up 1631 * to the header. Otherwise we must search the list for 1632 * the entry. In either case we free the now unused entry. 1633 */ 1634 1635static int 1636pmap_remove_entry(pmap_t pmap, vm_page_t m, vm_offset_t va) 1637{ 1638 pv_entry_t pv; 1639 int rtval; 1640 int s; 1641 1642 s = splvm(); 1643 if (m->md.pv_list_count < pmap->pm_stats.resident_count) { 1644 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) { 1645 if (pmap == pv->pv_pmap && va == pv->pv_va) 1646 break; 1647 } 1648 } else { 1649 TAILQ_FOREACH(pv, &pmap->pm_pvlist, pv_plist) { 1650 if (va == pv->pv_va) 1651 break; 1652 } 1653 } 1654 1655 rtval = 0; 1656 if (pv) { 1657 rtval = pmap_unuse_pt(pmap, va, pv->pv_ptem); 1658 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list); 1659 m->md.pv_list_count--; 1660 if (TAILQ_FIRST(&m->md.pv_list) == NULL) 1661 vm_page_flag_clear(m, PG_WRITEABLE); 1662 1663 TAILQ_REMOVE(&pmap->pm_pvlist, pv, pv_plist); 1664 free_pv_entry(pv); 1665 } 1666 1667 splx(s); 1668 return rtval; 1669} 1670 1671/* 1672 * Create a pv entry for page at pa for 1673 * (pmap, va). 1674 */ 1675static void 1676pmap_insert_entry(pmap_t pmap, vm_offset_t va, vm_page_t mpte, vm_page_t m) 1677{ 1678 1679 int s; 1680 pv_entry_t pv; 1681 1682 s = splvm(); 1683 pv = get_pv_entry(); 1684 pv->pv_va = va; 1685 pv->pv_pmap = pmap; 1686 pv->pv_ptem = mpte; 1687 1688 TAILQ_INSERT_TAIL(&pmap->pm_pvlist, pv, pv_plist); 1689 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_list); 1690 m->md.pv_list_count++; 1691 1692 splx(s); 1693} 1694 1695/* 1696 * pmap_remove_pte: do the things to unmap a page in a process 1697 */ 1698static int 1699pmap_remove_pte(pmap_t pmap, pt_entry_t *ptq, vm_offset_t va) 1700{ 1701 pt_entry_t oldpte; 1702 vm_page_t m; 1703 1704 oldpte = atomic_readandclear_int(ptq); 1705 if (oldpte & PG_W) 1706 pmap->pm_stats.wired_count -= 1; 1707 /* 1708 * Machines that don't support invlpg, also don't support 1709 * PG_G. 1710 */ 1711 if (oldpte & PG_G) 1712 pmap_invalidate_page(kernel_pmap, va); 1713 pmap->pm_stats.resident_count -= 1; 1714 if (oldpte & PG_MANAGED) { 1715 m = PHYS_TO_VM_PAGE(oldpte); 1716 if (oldpte & PG_M) { 1717#if defined(PMAP_DIAGNOSTIC) 1718 if (pmap_nw_modified((pt_entry_t) oldpte)) { 1719 printf( 1720 "pmap_remove: modified page not writable: va: 0x%x, pte: 0x%x\n", 1721 va, oldpte); 1722 } 1723#endif 1724 if (pmap_track_modified(va)) 1725 vm_page_dirty(m); 1726 } 1727 if (oldpte & PG_A) 1728 vm_page_flag_set(m, PG_REFERENCED); 1729 return pmap_remove_entry(pmap, m, va); 1730 } else { 1731 return pmap_unuse_pt(pmap, va, NULL); 1732 } 1733 1734 return 0; 1735} 1736 1737/* 1738 * Remove a single page from a process address space 1739 */ 1740static void 1741pmap_remove_page(pmap_t pmap, vm_offset_t va) 1742{ 1743 register pt_entry_t *ptq; 1744 1745 /* 1746 * if there is no pte for this address, just skip it!!! 1747 */ 1748 if (*pmap_pde(pmap, va) == 0) { 1749 return; 1750 } 1751 1752 /* 1753 * get a local va for mappings for this pmap. 1754 */ 1755 ptq = get_ptbase(pmap) + i386_btop(va); 1756 if (*ptq) { 1757 (void) pmap_remove_pte(pmap, ptq, va); 1758 pmap_invalidate_page(pmap, va); 1759 } 1760 return; 1761} 1762 1763/* 1764 * Remove the given range of addresses from the specified map. 1765 * 1766 * It is assumed that the start and end are properly 1767 * rounded to the page size. 1768 */ 1769void 1770pmap_remove(pmap_t pmap, vm_offset_t sva, vm_offset_t eva) 1771{ 1772 register pt_entry_t *ptbase; 1773 vm_offset_t pdnxt; 1774 pd_entry_t ptpaddr; 1775 vm_offset_t sindex, eindex; 1776 int anyvalid; 1777 1778 if (pmap == NULL) 1779 return; 1780 1781 if (pmap->pm_stats.resident_count == 0) 1782 return; 1783 1784 /* 1785 * special handling of removing one page. a very 1786 * common operation and easy to short circuit some 1787 * code. 1788 */ 1789 if ((sva + PAGE_SIZE == eva) && 1790 ((pmap->pm_pdir[(sva >> PDRSHIFT)] & PG_PS) == 0)) { 1791 pmap_remove_page(pmap, sva); 1792 return; 1793 } 1794 1795 anyvalid = 0; 1796 1797 /* 1798 * Get a local virtual address for the mappings that are being 1799 * worked with. 1800 */ 1801 ptbase = get_ptbase(pmap); 1802 1803 sindex = i386_btop(sva); 1804 eindex = i386_btop(eva); 1805 1806 for (; sindex < eindex; sindex = pdnxt) { 1807 unsigned pdirindex; 1808 1809 /* 1810 * Calculate index for next page table. 1811 */ 1812 pdnxt = ((sindex + NPTEPG) & ~(NPTEPG - 1)); 1813 if (pmap->pm_stats.resident_count == 0) 1814 break; 1815 1816 pdirindex = sindex / NPDEPG; 1817 ptpaddr = pmap->pm_pdir[pdirindex]; 1818 if ((ptpaddr & PG_PS) != 0) { 1819 pmap->pm_pdir[pdirindex] = 0; 1820 pmap->pm_stats.resident_count -= NBPDR / PAGE_SIZE; 1821 anyvalid++; 1822 continue; 1823 } 1824 1825 /* 1826 * Weed out invalid mappings. Note: we assume that the page 1827 * directory table is always allocated, and in kernel virtual. 1828 */ 1829 if (ptpaddr == 0) 1830 continue; 1831 1832 /* 1833 * Limit our scan to either the end of the va represented 1834 * by the current page table page, or to the end of the 1835 * range being removed. 1836 */ 1837 if (pdnxt > eindex) { 1838 pdnxt = eindex; 1839 } 1840 1841 for (; sindex != pdnxt; sindex++) { 1842 vm_offset_t va; 1843 if (ptbase[sindex] == 0) { 1844 continue; 1845 } 1846 va = i386_ptob(sindex); 1847 1848 anyvalid++; 1849 if (pmap_remove_pte(pmap, 1850 ptbase + sindex, va)) 1851 break; 1852 } 1853 } 1854 1855 if (anyvalid) 1856 pmap_invalidate_all(pmap); 1857} 1858 1859/* 1860 * Routine: pmap_remove_all 1861 * Function: 1862 * Removes this physical page from 1863 * all physical maps in which it resides. 1864 * Reflects back modify bits to the pager. 1865 * 1866 * Notes: 1867 * Original versions of this routine were very 1868 * inefficient because they iteratively called 1869 * pmap_remove (slow...) 1870 */ 1871 1872void 1873pmap_remove_all(vm_page_t m) 1874{ 1875 register pv_entry_t pv; 1876 pt_entry_t *pte, tpte; 1877 int s; 1878 1879#if defined(PMAP_DIAGNOSTIC) 1880 /* 1881 * XXX This makes pmap_remove_all() illegal for non-managed pages! 1882 */ 1883 if (!pmap_initialized || (m->flags & PG_FICTITIOUS)) { 1884 panic("pmap_remove_all: illegal for unmanaged page, va: 0x%x", 1885 VM_PAGE_TO_PHYS(m)); 1886 } 1887#endif 1888 mtx_assert(&vm_page_queue_mtx, MA_OWNED); 1889 s = splvm(); 1890 while ((pv = TAILQ_FIRST(&m->md.pv_list)) != NULL) { 1891 pv->pv_pmap->pm_stats.resident_count--; 1892 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va); 1893 tpte = atomic_readandclear_int(pte); 1894 if (tpte & PG_W) 1895 pv->pv_pmap->pm_stats.wired_count--; 1896 if (tpte & PG_A) 1897 vm_page_flag_set(m, PG_REFERENCED); 1898 1899 /* 1900 * Update the vm_page_t clean and reference bits. 1901 */ 1902 if (tpte & PG_M) { 1903#if defined(PMAP_DIAGNOSTIC) 1904 if (pmap_nw_modified((pt_entry_t) tpte)) { 1905 printf( 1906 "pmap_remove_all: modified page not writable: va: 0x%x, pte: 0x%x\n", 1907 pv->pv_va, tpte); 1908 } 1909#endif 1910 if (pmap_track_modified(pv->pv_va)) 1911 vm_page_dirty(m); 1912 } 1913 pmap_invalidate_page(pv->pv_pmap, pv->pv_va); 1914 TAILQ_REMOVE(&pv->pv_pmap->pm_pvlist, pv, pv_plist); 1915 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list); 1916 m->md.pv_list_count--; 1917 pmap_unuse_pt(pv->pv_pmap, pv->pv_va, pv->pv_ptem); 1918 free_pv_entry(pv); 1919 } 1920 vm_page_flag_clear(m, PG_WRITEABLE); 1921 splx(s); 1922} 1923 1924/* 1925 * Set the physical protection on the 1926 * specified range of this map as requested. 1927 */ 1928void 1929pmap_protect(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, vm_prot_t prot) 1930{ 1931 register pt_entry_t *ptbase; 1932 vm_offset_t pdnxt; 1933 pd_entry_t ptpaddr; 1934 vm_offset_t sindex, eindex; 1935 int anychanged; 1936 1937 if (pmap == NULL) 1938 return; 1939 1940 if ((prot & VM_PROT_READ) == VM_PROT_NONE) { 1941 pmap_remove(pmap, sva, eva); 1942 return; 1943 } 1944 1945 if (prot & VM_PROT_WRITE) 1946 return; 1947 1948 anychanged = 0; 1949 1950 ptbase = get_ptbase(pmap); 1951 1952 sindex = i386_btop(sva); 1953 eindex = i386_btop(eva); 1954 1955 for (; sindex < eindex; sindex = pdnxt) { 1956 1957 unsigned pdirindex; 1958 1959 pdnxt = ((sindex + NPTEPG) & ~(NPTEPG - 1)); 1960 1961 pdirindex = sindex / NPDEPG; 1962 ptpaddr = pmap->pm_pdir[pdirindex]; 1963 if ((ptpaddr & PG_PS) != 0) { 1964 pmap->pm_pdir[pdirindex] &= ~(PG_M|PG_RW); 1965 pmap->pm_stats.resident_count -= NBPDR / PAGE_SIZE; 1966 anychanged++; 1967 continue; 1968 } 1969 1970 /* 1971 * Weed out invalid mappings. Note: we assume that the page 1972 * directory table is always allocated, and in kernel virtual. 1973 */ 1974 if (ptpaddr == 0) 1975 continue; 1976 1977 if (pdnxt > eindex) { 1978 pdnxt = eindex; 1979 } 1980 1981 for (; sindex != pdnxt; sindex++) { 1982 1983 pt_entry_t pbits; 1984 vm_page_t m; 1985 1986 pbits = ptbase[sindex]; 1987 1988 if (pbits & PG_MANAGED) { 1989 m = NULL; 1990 if (pbits & PG_A) { 1991 m = PHYS_TO_VM_PAGE(pbits); 1992 vm_page_flag_set(m, PG_REFERENCED); 1993 pbits &= ~PG_A; 1994 } 1995 if (pbits & PG_M) { 1996 if (pmap_track_modified(i386_ptob(sindex))) { 1997 if (m == NULL) 1998 m = PHYS_TO_VM_PAGE(pbits); 1999 vm_page_dirty(m); 2000 pbits &= ~PG_M; 2001 } 2002 } 2003 } 2004 2005 pbits &= ~PG_RW; 2006 2007 if (pbits != ptbase[sindex]) { 2008 ptbase[sindex] = pbits; 2009 anychanged = 1; 2010 } 2011 } 2012 } 2013 if (anychanged) 2014 pmap_invalidate_all(pmap); 2015} 2016 2017/* 2018 * Insert the given physical page (p) at 2019 * the specified virtual address (v) in the 2020 * target physical map with the protection requested. 2021 * 2022 * If specified, the page will be wired down, meaning 2023 * that the related pte can not be reclaimed. 2024 * 2025 * NB: This is the only routine which MAY NOT lazy-evaluate 2026 * or lose information. That is, this routine must actually 2027 * insert this page into the given map NOW. 2028 */ 2029void 2030pmap_enter(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot, 2031 boolean_t wired) 2032{ 2033 vm_offset_t pa; 2034 register pt_entry_t *pte; 2035 vm_offset_t opa; 2036 pt_entry_t origpte, newpte; 2037 vm_page_t mpte; 2038 2039 if (pmap == NULL) 2040 return; 2041 2042 va &= PG_FRAME; 2043#ifdef PMAP_DIAGNOSTIC 2044 if (va > VM_MAX_KERNEL_ADDRESS) 2045 panic("pmap_enter: toobig"); 2046 if ((va >= UPT_MIN_ADDRESS) && (va < UPT_MAX_ADDRESS)) 2047 panic("pmap_enter: invalid to pmap_enter page table pages (va: 0x%x)", va); 2048#endif 2049 2050 mpte = NULL; 2051 /* 2052 * In the case that a page table page is not 2053 * resident, we are creating it here. 2054 */ 2055 if (va < VM_MAXUSER_ADDRESS) { 2056 mpte = pmap_allocpte(pmap, va); 2057 } 2058#if 0 && defined(PMAP_DIAGNOSTIC) 2059 else { 2060 pd_entry_t *pdeaddr = pmap_pde(pmap, va); 2061 origpte = *pdeaddr; 2062 if ((origpte & PG_V) == 0) { 2063 panic("pmap_enter: invalid kernel page table page, pdir=%p, pde=%p, va=%p\n", 2064 pmap->pm_pdir[PTDPTDI], origpte, va); 2065 } 2066 } 2067#endif 2068 2069 pte = pmap_pte(pmap, va); 2070 2071 /* 2072 * Page Directory table entry not valid, we need a new PT page 2073 */ 2074 if (pte == NULL) { 2075 panic("pmap_enter: invalid page directory, pdir=%p, va=0x%x\n", 2076 (void *)pmap->pm_pdir[PTDPTDI], va); 2077 } 2078 2079 pa = VM_PAGE_TO_PHYS(m) & PG_FRAME; 2080 origpte = *(vm_offset_t *)pte; 2081 opa = origpte & PG_FRAME; 2082 2083 if (origpte & PG_PS) 2084 panic("pmap_enter: attempted pmap_enter on 4MB page"); 2085 2086 /* 2087 * Mapping has not changed, must be protection or wiring change. 2088 */ 2089 if (origpte && (opa == pa)) { 2090 /* 2091 * Wiring change, just update stats. We don't worry about 2092 * wiring PT pages as they remain resident as long as there 2093 * are valid mappings in them. Hence, if a user page is wired, 2094 * the PT page will be also. 2095 */ 2096 if (wired && ((origpte & PG_W) == 0)) 2097 pmap->pm_stats.wired_count++; 2098 else if (!wired && (origpte & PG_W)) 2099 pmap->pm_stats.wired_count--; 2100 2101#if defined(PMAP_DIAGNOSTIC) 2102 if (pmap_nw_modified((pt_entry_t) origpte)) { 2103 printf( 2104 "pmap_enter: modified page not writable: va: 0x%x, pte: 0x%x\n", 2105 va, origpte); 2106 } 2107#endif 2108 2109 /* 2110 * Remove extra pte reference 2111 */ 2112 if (mpte) 2113 mpte->hold_count--; 2114 2115 if ((prot & VM_PROT_WRITE) && (origpte & PG_V)) { 2116 if ((origpte & PG_RW) == 0) { 2117 *pte |= PG_RW; 2118 pmap_invalidate_page(pmap, va); 2119 } 2120 return; 2121 } 2122 2123 /* 2124 * We might be turning off write access to the page, 2125 * so we go ahead and sense modify status. 2126 */ 2127 if (origpte & PG_MANAGED) { 2128 if ((origpte & PG_M) && pmap_track_modified(va)) { 2129 vm_page_t om; 2130 om = PHYS_TO_VM_PAGE(opa); 2131 vm_page_dirty(om); 2132 } 2133 pa |= PG_MANAGED; 2134 } 2135 goto validate; 2136 } 2137 /* 2138 * Mapping has changed, invalidate old range and fall through to 2139 * handle validating new mapping. 2140 */ 2141 if (opa) { 2142 int err; 2143 vm_page_lock_queues(); 2144 err = pmap_remove_pte(pmap, pte, va); 2145 vm_page_unlock_queues(); 2146 if (err) 2147 panic("pmap_enter: pte vanished, va: 0x%x", va); 2148 } 2149 2150 /* 2151 * Enter on the PV list if part of our managed memory. Note that we 2152 * raise IPL while manipulating pv_table since pmap_enter can be 2153 * called at interrupt time. 2154 */ 2155 if (pmap_initialized && 2156 (m->flags & (PG_FICTITIOUS|PG_UNMANAGED)) == 0) { 2157 pmap_insert_entry(pmap, va, mpte, m); 2158 pa |= PG_MANAGED; 2159 } 2160 2161 /* 2162 * Increment counters 2163 */ 2164 pmap->pm_stats.resident_count++; 2165 if (wired) 2166 pmap->pm_stats.wired_count++; 2167 2168validate: 2169 /* 2170 * Now validate mapping with desired protection/wiring. 2171 */ 2172 newpte = (vm_offset_t) (pa | pte_prot(pmap, prot) | PG_V); 2173 2174 if (wired) 2175 newpte |= PG_W; 2176 if (va < VM_MAXUSER_ADDRESS) 2177 newpte |= PG_U; 2178 if (pmap == kernel_pmap) 2179 newpte |= pgeflag; 2180 2181 /* 2182 * if the mapping or permission bits are different, we need 2183 * to update the pte. 2184 */ 2185 if ((origpte & ~(PG_M|PG_A)) != newpte) { 2186 *pte = newpte | PG_A; 2187 /*if (origpte)*/ { 2188 pmap_invalidate_page(pmap, va); 2189 } 2190 } 2191} 2192 2193/* 2194 * this code makes some *MAJOR* assumptions: 2195 * 1. Current pmap & pmap exists. 2196 * 2. Not wired. 2197 * 3. Read access. 2198 * 4. No page table pages. 2199 * 5. Tlbflush is deferred to calling procedure. 2200 * 6. Page IS managed. 2201 * but is *MUCH* faster than pmap_enter... 2202 */ 2203 2204static vm_page_t 2205pmap_enter_quick(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_page_t mpte) 2206{ 2207 pt_entry_t *pte; 2208 vm_offset_t pa; 2209 2210 /* 2211 * In the case that a page table page is not 2212 * resident, we are creating it here. 2213 */ 2214 if (va < VM_MAXUSER_ADDRESS) { 2215 unsigned ptepindex; 2216 pd_entry_t ptepa; 2217 2218 /* 2219 * Calculate pagetable page index 2220 */ 2221 ptepindex = va >> PDRSHIFT; 2222 if (mpte && (mpte->pindex == ptepindex)) { 2223 mpte->hold_count++; 2224 } else { 2225retry: 2226 /* 2227 * Get the page directory entry 2228 */ 2229 ptepa = pmap->pm_pdir[ptepindex]; 2230 2231 /* 2232 * If the page table page is mapped, we just increment 2233 * the hold count, and activate it. 2234 */ 2235 if (ptepa) { 2236 if (ptepa & PG_PS) 2237 panic("pmap_enter_quick: unexpected mapping into 4MB page"); 2238 if (pmap->pm_ptphint && 2239 (pmap->pm_ptphint->pindex == ptepindex)) { 2240 mpte = pmap->pm_ptphint; 2241 } else { 2242 mpte = pmap_page_lookup(pmap->pm_pteobj, ptepindex); 2243 pmap->pm_ptphint = mpte; 2244 } 2245 if (mpte == NULL) 2246 goto retry; 2247 mpte->hold_count++; 2248 } else { 2249 mpte = _pmap_allocpte(pmap, ptepindex); 2250 } 2251 } 2252 } else { 2253 mpte = NULL; 2254 } 2255 2256 /* 2257 * This call to vtopte makes the assumption that we are 2258 * entering the page into the current pmap. In order to support 2259 * quick entry into any pmap, one would likely use pmap_pte_quick. 2260 * But that isn't as quick as vtopte. 2261 */ 2262 pte = vtopte(va); 2263 if (*pte) { 2264 if (mpte != NULL) { 2265 vm_page_lock_queues(); 2266 pmap_unwire_pte_hold(pmap, mpte); 2267 vm_page_unlock_queues(); 2268 } 2269 return 0; 2270 } 2271 2272 /* 2273 * Enter on the PV list if part of our managed memory. Note that we 2274 * raise IPL while manipulating pv_table since pmap_enter can be 2275 * called at interrupt time. 2276 */ 2277 if ((m->flags & (PG_FICTITIOUS|PG_UNMANAGED)) == 0) 2278 pmap_insert_entry(pmap, va, mpte, m); 2279 2280 /* 2281 * Increment counters 2282 */ 2283 pmap->pm_stats.resident_count++; 2284 2285 pa = VM_PAGE_TO_PHYS(m); 2286 2287 /* 2288 * Now validate mapping with RO protection 2289 */ 2290 if (m->flags & (PG_FICTITIOUS|PG_UNMANAGED)) 2291 *pte = pa | PG_V | PG_U; 2292 else 2293 *pte = pa | PG_V | PG_U | PG_MANAGED; 2294 2295 return mpte; 2296} 2297 2298/* 2299 * Make a temporary mapping for a physical address. This is only intended 2300 * to be used for panic dumps. 2301 */ 2302void * 2303pmap_kenter_temporary(vm_offset_t pa, int i) 2304{ 2305 vm_offset_t va; 2306 2307 va = (vm_offset_t)crashdumpmap + (i * PAGE_SIZE); 2308 pmap_kenter(va, pa); 2309#ifndef I386_CPU 2310 invlpg(va); 2311#else 2312 invltlb(); 2313#endif 2314 return ((void *)crashdumpmap); 2315} 2316 2317#define MAX_INIT_PT (96) 2318/* 2319 * pmap_object_init_pt preloads the ptes for a given object 2320 * into the specified pmap. This eliminates the blast of soft 2321 * faults on process startup and immediately after an mmap. 2322 */ 2323void 2324pmap_object_init_pt(pmap_t pmap, vm_offset_t addr, 2325 vm_object_t object, vm_pindex_t pindex, 2326 vm_size_t size, int limit) 2327{ 2328 vm_offset_t tmpidx; 2329 int psize; 2330 vm_page_t p, mpte; 2331 2332 if (pmap == NULL || object == NULL) 2333 return; 2334 2335 /* 2336 * This code maps large physical mmap regions into the 2337 * processor address space. Note that some shortcuts 2338 * are taken, but the code works. 2339 */ 2340 if (pseflag && (object->type == OBJT_DEVICE) && 2341 ((addr & (NBPDR - 1)) == 0) && ((size & (NBPDR - 1)) == 0)) { 2342 int i; 2343 vm_page_t m[1]; 2344 unsigned int ptepindex; 2345 int npdes; 2346 pd_entry_t ptepa; 2347 2348 if (pmap->pm_pdir[ptepindex = (addr >> PDRSHIFT)]) 2349 return; 2350 2351retry: 2352 p = vm_page_lookup(object, pindex); 2353 if (p != NULL) { 2354 vm_page_lock_queues(); 2355 if (vm_page_sleep_if_busy(p, FALSE, "init4p")) 2356 goto retry; 2357 } else { 2358 p = vm_page_alloc(object, pindex, VM_ALLOC_NORMAL); 2359 if (p == NULL) 2360 return; 2361 m[0] = p; 2362 2363 if (vm_pager_get_pages(object, m, 1, 0) != VM_PAGER_OK) { 2364 vm_page_lock_queues(); 2365 vm_page_free(p); 2366 vm_page_unlock_queues(); 2367 return; 2368 } 2369 2370 p = vm_page_lookup(object, pindex); 2371 vm_page_lock_queues(); 2372 vm_page_wakeup(p); 2373 } 2374 vm_page_unlock_queues(); 2375 2376 ptepa = VM_PAGE_TO_PHYS(p); 2377 if (ptepa & (NBPDR - 1)) { 2378 return; 2379 } 2380 2381 p->valid = VM_PAGE_BITS_ALL; 2382 2383 pmap->pm_stats.resident_count += size >> PAGE_SHIFT; 2384 npdes = size >> PDRSHIFT; 2385 for(i = 0; i < npdes; i++) { 2386 pmap->pm_pdir[ptepindex] = 2387 ptepa | PG_U | PG_RW | PG_V | PG_PS; 2388 ptepa += NBPDR; 2389 ptepindex += 1; 2390 } 2391 pmap_invalidate_all(kernel_pmap); 2392 return; 2393 } 2394 2395 psize = i386_btop(size); 2396 2397 if ((object->type != OBJT_VNODE) || 2398 ((limit & MAP_PREFAULT_PARTIAL) && (psize > MAX_INIT_PT) && 2399 (object->resident_page_count > MAX_INIT_PT))) { 2400 return; 2401 } 2402 2403 if (psize + pindex > object->size) { 2404 if (object->size < pindex) 2405 return; 2406 psize = object->size - pindex; 2407 } 2408 2409 mpte = NULL; 2410 2411 if ((p = TAILQ_FIRST(&object->memq)) != NULL) { 2412 if (p->pindex < pindex) { 2413 p = vm_page_splay(pindex, object->root); 2414 if ((object->root = p)->pindex < pindex) 2415 p = TAILQ_NEXT(p, listq); 2416 } 2417 } 2418 /* 2419 * Assert: the variable p is either (1) the page with the 2420 * least pindex greater than or equal to the parameter pindex 2421 * or (2) NULL. 2422 */ 2423 for (; 2424 p != NULL && (tmpidx = p->pindex - pindex) < psize; 2425 p = TAILQ_NEXT(p, listq)) { 2426 /* 2427 * don't allow an madvise to blow away our really 2428 * free pages allocating pv entries. 2429 */ 2430 if ((limit & MAP_PREFAULT_MADVISE) && 2431 cnt.v_free_count < cnt.v_free_reserved) { 2432 break; 2433 } 2434 vm_page_lock_queues(); 2435 if ((p->valid & VM_PAGE_BITS_ALL) == VM_PAGE_BITS_ALL && 2436 (p->busy == 0) && 2437 (p->flags & (PG_BUSY | PG_FICTITIOUS)) == 0) { 2438 if ((p->queue - p->pc) == PQ_CACHE) 2439 vm_page_deactivate(p); 2440 vm_page_busy(p); 2441 vm_page_unlock_queues(); 2442 mpte = pmap_enter_quick(pmap, 2443 addr + i386_ptob(tmpidx), p, mpte); 2444 vm_page_lock_queues(); 2445 vm_page_wakeup(p); 2446 } 2447 vm_page_unlock_queues(); 2448 } 2449 return; 2450} 2451 2452/* 2453 * pmap_prefault provides a quick way of clustering 2454 * pagefaults into a processes address space. It is a "cousin" 2455 * of pmap_object_init_pt, except it runs at page fault time instead 2456 * of mmap time. 2457 */ 2458#define PFBAK 4 2459#define PFFOR 4 2460#define PAGEORDER_SIZE (PFBAK+PFFOR) 2461 2462static int pmap_prefault_pageorder[] = { 2463 -1 * PAGE_SIZE, 1 * PAGE_SIZE, 2464 -2 * PAGE_SIZE, 2 * PAGE_SIZE, 2465 -3 * PAGE_SIZE, 3 * PAGE_SIZE, 2466 -4 * PAGE_SIZE, 4 * PAGE_SIZE 2467}; 2468 2469void 2470pmap_prefault(pmap, addra, entry) 2471 pmap_t pmap; 2472 vm_offset_t addra; 2473 vm_map_entry_t entry; 2474{ 2475 int i; 2476 vm_offset_t starta; 2477 vm_offset_t addr; 2478 vm_pindex_t pindex; 2479 vm_page_t m, mpte; 2480 vm_object_t object; 2481 2482 if (!curthread || (pmap != vmspace_pmap(curthread->td_proc->p_vmspace))) 2483 return; 2484 2485 object = entry->object.vm_object; 2486 2487 starta = addra - PFBAK * PAGE_SIZE; 2488 if (starta < entry->start) { 2489 starta = entry->start; 2490 } else if (starta > addra) { 2491 starta = 0; 2492 } 2493 2494 mpte = NULL; 2495 for (i = 0; i < PAGEORDER_SIZE; i++) { 2496 vm_object_t lobject; 2497 pt_entry_t *pte; 2498 2499 addr = addra + pmap_prefault_pageorder[i]; 2500 if (addr > addra + (PFFOR * PAGE_SIZE)) 2501 addr = 0; 2502 2503 if (addr < starta || addr >= entry->end) 2504 continue; 2505 2506 if ((*pmap_pde(pmap, addr)) == 0) 2507 continue; 2508 2509 pte = vtopte(addr); 2510 if (*pte) 2511 continue; 2512 2513 pindex = ((addr - entry->start) + entry->offset) >> PAGE_SHIFT; 2514 lobject = object; 2515 for (m = vm_page_lookup(lobject, pindex); 2516 (!m && (lobject->type == OBJT_DEFAULT) && (lobject->backing_object)); 2517 lobject = lobject->backing_object) { 2518 if (lobject->backing_object_offset & PAGE_MASK) 2519 break; 2520 pindex += (lobject->backing_object_offset >> PAGE_SHIFT); 2521 m = vm_page_lookup(lobject->backing_object, pindex); 2522 } 2523 2524 /* 2525 * give-up when a page is not in memory 2526 */ 2527 if (m == NULL) 2528 break; 2529 vm_page_lock_queues(); 2530 if (((m->valid & VM_PAGE_BITS_ALL) == VM_PAGE_BITS_ALL) && 2531 (m->busy == 0) && 2532 (m->flags & (PG_BUSY | PG_FICTITIOUS)) == 0) { 2533 2534 if ((m->queue - m->pc) == PQ_CACHE) { 2535 vm_page_deactivate(m); 2536 } 2537 vm_page_busy(m); 2538 vm_page_unlock_queues(); 2539 mpte = pmap_enter_quick(pmap, addr, m, mpte); 2540 vm_page_lock_queues(); 2541 vm_page_wakeup(m); 2542 } 2543 vm_page_unlock_queues(); 2544 } 2545} 2546 2547/* 2548 * Routine: pmap_change_wiring 2549 * Function: Change the wiring attribute for a map/virtual-address 2550 * pair. 2551 * In/out conditions: 2552 * The mapping must already exist in the pmap. 2553 */ 2554void 2555pmap_change_wiring(pmap, va, wired) 2556 register pmap_t pmap; 2557 vm_offset_t va; 2558 boolean_t wired; 2559{ 2560 register pt_entry_t *pte; 2561 2562 if (pmap == NULL) 2563 return; 2564 2565 pte = pmap_pte(pmap, va); 2566 2567 if (wired && !pmap_pte_w(pte)) 2568 pmap->pm_stats.wired_count++; 2569 else if (!wired && pmap_pte_w(pte)) 2570 pmap->pm_stats.wired_count--; 2571 2572 /* 2573 * Wiring is not a hardware characteristic so there is no need to 2574 * invalidate TLB. 2575 */ 2576 pmap_pte_set_w(pte, wired); 2577} 2578 2579 2580 2581/* 2582 * Copy the range specified by src_addr/len 2583 * from the source map to the range dst_addr/len 2584 * in the destination map. 2585 * 2586 * This routine is only advisory and need not do anything. 2587 */ 2588 2589void 2590pmap_copy(pmap_t dst_pmap, pmap_t src_pmap, vm_offset_t dst_addr, vm_size_t len, 2591 vm_offset_t src_addr) 2592{ 2593 vm_offset_t addr; 2594 vm_offset_t end_addr = src_addr + len; 2595 vm_offset_t pdnxt; 2596 pd_entry_t src_frame, dst_frame; 2597 vm_page_t m; 2598 2599 if (dst_addr != src_addr) 2600 return; 2601 2602 src_frame = src_pmap->pm_pdir[PTDPTDI] & PG_FRAME; 2603 if (src_frame != (PTDpde & PG_FRAME)) 2604 return; 2605 2606 dst_frame = dst_pmap->pm_pdir[PTDPTDI] & PG_FRAME; 2607 for (addr = src_addr; addr < end_addr; addr = pdnxt) { 2608 pt_entry_t *src_pte, *dst_pte; 2609 vm_page_t dstmpte, srcmpte; 2610 pd_entry_t srcptepaddr; 2611 unsigned ptepindex; 2612 2613 if (addr >= UPT_MIN_ADDRESS) 2614 panic("pmap_copy: invalid to pmap_copy page tables\n"); 2615 2616 /* 2617 * Don't let optional prefaulting of pages make us go 2618 * way below the low water mark of free pages or way 2619 * above high water mark of used pv entries. 2620 */ 2621 if (cnt.v_free_count < cnt.v_free_reserved || 2622 pv_entry_count > pv_entry_high_water) 2623 break; 2624 2625 pdnxt = ((addr + PAGE_SIZE*NPTEPG) & ~(PAGE_SIZE*NPTEPG - 1)); 2626 ptepindex = addr >> PDRSHIFT; 2627 2628 srcptepaddr = src_pmap->pm_pdir[ptepindex]; 2629 if (srcptepaddr == 0) 2630 continue; 2631 2632 if (srcptepaddr & PG_PS) { 2633 if (dst_pmap->pm_pdir[ptepindex] == 0) { 2634 dst_pmap->pm_pdir[ptepindex] = srcptepaddr; 2635 dst_pmap->pm_stats.resident_count += NBPDR / PAGE_SIZE; 2636 } 2637 continue; 2638 } 2639 2640 srcmpte = vm_page_lookup(src_pmap->pm_pteobj, ptepindex); 2641 if ((srcmpte == NULL) || 2642 (srcmpte->hold_count == 0) || (srcmpte->flags & PG_BUSY)) 2643 continue; 2644 2645 if (pdnxt > end_addr) 2646 pdnxt = end_addr; 2647 2648 /* 2649 * Have to recheck this before every avtopte() call below 2650 * in case we have blocked and something else used APTDpde. 2651 */ 2652 if (dst_frame != (APTDpde & PG_FRAME)) { 2653 APTDpde = dst_frame | PG_RW | PG_V; 2654 pmap_invalidate_all(kernel_pmap); /* XXX Bandaid */ 2655 } 2656 src_pte = vtopte(addr); 2657 dst_pte = avtopte(addr); 2658 while (addr < pdnxt) { 2659 pt_entry_t ptetemp; 2660 ptetemp = *src_pte; 2661 /* 2662 * we only virtual copy managed pages 2663 */ 2664 if ((ptetemp & PG_MANAGED) != 0) { 2665 /* 2666 * We have to check after allocpte for the 2667 * pte still being around... allocpte can 2668 * block. 2669 */ 2670 dstmpte = pmap_allocpte(dst_pmap, addr); 2671 if ((*dst_pte == 0) && (ptetemp = *src_pte)) { 2672 /* 2673 * Clear the modified and 2674 * accessed (referenced) bits 2675 * during the copy. 2676 */ 2677 m = PHYS_TO_VM_PAGE(ptetemp); 2678 *dst_pte = ptetemp & ~(PG_M | PG_A); 2679 dst_pmap->pm_stats.resident_count++; 2680 pmap_insert_entry(dst_pmap, addr, 2681 dstmpte, m); 2682 } else { 2683 vm_page_lock_queues(); 2684 pmap_unwire_pte_hold(dst_pmap, dstmpte); 2685 vm_page_unlock_queues(); 2686 } 2687 if (dstmpte->hold_count >= srcmpte->hold_count) 2688 break; 2689 } 2690 addr += PAGE_SIZE; 2691 src_pte++; 2692 dst_pte++; 2693 } 2694 } 2695} 2696 2697#ifdef SMP 2698 2699/* 2700 * pmap_zpi_switchin*() 2701 * 2702 * These functions allow us to avoid doing IPIs alltogether in certain 2703 * temporary page-mapping situations (page zeroing). Instead to deal 2704 * with being preempted and moved onto a different cpu we invalidate 2705 * the page when the scheduler switches us in. This does not occur 2706 * very often so we remain relatively optimal with very little effort. 2707 */ 2708static void 2709pmap_zpi_switchin12(void) 2710{ 2711 invlpg((u_int)CADDR1); 2712 invlpg((u_int)CADDR2); 2713} 2714 2715static void 2716pmap_zpi_switchin2(void) 2717{ 2718 invlpg((u_int)CADDR2); 2719} 2720 2721static void 2722pmap_zpi_switchin3(void) 2723{ 2724 invlpg((u_int)CADDR3); 2725} 2726 2727#endif 2728 2729/* 2730 * pmap_zero_page zeros the specified hardware page by mapping 2731 * the page into KVM and using bzero to clear its contents. 2732 */ 2733void 2734pmap_zero_page(vm_page_t m) 2735{ 2736 vm_offset_t phys; 2737 2738 phys = VM_PAGE_TO_PHYS(m); 2739 if (*CMAP2) 2740 panic("pmap_zero_page: CMAP2 busy"); 2741 *CMAP2 = PG_V | PG_RW | phys | PG_A | PG_M; 2742#ifdef I386_CPU 2743 invltlb(); 2744#else 2745#ifdef SMP 2746 curthread->td_switchin = pmap_zpi_switchin2; 2747#endif 2748 invlpg((u_int)CADDR2); 2749#endif 2750#if defined(I686_CPU) 2751 if (cpu_class == CPUCLASS_686) 2752 i686_pagezero(CADDR2); 2753 else 2754#endif 2755 bzero(CADDR2, PAGE_SIZE); 2756#ifdef SMP 2757 curthread->td_switchin = NULL; 2758#endif 2759 *CMAP2 = 0; 2760} 2761 2762/* 2763 * pmap_zero_page_area zeros the specified hardware page by mapping 2764 * the page into KVM and using bzero to clear its contents. 2765 * 2766 * off and size may not cover an area beyond a single hardware page. 2767 */ 2768void 2769pmap_zero_page_area(vm_page_t m, int off, int size) 2770{ 2771 vm_offset_t phys; 2772 2773 phys = VM_PAGE_TO_PHYS(m); 2774 if (*CMAP2) 2775 panic("pmap_zero_page: CMAP2 busy"); 2776 *CMAP2 = PG_V | PG_RW | phys | PG_A | PG_M; 2777#ifdef I386_CPU 2778 invltlb(); 2779#else 2780#ifdef SMP 2781 curthread->td_switchin = pmap_zpi_switchin2; 2782#endif 2783 invlpg((u_int)CADDR2); 2784#endif 2785#if defined(I686_CPU) 2786 if (cpu_class == CPUCLASS_686 && off == 0 && size == PAGE_SIZE) 2787 i686_pagezero(CADDR2); 2788 else 2789#endif 2790 bzero((char *)CADDR2 + off, size); 2791#ifdef SMP 2792 curthread->td_switchin = NULL; 2793#endif 2794 *CMAP2 = 0; 2795} 2796 2797/* 2798 * pmap_zero_page_idle zeros the specified hardware page by mapping 2799 * the page into KVM and using bzero to clear its contents. This 2800 * is intended to be called from the vm_pagezero process only and 2801 * outside of Giant. 2802 */ 2803void 2804pmap_zero_page_idle(vm_page_t m) 2805{ 2806 vm_offset_t phys; 2807 2808 phys = VM_PAGE_TO_PHYS(m); 2809 if (*CMAP3) 2810 panic("pmap_zero_page: CMAP3 busy"); 2811 *CMAP3 = PG_V | PG_RW | phys | PG_A | PG_M; 2812#ifdef I386_CPU 2813 invltlb(); 2814#else 2815#ifdef SMP 2816 curthread->td_switchin = pmap_zpi_switchin3; 2817#endif 2818 invlpg((u_int)CADDR3); 2819#endif 2820#if defined(I686_CPU) 2821 if (cpu_class == CPUCLASS_686) 2822 i686_pagezero(CADDR3); 2823 else 2824#endif 2825 bzero(CADDR3, PAGE_SIZE); 2826#ifdef SMP 2827 curthread->td_switchin = NULL; 2828#endif 2829 *CMAP3 = 0; 2830} 2831 2832/* 2833 * pmap_copy_page copies the specified (machine independent) 2834 * page by mapping the page into virtual memory and using 2835 * bcopy to copy the page, one machine dependent page at a 2836 * time. 2837 */ 2838void 2839pmap_copy_page(vm_page_t src, vm_page_t dst) 2840{ 2841 2842 if (*CMAP1) 2843 panic("pmap_copy_page: CMAP1 busy"); 2844 if (*CMAP2) 2845 panic("pmap_copy_page: CMAP2 busy"); 2846 *CMAP1 = PG_V | VM_PAGE_TO_PHYS(src) | PG_A; 2847 *CMAP2 = PG_V | PG_RW | VM_PAGE_TO_PHYS(dst) | PG_A | PG_M; 2848#ifdef I386_CPU 2849 invltlb(); 2850#else 2851#ifdef SMP 2852 curthread->td_switchin = pmap_zpi_switchin12; 2853#endif 2854 invlpg((u_int)CADDR1); 2855 invlpg((u_int)CADDR2); 2856#endif 2857 bcopy(CADDR1, CADDR2, PAGE_SIZE); 2858#ifdef SMP 2859 curthread->td_switchin = NULL; 2860#endif 2861 *CMAP1 = 0; 2862 *CMAP2 = 0; 2863} 2864 2865/* 2866 * Returns true if the pmap's pv is one of the first 2867 * 16 pvs linked to from this page. This count may 2868 * be changed upwards or downwards in the future; it 2869 * is only necessary that true be returned for a small 2870 * subset of pmaps for proper page aging. 2871 */ 2872boolean_t 2873pmap_page_exists_quick(pmap, m) 2874 pmap_t pmap; 2875 vm_page_t m; 2876{ 2877 pv_entry_t pv; 2878 int loops = 0; 2879 int s; 2880 2881 if (!pmap_initialized || (m->flags & PG_FICTITIOUS)) 2882 return FALSE; 2883 2884 s = splvm(); 2885 mtx_assert(&vm_page_queue_mtx, MA_OWNED); 2886 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) { 2887 if (pv->pv_pmap == pmap) { 2888 splx(s); 2889 return TRUE; 2890 } 2891 loops++; 2892 if (loops >= 16) 2893 break; 2894 } 2895 splx(s); 2896 return (FALSE); 2897} 2898 2899#define PMAP_REMOVE_PAGES_CURPROC_ONLY 2900/* 2901 * Remove all pages from specified address space 2902 * this aids process exit speeds. Also, this code 2903 * is special cased for current process only, but 2904 * can have the more generic (and slightly slower) 2905 * mode enabled. This is much faster than pmap_remove 2906 * in the case of running down an entire address space. 2907 */ 2908void 2909pmap_remove_pages(pmap, sva, eva) 2910 pmap_t pmap; 2911 vm_offset_t sva, eva; 2912{ 2913 pt_entry_t *pte, tpte; 2914 vm_page_t m; 2915 pv_entry_t pv, npv; 2916 int s; 2917 2918#ifdef PMAP_REMOVE_PAGES_CURPROC_ONLY 2919 if (!curthread || (pmap != vmspace_pmap(curthread->td_proc->p_vmspace))) { 2920 printf("warning: pmap_remove_pages called with non-current pmap\n"); 2921 return; 2922 } 2923#endif 2924 mtx_assert(&vm_page_queue_mtx, MA_OWNED); 2925 s = splvm(); 2926 for (pv = TAILQ_FIRST(&pmap->pm_pvlist); pv; pv = npv) { 2927 2928 if (pv->pv_va >= eva || pv->pv_va < sva) { 2929 npv = TAILQ_NEXT(pv, pv_plist); 2930 continue; 2931 } 2932 2933#ifdef PMAP_REMOVE_PAGES_CURPROC_ONLY 2934 pte = vtopte(pv->pv_va); 2935#else 2936 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va); 2937#endif 2938 tpte = *pte; 2939 2940 if (tpte == 0) { 2941 printf("TPTE at %p IS ZERO @ VA %08x\n", 2942 pte, pv->pv_va); 2943 panic("bad pte"); 2944 } 2945 2946/* 2947 * We cannot remove wired pages from a process' mapping at this time 2948 */ 2949 if (tpte & PG_W) { 2950 npv = TAILQ_NEXT(pv, pv_plist); 2951 continue; 2952 } 2953 2954 m = PHYS_TO_VM_PAGE(tpte); 2955 KASSERT(m->phys_addr == (tpte & PG_FRAME), 2956 ("vm_page_t %p phys_addr mismatch %08x %08x", 2957 m, m->phys_addr, tpte)); 2958 2959 KASSERT(m < &vm_page_array[vm_page_array_size], 2960 ("pmap_remove_pages: bad tpte %x", tpte)); 2961 2962 pv->pv_pmap->pm_stats.resident_count--; 2963 2964 *pte = 0; 2965 2966 /* 2967 * Update the vm_page_t clean and reference bits. 2968 */ 2969 if (tpte & PG_M) { 2970 vm_page_dirty(m); 2971 } 2972 2973 npv = TAILQ_NEXT(pv, pv_plist); 2974 TAILQ_REMOVE(&pv->pv_pmap->pm_pvlist, pv, pv_plist); 2975 2976 m->md.pv_list_count--; 2977 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list); 2978 if (TAILQ_FIRST(&m->md.pv_list) == NULL) { 2979 vm_page_flag_clear(m, PG_WRITEABLE); 2980 } 2981 2982 pmap_unuse_pt(pv->pv_pmap, pv->pv_va, pv->pv_ptem); 2983 free_pv_entry(pv); 2984 } 2985 splx(s); 2986 pmap_invalidate_all(pmap); 2987} 2988 2989/* 2990 * pmap_testbit tests bits in pte's 2991 * note that the testbit/changebit routines are inline, 2992 * and a lot of things compile-time evaluate. 2993 */ 2994static boolean_t 2995pmap_testbit(m, bit) 2996 vm_page_t m; 2997 int bit; 2998{ 2999 pv_entry_t pv; 3000 pt_entry_t *pte; 3001 int s; 3002 3003 if (!pmap_initialized || (m->flags & PG_FICTITIOUS)) 3004 return FALSE; 3005 3006 if (TAILQ_FIRST(&m->md.pv_list) == NULL) 3007 return FALSE; 3008 3009 s = splvm(); 3010 mtx_assert(&vm_page_queue_mtx, MA_OWNED); 3011 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) { 3012 /* 3013 * if the bit being tested is the modified bit, then 3014 * mark clean_map and ptes as never 3015 * modified. 3016 */ 3017 if (bit & (PG_A|PG_M)) { 3018 if (!pmap_track_modified(pv->pv_va)) 3019 continue; 3020 } 3021 3022#if defined(PMAP_DIAGNOSTIC) 3023 if (!pv->pv_pmap) { 3024 printf("Null pmap (tb) at va: 0x%x\n", pv->pv_va); 3025 continue; 3026 } 3027#endif 3028 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va); 3029 if (*pte & bit) { 3030 splx(s); 3031 return TRUE; 3032 } 3033 } 3034 splx(s); 3035 return (FALSE); 3036} 3037 3038/* 3039 * this routine is used to modify bits in ptes 3040 */ 3041static __inline void 3042pmap_changebit(vm_page_t m, int bit, boolean_t setem) 3043{ 3044 register pv_entry_t pv; 3045 register pt_entry_t *pte; 3046 int s; 3047 3048 if (!pmap_initialized || (m->flags & PG_FICTITIOUS) || 3049 (!setem && bit == PG_RW && (m->flags & PG_WRITEABLE) == 0)) 3050 return; 3051 3052 s = splvm(); 3053 mtx_assert(&vm_page_queue_mtx, MA_OWNED); 3054 /* 3055 * Loop over all current mappings setting/clearing as appropos If 3056 * setting RO do we need to clear the VAC? 3057 */ 3058 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) { 3059 /* 3060 * don't write protect pager mappings 3061 */ 3062 if (!setem && (bit == PG_RW)) { 3063 if (!pmap_track_modified(pv->pv_va)) 3064 continue; 3065 } 3066 3067#if defined(PMAP_DIAGNOSTIC) 3068 if (!pv->pv_pmap) { 3069 printf("Null pmap (cb) at va: 0x%x\n", pv->pv_va); 3070 continue; 3071 } 3072#endif 3073 3074 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va); 3075 3076 if (setem) { 3077 *pte |= bit; 3078 pmap_invalidate_page(pv->pv_pmap, pv->pv_va); 3079 } else { 3080 pt_entry_t pbits = *pte; 3081 if (pbits & bit) { 3082 if (bit == PG_RW) { 3083 if (pbits & PG_M) { 3084 vm_page_dirty(m); 3085 } 3086 *pte = pbits & ~(PG_M|PG_RW); 3087 } else { 3088 *pte = pbits & ~bit; 3089 } 3090 pmap_invalidate_page(pv->pv_pmap, pv->pv_va); 3091 } 3092 } 3093 } 3094 if (!setem && bit == PG_RW) 3095 vm_page_flag_clear(m, PG_WRITEABLE); 3096 splx(s); 3097} 3098 3099/* 3100 * pmap_page_protect: 3101 * 3102 * Lower the permission for all mappings to a given page. 3103 */ 3104void 3105pmap_page_protect(vm_page_t m, vm_prot_t prot) 3106{ 3107 if ((prot & VM_PROT_WRITE) == 0) { 3108 if (prot & (VM_PROT_READ | VM_PROT_EXECUTE)) { 3109 pmap_changebit(m, PG_RW, FALSE); 3110 } else { 3111 pmap_remove_all(m); 3112 } 3113 } 3114} 3115 3116vm_offset_t 3117pmap_phys_address(ppn) 3118 int ppn; 3119{ 3120 return (i386_ptob(ppn)); 3121} 3122 3123/* 3124 * pmap_ts_referenced: 3125 * 3126 * Return a count of reference bits for a page, clearing those bits. 3127 * It is not necessary for every reference bit to be cleared, but it 3128 * is necessary that 0 only be returned when there are truly no 3129 * reference bits set. 3130 * 3131 * XXX: The exact number of bits to check and clear is a matter that 3132 * should be tested and standardized at some point in the future for 3133 * optimal aging of shared pages. 3134 */ 3135int 3136pmap_ts_referenced(vm_page_t m) 3137{ 3138 register pv_entry_t pv, pvf, pvn; 3139 pt_entry_t *pte; 3140 int s; 3141 int rtval = 0; 3142 3143 if (!pmap_initialized || (m->flags & PG_FICTITIOUS)) 3144 return (rtval); 3145 3146 s = splvm(); 3147 mtx_assert(&vm_page_queue_mtx, MA_OWNED); 3148 if ((pv = TAILQ_FIRST(&m->md.pv_list)) != NULL) { 3149 3150 pvf = pv; 3151 3152 do { 3153 pvn = TAILQ_NEXT(pv, pv_list); 3154 3155 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list); 3156 3157 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_list); 3158 3159 if (!pmap_track_modified(pv->pv_va)) 3160 continue; 3161 3162 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va); 3163 3164 if (pte && (*pte & PG_A)) { 3165 *pte &= ~PG_A; 3166 3167 pmap_invalidate_page(pv->pv_pmap, pv->pv_va); 3168 3169 rtval++; 3170 if (rtval > 4) { 3171 break; 3172 } 3173 } 3174 } while ((pv = pvn) != NULL && pv != pvf); 3175 } 3176 splx(s); 3177 3178 return (rtval); 3179} 3180 3181/* 3182 * pmap_is_modified: 3183 * 3184 * Return whether or not the specified physical page was modified 3185 * in any physical maps. 3186 */ 3187boolean_t 3188pmap_is_modified(vm_page_t m) 3189{ 3190 return pmap_testbit(m, PG_M); 3191} 3192 3193/* 3194 * Clear the modify bits on the specified physical page. 3195 */ 3196void 3197pmap_clear_modify(vm_page_t m) 3198{ 3199 pmap_changebit(m, PG_M, FALSE); 3200} 3201 3202/* 3203 * pmap_clear_reference: 3204 * 3205 * Clear the reference bit on the specified physical page. 3206 */ 3207void 3208pmap_clear_reference(vm_page_t m) 3209{ 3210 pmap_changebit(m, PG_A, FALSE); 3211} 3212 3213/* 3214 * Miscellaneous support routines follow 3215 */ 3216 3217static void 3218i386_protection_init() 3219{ 3220 register int *kp, prot; 3221 3222 kp = protection_codes; 3223 for (prot = 0; prot < 8; prot++) { 3224 switch (prot) { 3225 case VM_PROT_NONE | VM_PROT_NONE | VM_PROT_NONE: 3226 /* 3227 * Read access is also 0. There isn't any execute bit, 3228 * so just make it readable. 3229 */ 3230 case VM_PROT_READ | VM_PROT_NONE | VM_PROT_NONE: 3231 case VM_PROT_READ | VM_PROT_NONE | VM_PROT_EXECUTE: 3232 case VM_PROT_NONE | VM_PROT_NONE | VM_PROT_EXECUTE: 3233 *kp++ = 0; 3234 break; 3235 case VM_PROT_NONE | VM_PROT_WRITE | VM_PROT_NONE: 3236 case VM_PROT_NONE | VM_PROT_WRITE | VM_PROT_EXECUTE: 3237 case VM_PROT_READ | VM_PROT_WRITE | VM_PROT_NONE: 3238 case VM_PROT_READ | VM_PROT_WRITE | VM_PROT_EXECUTE: 3239 *kp++ = PG_RW; 3240 break; 3241 } 3242 } 3243} 3244 3245/* 3246 * Map a set of physical memory pages into the kernel virtual 3247 * address space. Return a pointer to where it is mapped. This 3248 * routine is intended to be used for mapping device memory, 3249 * NOT real memory. 3250 */ 3251void * 3252pmap_mapdev(pa, size) 3253 vm_offset_t pa; 3254 vm_size_t size; 3255{ 3256 vm_offset_t va, tmpva, offset; 3257 pt_entry_t *pte; 3258 3259 offset = pa & PAGE_MASK; 3260 size = roundup(offset + size, PAGE_SIZE); 3261 3262 GIANT_REQUIRED; 3263 3264 va = kmem_alloc_pageable(kernel_map, size); 3265 if (!va) 3266 panic("pmap_mapdev: Couldn't alloc kernel virtual memory"); 3267 3268 pa = pa & PG_FRAME; 3269 for (tmpva = va; size > 0; ) { 3270 pte = vtopte(tmpva); 3271 *pte = pa | PG_RW | PG_V | pgeflag; 3272 size -= PAGE_SIZE; 3273 tmpva += PAGE_SIZE; 3274 pa += PAGE_SIZE; 3275 } 3276 pmap_invalidate_range(kernel_pmap, va, tmpva); 3277 return ((void *)(va + offset)); 3278} 3279 3280void 3281pmap_unmapdev(va, size) 3282 vm_offset_t va; 3283 vm_size_t size; 3284{ 3285 vm_offset_t base, offset, tmpva; 3286 pt_entry_t *pte; 3287 3288 base = va & PG_FRAME; 3289 offset = va & PAGE_MASK; 3290 size = roundup(offset + size, PAGE_SIZE); 3291 for (tmpva = base; tmpva < (base + size); tmpva += PAGE_SIZE) { 3292 pte = vtopte(tmpva); 3293 *pte = 0; 3294 } 3295 pmap_invalidate_range(kernel_pmap, va, tmpva); 3296 kmem_free(kernel_map, base, size); 3297} 3298 3299/* 3300 * perform the pmap work for mincore 3301 */ 3302int 3303pmap_mincore(pmap, addr) 3304 pmap_t pmap; 3305 vm_offset_t addr; 3306{ 3307 pt_entry_t *ptep, pte; 3308 vm_page_t m; 3309 int val = 0; 3310 3311 ptep = pmap_pte(pmap, addr); 3312 if (ptep == 0) { 3313 return 0; 3314 } 3315 3316 if ((pte = *ptep) != 0) { 3317 vm_offset_t pa; 3318 3319 val = MINCORE_INCORE; 3320 if ((pte & PG_MANAGED) == 0) 3321 return val; 3322 3323 pa = pte & PG_FRAME; 3324 3325 m = PHYS_TO_VM_PAGE(pa); 3326 3327 /* 3328 * Modified by us 3329 */ 3330 if (pte & PG_M) 3331 val |= MINCORE_MODIFIED|MINCORE_MODIFIED_OTHER; 3332 else { 3333 /* 3334 * Modified by someone else 3335 */ 3336 vm_page_lock_queues(); 3337 if (m->dirty || pmap_is_modified(m)) 3338 val |= MINCORE_MODIFIED_OTHER; 3339 vm_page_unlock_queues(); 3340 } 3341 /* 3342 * Referenced by us 3343 */ 3344 if (pte & PG_A) 3345 val |= MINCORE_REFERENCED|MINCORE_REFERENCED_OTHER; 3346 else { 3347 /* 3348 * Referenced by someone else 3349 */ 3350 vm_page_lock_queues(); 3351 if ((m->flags & PG_REFERENCED) || 3352 pmap_ts_referenced(m)) { 3353 val |= MINCORE_REFERENCED_OTHER; 3354 vm_page_flag_set(m, PG_REFERENCED); 3355 } 3356 vm_page_unlock_queues(); 3357 } 3358 } 3359 return val; 3360} 3361 3362void 3363pmap_activate(struct thread *td) 3364{ 3365 struct proc *p = td->td_proc; 3366 pmap_t pmap; 3367 u_int32_t cr3; 3368 3369 pmap = vmspace_pmap(td->td_proc->p_vmspace); 3370#if defined(SMP) 3371 pmap->pm_active |= PCPU_GET(cpumask); 3372#else 3373 pmap->pm_active |= 1; 3374#endif 3375 cr3 = vtophys(pmap->pm_pdir); 3376 /* XXXKSE this is wrong. 3377 * pmap_activate is for the current thread on the current cpu 3378 */ 3379 if (p->p_flag & P_KSES) { 3380 /* Make sure all other cr3 entries are updated. */ 3381 /* what if they are running? XXXKSE (maybe abort them) */ 3382 FOREACH_THREAD_IN_PROC(p, td) { 3383 td->td_pcb->pcb_cr3 = cr3; 3384 } 3385 } else { 3386 td->td_pcb->pcb_cr3 = cr3; 3387 } 3388 load_cr3(cr3); 3389#ifdef SWTCH_OPTIM_STATS 3390 tlb_flush_count++; 3391#endif 3392} 3393 3394vm_offset_t 3395pmap_addr_hint(vm_object_t obj, vm_offset_t addr, vm_size_t size) 3396{ 3397 3398 if ((obj == NULL) || (size < NBPDR) || (obj->type != OBJT_DEVICE)) { 3399 return addr; 3400 } 3401 3402 addr = (addr + (NBPDR - 1)) & ~(NBPDR - 1); 3403 return addr; 3404} 3405 3406 3407#if defined(PMAP_DEBUG) 3408pmap_pid_dump(int pid) 3409{ 3410 pmap_t pmap; 3411 struct proc *p; 3412 int npte = 0; 3413 int index; 3414 3415 sx_slock(&allproc_lock); 3416 LIST_FOREACH(p, &allproc, p_list) { 3417 if (p->p_pid != pid) 3418 continue; 3419 3420 if (p->p_vmspace) { 3421 int i,j; 3422 index = 0; 3423 pmap = vmspace_pmap(p->p_vmspace); 3424 for (i = 0; i < NPDEPG; i++) { 3425 pd_entry_t *pde; 3426 pt_entry_t *pte; 3427 vm_offset_t base = i << PDRSHIFT; 3428 3429 pde = &pmap->pm_pdir[i]; 3430 if (pde && pmap_pde_v(pde)) { 3431 for (j = 0; j < NPTEPG; j++) { 3432 vm_offset_t va = base + (j << PAGE_SHIFT); 3433 if (va >= (vm_offset_t) VM_MIN_KERNEL_ADDRESS) { 3434 if (index) { 3435 index = 0; 3436 printf("\n"); 3437 } 3438 sx_sunlock(&allproc_lock); 3439 return npte; 3440 } 3441 pte = pmap_pte_quick(pmap, va); 3442 if (pte && pmap_pte_v(pte)) { 3443 pt_entry_t pa; 3444 vm_page_t m; 3445 pa = *pte; 3446 m = PHYS_TO_VM_PAGE(pa); 3447 printf("va: 0x%x, pt: 0x%x, h: %d, w: %d, f: 0x%x", 3448 va, pa, m->hold_count, m->wire_count, m->flags); 3449 npte++; 3450 index++; 3451 if (index >= 2) { 3452 index = 0; 3453 printf("\n"); 3454 } else { 3455 printf(" "); 3456 } 3457 } 3458 } 3459 } 3460 } 3461 } 3462 } 3463 sx_sunlock(&allproc_lock); 3464 return npte; 3465} 3466#endif 3467 3468#if defined(DEBUG) 3469 3470static void pads(pmap_t pm); 3471void pmap_pvdump(vm_offset_t pa); 3472 3473/* print address space of pmap*/ 3474static void 3475pads(pm) 3476 pmap_t pm; 3477{ 3478 int i, j; 3479 vm_offset_t va; 3480 pt_entry_t *ptep; 3481 3482 if (pm == kernel_pmap) 3483 return; 3484 for (i = 0; i < NPDEPG; i++) 3485 if (pm->pm_pdir[i]) 3486 for (j = 0; j < NPTEPG; j++) { 3487 va = (i << PDRSHIFT) + (j << PAGE_SHIFT); 3488 if (pm == kernel_pmap && va < KERNBASE) 3489 continue; 3490 if (pm != kernel_pmap && va > UPT_MAX_ADDRESS) 3491 continue; 3492 ptep = pmap_pte_quick(pm, va); 3493 if (pmap_pte_v(ptep)) 3494 printf("%x:%x ", va, *ptep); 3495 }; 3496 3497} 3498 3499void 3500pmap_pvdump(pa) 3501 vm_offset_t pa; 3502{ 3503 pv_entry_t pv; 3504 vm_page_t m; 3505 3506 printf("pa %x", pa); 3507 m = PHYS_TO_VM_PAGE(pa); 3508 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) { 3509 printf(" -> pmap %p, va %x", (void *)pv->pv_pmap, pv->pv_va); 3510 pads(pv->pv_pmap); 3511 } 3512 printf(" "); 3513} 3514#endif 3515