pmap.c revision 73903
1/* 2 * Copyright (c) 1991 Regents of the University of California. 3 * All rights reserved. 4 * Copyright (c) 1994 John S. Dyson 5 * All rights reserved. 6 * Copyright (c) 1994 David Greenman 7 * All rights reserved. 8 * 9 * This code is derived from software contributed to Berkeley by 10 * the Systems Programming Group of the University of Utah Computer 11 * Science Department and William Jolitz of UUNET Technologies Inc. 12 * 13 * Redistribution and use in source and binary forms, with or without 14 * modification, are permitted provided that the following conditions 15 * are met: 16 * 1. Redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer. 18 * 2. Redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution. 21 * 3. All advertising materials mentioning features or use of this software 22 * must display the following acknowledgement: 23 * This product includes software developed by the University of 24 * California, Berkeley and its contributors. 25 * 4. Neither the name of the University nor the names of its contributors 26 * may be used to endorse or promote products derived from this software 27 * without specific prior written permission. 28 * 29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 32 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 39 * SUCH DAMAGE. 40 * 41 * from: @(#)pmap.c 7.7 (Berkeley) 5/12/91 42 * $FreeBSD: head/sys/i386/i386/pmap.c 73903 2001-03-07 01:04:17Z jhb $ 43 */ 44 45/* 46 * Manages physical address maps. 47 * 48 * In addition to hardware address maps, this 49 * module is called upon to provide software-use-only 50 * maps which may or may not be stored in the same 51 * form as hardware maps. These pseudo-maps are 52 * used to store intermediate results from copy 53 * operations to and from address spaces. 54 * 55 * Since the information managed by this module is 56 * also stored by the logical address mapping module, 57 * this module may throw away valid virtual-to-physical 58 * mappings at almost any time. However, invalidations 59 * of virtual-to-physical mappings must be done as 60 * requested. 61 * 62 * In order to cope with hardware architectures which 63 * make virtual-to-physical map invalidates expensive, 64 * this module may delay invalidate or reduced protection 65 * operations until such time as they are actually 66 * necessary. This module is given full information as 67 * to which processors are currently using which maps, 68 * and to when physical maps must be made correct. 69 */ 70 71#include "opt_disable_pse.h" 72#include "opt_pmap.h" 73#include "opt_msgbuf.h" 74 75#include <sys/param.h> 76#include <sys/systm.h> 77#include <sys/proc.h> 78#include <sys/msgbuf.h> 79#include <sys/vmmeter.h> 80#include <sys/mman.h> 81 82#include <vm/vm.h> 83#include <vm/vm_param.h> 84#include <sys/lock.h> 85#include <vm/vm_kern.h> 86#include <vm/vm_page.h> 87#include <vm/vm_map.h> 88#include <vm/vm_object.h> 89#include <vm/vm_extern.h> 90#include <vm/vm_pageout.h> 91#include <vm/vm_pager.h> 92#include <vm/vm_zone.h> 93 94#include <sys/user.h> 95 96#include <machine/cputypes.h> 97#include <machine/md_var.h> 98#include <machine/specialreg.h> 99#if defined(SMP) || defined(APIC_IO) 100#include <machine/smp.h> 101#include <machine/apic.h> 102#include <machine/segments.h> 103#include <machine/tss.h> 104#include <machine/globaldata.h> 105#endif /* SMP || APIC_IO */ 106 107#define PMAP_KEEP_PDIRS 108#ifndef PMAP_SHPGPERPROC 109#define PMAP_SHPGPERPROC 200 110#endif 111 112#if defined(DIAGNOSTIC) 113#define PMAP_DIAGNOSTIC 114#endif 115 116#define MINPV 2048 117 118#if !defined(PMAP_DIAGNOSTIC) 119#define PMAP_INLINE __inline 120#else 121#define PMAP_INLINE 122#endif 123 124/* 125 * Get PDEs and PTEs for user/kernel address space 126 */ 127#define pmap_pde(m, v) (&((m)->pm_pdir[(vm_offset_t)(v) >> PDRSHIFT])) 128#define pdir_pde(m, v) (m[(vm_offset_t)(v) >> PDRSHIFT]) 129 130#define pmap_pde_v(pte) ((*(int *)pte & PG_V) != 0) 131#define pmap_pte_w(pte) ((*(int *)pte & PG_W) != 0) 132#define pmap_pte_m(pte) ((*(int *)pte & PG_M) != 0) 133#define pmap_pte_u(pte) ((*(int *)pte & PG_A) != 0) 134#define pmap_pte_v(pte) ((*(int *)pte & PG_V) != 0) 135 136#define pmap_pte_set_w(pte, v) ((v)?(*(int *)pte |= PG_W):(*(int *)pte &= ~PG_W)) 137#define pmap_pte_set_prot(pte, v) ((*(int *)pte &= ~PG_PROT), (*(int *)pte |= (v))) 138 139/* 140 * Given a map and a machine independent protection code, 141 * convert to a vax protection code. 142 */ 143#define pte_prot(m, p) (protection_codes[p]) 144static int protection_codes[8]; 145 146static struct pmap kernel_pmap_store; 147pmap_t kernel_pmap; 148LIST_HEAD(pmaplist, pmap); 149struct pmaplist allpmaps; 150 151vm_offset_t avail_start; /* PA of first available physical page */ 152vm_offset_t avail_end; /* PA of last available physical page */ 153vm_offset_t virtual_avail; /* VA of first avail page (after kernel bss) */ 154vm_offset_t virtual_end; /* VA of last avail page (end of kernel AS) */ 155static boolean_t pmap_initialized = FALSE; /* Has pmap_init completed? */ 156static int pgeflag; /* PG_G or-in */ 157static int pseflag; /* PG_PS or-in */ 158 159static vm_object_t kptobj; 160 161static int nkpt; 162vm_offset_t kernel_vm_end; 163 164/* 165 * Data for the pv entry allocation mechanism 166 */ 167static vm_zone_t pvzone; 168static struct vm_zone pvzone_store; 169static struct vm_object pvzone_obj; 170static int pv_entry_count=0, pv_entry_max=0, pv_entry_high_water=0; 171static int pmap_pagedaemon_waken = 0; 172static struct pv_entry *pvinit; 173 174/* 175 * All those kernel PT submaps that BSD is so fond of 176 */ 177pt_entry_t *CMAP1 = 0; 178static pt_entry_t *CMAP2, *ptmmap; 179caddr_t CADDR1 = 0, ptvmmap = 0; 180static caddr_t CADDR2; 181static pt_entry_t *msgbufmap; 182struct msgbuf *msgbufp=0; 183 184/* 185 * Crashdump maps. 186 */ 187static pt_entry_t *pt_crashdumpmap; 188static caddr_t crashdumpmap; 189 190#ifdef SMP 191extern pt_entry_t *SMPpt; 192#endif 193static pt_entry_t *PMAP1 = 0; 194static unsigned *PADDR1 = 0; 195 196static PMAP_INLINE void free_pv_entry __P((pv_entry_t pv)); 197static unsigned * get_ptbase __P((pmap_t pmap)); 198static pv_entry_t get_pv_entry __P((void)); 199static void i386_protection_init __P((void)); 200static __inline void pmap_changebit __P((vm_page_t m, int bit, boolean_t setem)); 201 202static void pmap_remove_all __P((vm_page_t m)); 203static vm_page_t pmap_enter_quick __P((pmap_t pmap, vm_offset_t va, 204 vm_page_t m, vm_page_t mpte)); 205static int pmap_remove_pte __P((struct pmap *pmap, unsigned *ptq, 206 vm_offset_t sva)); 207static void pmap_remove_page __P((struct pmap *pmap, vm_offset_t va)); 208static int pmap_remove_entry __P((struct pmap *pmap, vm_page_t m, 209 vm_offset_t va)); 210static boolean_t pmap_testbit __P((vm_page_t m, int bit)); 211static void pmap_insert_entry __P((pmap_t pmap, vm_offset_t va, 212 vm_page_t mpte, vm_page_t m)); 213 214static vm_page_t pmap_allocpte __P((pmap_t pmap, vm_offset_t va)); 215 216static int pmap_release_free_page __P((pmap_t pmap, vm_page_t p)); 217static vm_page_t _pmap_allocpte __P((pmap_t pmap, unsigned ptepindex)); 218static unsigned * pmap_pte_quick __P((pmap_t pmap, vm_offset_t va)); 219static vm_page_t pmap_page_lookup __P((vm_object_t object, vm_pindex_t pindex)); 220static int pmap_unuse_pt __P((pmap_t, vm_offset_t, vm_page_t)); 221static vm_offset_t pmap_kmem_choose(vm_offset_t addr); 222 223static unsigned pdir4mb; 224 225/* 226 * Routine: pmap_pte 227 * Function: 228 * Extract the page table entry associated 229 * with the given map/virtual_address pair. 230 */ 231 232PMAP_INLINE unsigned * 233pmap_pte(pmap, va) 234 register pmap_t pmap; 235 vm_offset_t va; 236{ 237 unsigned *pdeaddr; 238 239 if (pmap) { 240 pdeaddr = (unsigned *) pmap_pde(pmap, va); 241 if (*pdeaddr & PG_PS) 242 return pdeaddr; 243 if (*pdeaddr) { 244 return get_ptbase(pmap) + i386_btop(va); 245 } 246 } 247 return (0); 248} 249 250/* 251 * Move the kernel virtual free pointer to the next 252 * 4MB. This is used to help improve performance 253 * by using a large (4MB) page for much of the kernel 254 * (.text, .data, .bss) 255 */ 256static vm_offset_t 257pmap_kmem_choose(vm_offset_t addr) 258{ 259 vm_offset_t newaddr = addr; 260#ifndef DISABLE_PSE 261 if (cpu_feature & CPUID_PSE) { 262 newaddr = (addr + (NBPDR - 1)) & ~(NBPDR - 1); 263 } 264#endif 265 return newaddr; 266} 267 268/* 269 * Bootstrap the system enough to run with virtual memory. 270 * 271 * On the i386 this is called after mapping has already been enabled 272 * and just syncs the pmap module with what has already been done. 273 * [We can't call it easily with mapping off since the kernel is not 274 * mapped with PA == VA, hence we would have to relocate every address 275 * from the linked base (virtual) address "KERNBASE" to the actual 276 * (physical) address starting relative to 0] 277 */ 278void 279pmap_bootstrap(firstaddr, loadaddr) 280 vm_offset_t firstaddr; 281 vm_offset_t loadaddr; 282{ 283 vm_offset_t va; 284 pt_entry_t *pte; 285 286 avail_start = firstaddr; 287 288 /* 289 * XXX The calculation of virtual_avail is wrong. It's NKPT*PAGE_SIZE too 290 * large. It should instead be correctly calculated in locore.s and 291 * not based on 'first' (which is a physical address, not a virtual 292 * address, for the start of unused physical memory). The kernel 293 * page tables are NOT double mapped and thus should not be included 294 * in this calculation. 295 */ 296 virtual_avail = (vm_offset_t) KERNBASE + firstaddr; 297 virtual_avail = pmap_kmem_choose(virtual_avail); 298 299 virtual_end = VM_MAX_KERNEL_ADDRESS; 300 301 /* 302 * Initialize protection array. 303 */ 304 i386_protection_init(); 305 306 /* 307 * The kernel's pmap is statically allocated so we don't have to use 308 * pmap_create, which is unlikely to work correctly at this part of 309 * the boot sequence (XXX and which no longer exists). 310 */ 311 kernel_pmap = &kernel_pmap_store; 312 313 kernel_pmap->pm_pdir = (pd_entry_t *) (KERNBASE + (u_int)IdlePTD); 314 kernel_pmap->pm_count = 1; 315 kernel_pmap->pm_active = -1; /* don't allow deactivation */ 316 TAILQ_INIT(&kernel_pmap->pm_pvlist); 317 LIST_INIT(&allpmaps); 318 LIST_INSERT_HEAD(&allpmaps, kernel_pmap, pm_list); 319 nkpt = NKPT; 320 321 /* 322 * Reserve some special page table entries/VA space for temporary 323 * mapping of pages. 324 */ 325#define SYSMAP(c, p, v, n) \ 326 v = (c)va; va += ((n)*PAGE_SIZE); p = pte; pte += (n); 327 328 va = virtual_avail; 329 pte = (pt_entry_t *) pmap_pte(kernel_pmap, va); 330 331 /* 332 * CMAP1/CMAP2 are used for zeroing and copying pages. 333 */ 334 SYSMAP(caddr_t, CMAP1, CADDR1, 1) 335 SYSMAP(caddr_t, CMAP2, CADDR2, 1) 336 337 /* 338 * Crashdump maps. 339 */ 340 SYSMAP(caddr_t, pt_crashdumpmap, crashdumpmap, MAXDUMPPGS); 341 342 /* 343 * ptvmmap is used for reading arbitrary physical pages via /dev/mem. 344 * XXX ptmmap is not used. 345 */ 346 SYSMAP(caddr_t, ptmmap, ptvmmap, 1) 347 348 /* 349 * msgbufp is used to map the system message buffer. 350 * XXX msgbufmap is not used. 351 */ 352 SYSMAP(struct msgbuf *, msgbufmap, msgbufp, 353 atop(round_page(MSGBUF_SIZE))) 354 355 /* 356 * ptemap is used for pmap_pte_quick 357 */ 358 SYSMAP(unsigned *, PMAP1, PADDR1, 1); 359 360 virtual_avail = va; 361 362 *(int *) CMAP1 = *(int *) CMAP2 = 0; 363 *(int *) PTD = 0; 364 365 366 pgeflag = 0; 367#if !defined(SMP) /* XXX - see also mp_machdep.c */ 368 if (cpu_feature & CPUID_PGE) { 369 pgeflag = PG_G; 370 } 371#endif 372 373/* 374 * Initialize the 4MB page size flag 375 */ 376 pseflag = 0; 377/* 378 * The 4MB page version of the initial 379 * kernel page mapping. 380 */ 381 pdir4mb = 0; 382 383#if !defined(DISABLE_PSE) 384 if (cpu_feature & CPUID_PSE) { 385 unsigned ptditmp; 386 /* 387 * Note that we have enabled PSE mode 388 */ 389 pseflag = PG_PS; 390 ptditmp = *((unsigned *)PTmap + i386_btop(KERNBASE)); 391 ptditmp &= ~(NBPDR - 1); 392 ptditmp |= PG_V | PG_RW | PG_PS | PG_U | pgeflag; 393 pdir4mb = ptditmp; 394 395#if !defined(SMP) 396 /* 397 * Enable the PSE mode. 398 */ 399 load_cr4(rcr4() | CR4_PSE); 400 401 /* 402 * We can do the mapping here for the single processor 403 * case. We simply ignore the old page table page from 404 * now on. 405 */ 406 /* 407 * For SMP, we still need 4K pages to bootstrap APs, 408 * PSE will be enabled as soon as all APs are up. 409 */ 410 PTD[KPTDI] = (pd_entry_t) ptditmp; 411 kernel_pmap->pm_pdir[KPTDI] = (pd_entry_t) ptditmp; 412 invltlb(); 413#endif 414 } 415#endif 416 417#ifdef SMP 418 if (cpu_apic_address == 0) 419 panic("pmap_bootstrap: no local apic! (non-SMP hardware?)"); 420 421 /* local apic is mapped on last page */ 422 SMPpt[NPTEPG - 1] = (pt_entry_t)(PG_V | PG_RW | PG_N | pgeflag | 423 (cpu_apic_address & PG_FRAME)); 424#endif 425 426 invltlb(); 427} 428 429#ifdef SMP 430/* 431 * Set 4mb pdir for mp startup 432 */ 433void 434pmap_set_opt(void) 435{ 436 if (pseflag && (cpu_feature & CPUID_PSE)) { 437 load_cr4(rcr4() | CR4_PSE); 438 if (pdir4mb && PCPU_GET(cpuid) == 0) { /* only on BSP */ 439 kernel_pmap->pm_pdir[KPTDI] = 440 PTD[KPTDI] = (pd_entry_t)pdir4mb; 441 cpu_invltlb(); 442 } 443 } 444} 445#endif 446 447/* 448 * Initialize the pmap module. 449 * Called by vm_init, to initialize any structures that the pmap 450 * system needs to map virtual memory. 451 * pmap_init has been enhanced to support in a fairly consistant 452 * way, discontiguous physical memory. 453 */ 454void 455pmap_init(phys_start, phys_end) 456 vm_offset_t phys_start, phys_end; 457{ 458 int i; 459 int initial_pvs; 460 461 /* 462 * object for kernel page table pages 463 */ 464 kptobj = vm_object_allocate(OBJT_DEFAULT, NKPDE); 465 466 /* 467 * Allocate memory for random pmap data structures. Includes the 468 * pv_head_table. 469 */ 470 471 for(i = 0; i < vm_page_array_size; i++) { 472 vm_page_t m; 473 474 m = &vm_page_array[i]; 475 TAILQ_INIT(&m->md.pv_list); 476 m->md.pv_list_count = 0; 477 } 478 479 /* 480 * init the pv free list 481 */ 482 initial_pvs = vm_page_array_size; 483 if (initial_pvs < MINPV) 484 initial_pvs = MINPV; 485 pvzone = &pvzone_store; 486 pvinit = (struct pv_entry *) kmem_alloc(kernel_map, 487 initial_pvs * sizeof (struct pv_entry)); 488 zbootinit(pvzone, "PV ENTRY", sizeof (struct pv_entry), pvinit, 489 vm_page_array_size); 490 491 /* 492 * Now it is safe to enable pv_table recording. 493 */ 494 pmap_initialized = TRUE; 495} 496 497/* 498 * Initialize the address space (zone) for the pv_entries. Set a 499 * high water mark so that the system can recover from excessive 500 * numbers of pv entries. 501 */ 502void 503pmap_init2() 504{ 505 pv_entry_max = PMAP_SHPGPERPROC * maxproc + vm_page_array_size; 506 pv_entry_high_water = 9 * (pv_entry_max / 10); 507 zinitna(pvzone, &pvzone_obj, NULL, 0, pv_entry_max, ZONE_INTERRUPT, 1); 508} 509 510 511/*************************************************** 512 * Low level helper routines..... 513 ***************************************************/ 514 515#if defined(PMAP_DIAGNOSTIC) 516 517/* 518 * This code checks for non-writeable/modified pages. 519 * This should be an invalid condition. 520 */ 521static int 522pmap_nw_modified(pt_entry_t ptea) 523{ 524 int pte; 525 526 pte = (int) ptea; 527 528 if ((pte & (PG_M|PG_RW)) == PG_M) 529 return 1; 530 else 531 return 0; 532} 533#endif 534 535 536/* 537 * this routine defines the region(s) of memory that should 538 * not be tested for the modified bit. 539 */ 540static PMAP_INLINE int 541pmap_track_modified(vm_offset_t va) 542{ 543 if ((va < clean_sva) || (va >= clean_eva)) 544 return 1; 545 else 546 return 0; 547} 548 549static PMAP_INLINE void 550invltlb_1pg(vm_offset_t va) 551{ 552#ifdef I386_CPU 553 invltlb(); 554#else 555 invlpg(va); 556#endif 557} 558 559static __inline void 560pmap_TLB_invalidate(pmap_t pmap, vm_offset_t va) 561{ 562#if defined(SMP) 563 if (pmap->pm_active & (1 << PCPU_GET(cpuid))) 564 cpu_invlpg((void *)va); 565 if (pmap->pm_active & PCPU_GET(other_cpus)) 566 smp_invltlb(); 567#else 568 if (pmap->pm_active) 569 invltlb_1pg(va); 570#endif 571} 572 573static __inline void 574pmap_TLB_invalidate_all(pmap_t pmap) 575{ 576#if defined(SMP) 577 if (pmap->pm_active & (1 << PCPU_GET(cpuid))) 578 cpu_invltlb(); 579 if (pmap->pm_active & PCPU_GET(other_cpus)) 580 smp_invltlb(); 581#else 582 if (pmap->pm_active) 583 invltlb(); 584#endif 585} 586 587static unsigned * 588get_ptbase(pmap) 589 pmap_t pmap; 590{ 591 unsigned frame = (unsigned) pmap->pm_pdir[PTDPTDI] & PG_FRAME; 592 593 /* are we current address space or kernel? */ 594 if (pmap == kernel_pmap || frame == (((unsigned) PTDpde) & PG_FRAME)) { 595 return (unsigned *) PTmap; 596 } 597 /* otherwise, we are alternate address space */ 598 if (frame != (((unsigned) APTDpde) & PG_FRAME)) { 599 APTDpde = (pd_entry_t) (frame | PG_RW | PG_V); 600#if defined(SMP) 601 /* The page directory is not shared between CPUs */ 602 cpu_invltlb(); 603#else 604 invltlb(); 605#endif 606 } 607 return (unsigned *) APTmap; 608} 609 610/* 611 * Super fast pmap_pte routine best used when scanning 612 * the pv lists. This eliminates many coarse-grained 613 * invltlb calls. Note that many of the pv list 614 * scans are across different pmaps. It is very wasteful 615 * to do an entire invltlb for checking a single mapping. 616 */ 617 618static unsigned * 619pmap_pte_quick(pmap, va) 620 register pmap_t pmap; 621 vm_offset_t va; 622{ 623 unsigned pde, newpf; 624 if ((pde = (unsigned) pmap->pm_pdir[va >> PDRSHIFT]) != 0) { 625 unsigned frame = (unsigned) pmap->pm_pdir[PTDPTDI] & PG_FRAME; 626 unsigned index = i386_btop(va); 627 /* are we current address space or kernel? */ 628 if ((pmap == kernel_pmap) || 629 (frame == (((unsigned) PTDpde) & PG_FRAME))) { 630 return (unsigned *) PTmap + index; 631 } 632 newpf = pde & PG_FRAME; 633 if ( ((* (unsigned *) PMAP1) & PG_FRAME) != newpf) { 634 * (unsigned *) PMAP1 = newpf | PG_RW | PG_V; 635 invltlb_1pg((vm_offset_t) PADDR1); 636 } 637 return PADDR1 + ((unsigned) index & (NPTEPG - 1)); 638 } 639 return (0); 640} 641 642/* 643 * Routine: pmap_extract 644 * Function: 645 * Extract the physical page address associated 646 * with the given map/virtual_address pair. 647 */ 648vm_offset_t 649pmap_extract(pmap, va) 650 register pmap_t pmap; 651 vm_offset_t va; 652{ 653 vm_offset_t rtval; 654 vm_offset_t pdirindex; 655 pdirindex = va >> PDRSHIFT; 656 if (pmap && (rtval = (unsigned) pmap->pm_pdir[pdirindex])) { 657 unsigned *pte; 658 if ((rtval & PG_PS) != 0) { 659 rtval &= ~(NBPDR - 1); 660 rtval |= va & (NBPDR - 1); 661 return rtval; 662 } 663 pte = get_ptbase(pmap) + i386_btop(va); 664 rtval = ((*pte & PG_FRAME) | (va & PAGE_MASK)); 665 return rtval; 666 } 667 return 0; 668 669} 670 671/*************************************************** 672 * Low level mapping routines..... 673 ***************************************************/ 674 675/* 676 * add a wired page to the kva 677 * note that in order for the mapping to take effect -- you 678 * should do a invltlb after doing the pmap_kenter... 679 */ 680PMAP_INLINE void 681pmap_kenter(va, pa) 682 vm_offset_t va; 683 register vm_offset_t pa; 684{ 685 register unsigned *pte; 686 unsigned npte, opte; 687 688 npte = pa | PG_RW | PG_V | pgeflag; 689 pte = (unsigned *)vtopte(va); 690 opte = *pte; 691 *pte = npte; 692 /*if (opte)*/ 693 invltlb_1pg(va); /* XXX what about SMP? */ 694} 695 696/* 697 * remove a page from the kernel pagetables 698 */ 699PMAP_INLINE void 700pmap_kremove(va) 701 vm_offset_t va; 702{ 703 register unsigned *pte; 704 705 pte = (unsigned *)vtopte(va); 706 *pte = 0; 707 invltlb_1pg(va); /* XXX what about SMP? */ 708} 709 710/* 711 * Used to map a range of physical addresses into kernel 712 * virtual address space. 713 * 714 * For now, VM is already on, we only need to map the 715 * specified memory. 716 */ 717vm_offset_t 718pmap_map(virt, start, end, prot) 719 vm_offset_t virt; 720 vm_offset_t start; 721 vm_offset_t end; 722 int prot; 723{ 724 while (start < end) { 725 pmap_kenter(virt, start); 726 virt += PAGE_SIZE; 727 start += PAGE_SIZE; 728 } 729 return (virt); 730} 731 732 733/* 734 * Add a list of wired pages to the kva 735 * this routine is only used for temporary 736 * kernel mappings that do not need to have 737 * page modification or references recorded. 738 * Note that old mappings are simply written 739 * over. The page *must* be wired. 740 */ 741void 742pmap_qenter(va, m, count) 743 vm_offset_t va; 744 vm_page_t *m; 745 int count; 746{ 747 int i; 748 749 for (i = 0; i < count; i++) { 750 vm_offset_t tva = va + i * PAGE_SIZE; 751 pmap_kenter(tva, VM_PAGE_TO_PHYS(m[i])); 752 } 753} 754 755/* 756 * this routine jerks page mappings from the 757 * kernel -- it is meant only for temporary mappings. 758 */ 759void 760pmap_qremove(va, count) 761 vm_offset_t va; 762 int count; 763{ 764 vm_offset_t end_va; 765 766 end_va = va + count*PAGE_SIZE; 767 768 while (va < end_va) { 769 unsigned *pte; 770 771 pte = (unsigned *)vtopte(va); 772 *pte = 0; 773#ifdef SMP 774 cpu_invlpg((void *)va); 775#else 776 invltlb_1pg(va); 777#endif 778 va += PAGE_SIZE; 779 } 780#ifdef SMP 781 smp_invltlb(); 782#endif 783} 784 785static vm_page_t 786pmap_page_lookup(object, pindex) 787 vm_object_t object; 788 vm_pindex_t pindex; 789{ 790 vm_page_t m; 791retry: 792 m = vm_page_lookup(object, pindex); 793 if (m && vm_page_sleep_busy(m, FALSE, "pplookp")) 794 goto retry; 795 return m; 796} 797 798/* 799 * Create the UPAGES for a new process. 800 * This routine directly affects the fork perf for a process. 801 */ 802void 803pmap_new_proc(p) 804 struct proc *p; 805{ 806#ifdef I386_CPU 807 int updateneeded; 808#endif 809 int i; 810 vm_object_t upobj; 811 vm_page_t m; 812 struct user *up; 813 unsigned *ptek, oldpte; 814 815 /* 816 * allocate object for the upages 817 */ 818 if ((upobj = p->p_upages_obj) == NULL) { 819 upobj = vm_object_allocate( OBJT_DEFAULT, UPAGES); 820 p->p_upages_obj = upobj; 821 } 822 823 /* get a kernel virtual address for the UPAGES for this proc */ 824 if ((up = p->p_addr) == NULL) { 825 up = (struct user *) kmem_alloc_nofault(kernel_map, 826 UPAGES * PAGE_SIZE); 827 if (up == NULL) 828 panic("pmap_new_proc: u_map allocation failed"); 829 p->p_addr = up; 830 } 831 832 ptek = (unsigned *) vtopte((vm_offset_t) up); 833 834#ifdef I386_CPU 835 updateneeded = 0; 836#endif 837 for(i=0;i<UPAGES;i++) { 838 /* 839 * Get a kernel stack page 840 */ 841 m = vm_page_grab(upobj, i, VM_ALLOC_NORMAL | VM_ALLOC_RETRY); 842 843 /* 844 * Wire the page 845 */ 846 m->wire_count++; 847 cnt.v_wire_count++; 848 849 oldpte = *(ptek + i); 850 /* 851 * Enter the page into the kernel address space. 852 */ 853 *(ptek + i) = VM_PAGE_TO_PHYS(m) | PG_RW | PG_V | pgeflag; 854 if (oldpte) { 855#ifdef I386_CPU 856 updateneeded = 1; 857#else 858 invlpg((vm_offset_t) up + i * PAGE_SIZE); 859#endif 860 } 861 862 vm_page_wakeup(m); 863 vm_page_flag_clear(m, PG_ZERO); 864 vm_page_flag_set(m, PG_MAPPED | PG_WRITEABLE); 865 m->valid = VM_PAGE_BITS_ALL; 866 } 867#ifdef I386_CPU 868 if (updateneeded) 869 invltlb(); 870#endif 871} 872 873/* 874 * Dispose the UPAGES for a process that has exited. 875 * This routine directly impacts the exit perf of a process. 876 */ 877void 878pmap_dispose_proc(p) 879 struct proc *p; 880{ 881 int i; 882 vm_object_t upobj; 883 vm_page_t m; 884 unsigned *ptek, oldpte; 885 886 upobj = p->p_upages_obj; 887 888 ptek = (unsigned *) vtopte((vm_offset_t) p->p_addr); 889 for(i=0;i<UPAGES;i++) { 890 891 if ((m = vm_page_lookup(upobj, i)) == NULL) 892 panic("pmap_dispose_proc: upage already missing???"); 893 894 vm_page_busy(m); 895 896 oldpte = *(ptek + i); 897 *(ptek + i) = 0; 898#ifndef I386_CPU 899 invlpg((vm_offset_t) p->p_addr + i * PAGE_SIZE); 900#endif 901 vm_page_unwire(m, 0); 902 vm_page_free(m); 903 } 904#ifdef I386_CPU 905 invltlb(); 906#endif 907} 908 909/* 910 * Allow the UPAGES for a process to be prejudicially paged out. 911 */ 912void 913pmap_swapout_proc(p) 914 struct proc *p; 915{ 916 int i; 917 vm_object_t upobj; 918 vm_page_t m; 919 920 upobj = p->p_upages_obj; 921 /* 922 * let the upages be paged 923 */ 924 for(i=0;i<UPAGES;i++) { 925 if ((m = vm_page_lookup(upobj, i)) == NULL) 926 panic("pmap_swapout_proc: upage already missing???"); 927 vm_page_dirty(m); 928 vm_page_unwire(m, 0); 929 pmap_kremove( (vm_offset_t) p->p_addr + PAGE_SIZE * i); 930 } 931} 932 933/* 934 * Bring the UPAGES for a specified process back in. 935 */ 936void 937pmap_swapin_proc(p) 938 struct proc *p; 939{ 940 int i,rv; 941 vm_object_t upobj; 942 vm_page_t m; 943 944 upobj = p->p_upages_obj; 945 for(i=0;i<UPAGES;i++) { 946 947 m = vm_page_grab(upobj, i, VM_ALLOC_NORMAL | VM_ALLOC_RETRY); 948 949 pmap_kenter(((vm_offset_t) p->p_addr) + i * PAGE_SIZE, 950 VM_PAGE_TO_PHYS(m)); 951 952 if (m->valid != VM_PAGE_BITS_ALL) { 953 rv = vm_pager_get_pages(upobj, &m, 1, 0); 954 if (rv != VM_PAGER_OK) 955 panic("pmap_swapin_proc: cannot get upages for proc: %d\n", p->p_pid); 956 m = vm_page_lookup(upobj, i); 957 m->valid = VM_PAGE_BITS_ALL; 958 } 959 960 vm_page_wire(m); 961 vm_page_wakeup(m); 962 vm_page_flag_set(m, PG_MAPPED | PG_WRITEABLE); 963 } 964} 965 966/*************************************************** 967 * Page table page management routines..... 968 ***************************************************/ 969 970/* 971 * This routine unholds page table pages, and if the hold count 972 * drops to zero, then it decrements the wire count. 973 */ 974static int 975_pmap_unwire_pte_hold(pmap_t pmap, vm_page_t m) { 976 977 while (vm_page_sleep_busy(m, FALSE, "pmuwpt")) 978 ; 979 980 if (m->hold_count == 0) { 981 vm_offset_t pteva; 982 /* 983 * unmap the page table page 984 */ 985 pmap->pm_pdir[m->pindex] = 0; 986 --pmap->pm_stats.resident_count; 987 if ((((unsigned)pmap->pm_pdir[PTDPTDI]) & PG_FRAME) == 988 (((unsigned) PTDpde) & PG_FRAME)) { 989 /* 990 * Do a invltlb to make the invalidated mapping 991 * take effect immediately. 992 */ 993 pteva = UPT_MIN_ADDRESS + i386_ptob(m->pindex); 994 pmap_TLB_invalidate(pmap, pteva); 995 } 996 997 if (pmap->pm_ptphint == m) 998 pmap->pm_ptphint = NULL; 999 1000 /* 1001 * If the page is finally unwired, simply free it. 1002 */ 1003 --m->wire_count; 1004 if (m->wire_count == 0) { 1005 1006 vm_page_flash(m); 1007 vm_page_busy(m); 1008 vm_page_free_zero(m); 1009 --cnt.v_wire_count; 1010 } 1011 return 1; 1012 } 1013 return 0; 1014} 1015 1016static PMAP_INLINE int 1017pmap_unwire_pte_hold(pmap_t pmap, vm_page_t m) 1018{ 1019 vm_page_unhold(m); 1020 if (m->hold_count == 0) 1021 return _pmap_unwire_pte_hold(pmap, m); 1022 else 1023 return 0; 1024} 1025 1026/* 1027 * After removing a page table entry, this routine is used to 1028 * conditionally free the page, and manage the hold/wire counts. 1029 */ 1030static int 1031pmap_unuse_pt(pmap, va, mpte) 1032 pmap_t pmap; 1033 vm_offset_t va; 1034 vm_page_t mpte; 1035{ 1036 unsigned ptepindex; 1037 if (va >= UPT_MIN_ADDRESS) 1038 return 0; 1039 1040 if (mpte == NULL) { 1041 ptepindex = (va >> PDRSHIFT); 1042 if (pmap->pm_ptphint && 1043 (pmap->pm_ptphint->pindex == ptepindex)) { 1044 mpte = pmap->pm_ptphint; 1045 } else { 1046 mpte = pmap_page_lookup( pmap->pm_pteobj, ptepindex); 1047 pmap->pm_ptphint = mpte; 1048 } 1049 } 1050 1051 return pmap_unwire_pte_hold(pmap, mpte); 1052} 1053 1054void 1055pmap_pinit0(pmap) 1056 struct pmap *pmap; 1057{ 1058 pmap->pm_pdir = 1059 (pd_entry_t *)kmem_alloc_pageable(kernel_map, PAGE_SIZE); 1060 pmap_kenter((vm_offset_t) pmap->pm_pdir, (vm_offset_t) IdlePTD); 1061 pmap->pm_count = 1; 1062 pmap->pm_active = 0; 1063 pmap->pm_ptphint = NULL; 1064 TAILQ_INIT(&pmap->pm_pvlist); 1065 bzero(&pmap->pm_stats, sizeof pmap->pm_stats); 1066 LIST_INSERT_HEAD(&allpmaps, pmap, pm_list); 1067} 1068 1069/* 1070 * Initialize a preallocated and zeroed pmap structure, 1071 * such as one in a vmspace structure. 1072 */ 1073void 1074pmap_pinit(pmap) 1075 register struct pmap *pmap; 1076{ 1077 vm_page_t ptdpg; 1078 1079 /* 1080 * No need to allocate page table space yet but we do need a valid 1081 * page directory table. 1082 */ 1083 if (pmap->pm_pdir == NULL) 1084 pmap->pm_pdir = 1085 (pd_entry_t *)kmem_alloc_pageable(kernel_map, PAGE_SIZE); 1086 1087 /* 1088 * allocate object for the ptes 1089 */ 1090 if (pmap->pm_pteobj == NULL) 1091 pmap->pm_pteobj = vm_object_allocate( OBJT_DEFAULT, PTDPTDI + 1); 1092 1093 /* 1094 * allocate the page directory page 1095 */ 1096 ptdpg = vm_page_grab( pmap->pm_pteobj, PTDPTDI, 1097 VM_ALLOC_NORMAL | VM_ALLOC_RETRY); 1098 1099 ptdpg->wire_count = 1; 1100 ++cnt.v_wire_count; 1101 1102 1103 vm_page_flag_clear(ptdpg, PG_MAPPED | PG_BUSY); /* not usually mapped*/ 1104 ptdpg->valid = VM_PAGE_BITS_ALL; 1105 1106 pmap_kenter((vm_offset_t) pmap->pm_pdir, VM_PAGE_TO_PHYS(ptdpg)); 1107 if ((ptdpg->flags & PG_ZERO) == 0) 1108 bzero(pmap->pm_pdir, PAGE_SIZE); 1109 1110 LIST_INSERT_HEAD(&allpmaps, pmap, pm_list); 1111 /* Wire in kernel global address entries. */ 1112 /* XXX copies current process, does not fill in MPPTDI */ 1113 bcopy(PTD + KPTDI, pmap->pm_pdir + KPTDI, nkpt * PTESIZE); 1114#ifdef SMP 1115 pmap->pm_pdir[MPPTDI] = PTD[MPPTDI]; 1116#endif 1117 1118 /* install self-referential address mapping entry */ 1119 *(unsigned *) (pmap->pm_pdir + PTDPTDI) = 1120 VM_PAGE_TO_PHYS(ptdpg) | PG_V | PG_RW | PG_A | PG_M; 1121 1122 pmap->pm_count = 1; 1123 pmap->pm_active = 0; 1124 pmap->pm_ptphint = NULL; 1125 TAILQ_INIT(&pmap->pm_pvlist); 1126 bzero(&pmap->pm_stats, sizeof pmap->pm_stats); 1127} 1128 1129/* 1130 * Wire in kernel global address entries. To avoid a race condition 1131 * between pmap initialization and pmap_growkernel, this procedure 1132 * should be called after the vmspace is attached to the process 1133 * but before this pmap is activated. 1134 */ 1135void 1136pmap_pinit2(pmap) 1137 struct pmap *pmap; 1138{ 1139 /* XXX: Remove this stub when no longer called */ 1140} 1141 1142static int 1143pmap_release_free_page(pmap, p) 1144 struct pmap *pmap; 1145 vm_page_t p; 1146{ 1147 unsigned *pde = (unsigned *) pmap->pm_pdir; 1148 /* 1149 * This code optimizes the case of freeing non-busy 1150 * page-table pages. Those pages are zero now, and 1151 * might as well be placed directly into the zero queue. 1152 */ 1153 if (vm_page_sleep_busy(p, FALSE, "pmaprl")) 1154 return 0; 1155 1156 vm_page_busy(p); 1157 1158 /* 1159 * Remove the page table page from the processes address space. 1160 */ 1161 pde[p->pindex] = 0; 1162 pmap->pm_stats.resident_count--; 1163 1164 if (p->hold_count) { 1165 panic("pmap_release: freeing held page table page"); 1166 } 1167 /* 1168 * Page directory pages need to have the kernel 1169 * stuff cleared, so they can go into the zero queue also. 1170 */ 1171 if (p->pindex == PTDPTDI) { 1172 bzero(pde + KPTDI, nkpt * PTESIZE); 1173#ifdef SMP 1174 pde[MPPTDI] = 0; 1175#endif 1176 pde[APTDPTDI] = 0; 1177 pmap_kremove((vm_offset_t) pmap->pm_pdir); 1178 } 1179 1180 if (pmap->pm_ptphint && (pmap->pm_ptphint->pindex == p->pindex)) 1181 pmap->pm_ptphint = NULL; 1182 1183 p->wire_count--; 1184 cnt.v_wire_count--; 1185 vm_page_free_zero(p); 1186 return 1; 1187} 1188 1189/* 1190 * this routine is called if the page table page is not 1191 * mapped correctly. 1192 */ 1193static vm_page_t 1194_pmap_allocpte(pmap, ptepindex) 1195 pmap_t pmap; 1196 unsigned ptepindex; 1197{ 1198 vm_offset_t pteva, ptepa; 1199 vm_page_t m; 1200 1201 /* 1202 * Find or fabricate a new pagetable page 1203 */ 1204 m = vm_page_grab(pmap->pm_pteobj, ptepindex, 1205 VM_ALLOC_ZERO | VM_ALLOC_RETRY); 1206 1207 KASSERT(m->queue == PQ_NONE, 1208 ("_pmap_allocpte: %p->queue != PQ_NONE", m)); 1209 1210 if (m->wire_count == 0) 1211 cnt.v_wire_count++; 1212 m->wire_count++; 1213 1214 /* 1215 * Increment the hold count for the page table page 1216 * (denoting a new mapping.) 1217 */ 1218 m->hold_count++; 1219 1220 /* 1221 * Map the pagetable page into the process address space, if 1222 * it isn't already there. 1223 */ 1224 1225 pmap->pm_stats.resident_count++; 1226 1227 ptepa = VM_PAGE_TO_PHYS(m); 1228 pmap->pm_pdir[ptepindex] = 1229 (pd_entry_t) (ptepa | PG_U | PG_RW | PG_V | PG_A | PG_M); 1230 1231 /* 1232 * Set the page table hint 1233 */ 1234 pmap->pm_ptphint = m; 1235 1236 /* 1237 * Try to use the new mapping, but if we cannot, then 1238 * do it with the routine that maps the page explicitly. 1239 */ 1240 if ((m->flags & PG_ZERO) == 0) { 1241 if ((((unsigned)pmap->pm_pdir[PTDPTDI]) & PG_FRAME) == 1242 (((unsigned) PTDpde) & PG_FRAME)) { 1243 pteva = UPT_MIN_ADDRESS + i386_ptob(ptepindex); 1244 bzero((caddr_t) pteva, PAGE_SIZE); 1245 } else { 1246 pmap_zero_page(ptepa); 1247 } 1248 } 1249 1250 m->valid = VM_PAGE_BITS_ALL; 1251 vm_page_flag_clear(m, PG_ZERO); 1252 vm_page_flag_set(m, PG_MAPPED); 1253 vm_page_wakeup(m); 1254 1255 return m; 1256} 1257 1258static vm_page_t 1259pmap_allocpte(pmap, va) 1260 pmap_t pmap; 1261 vm_offset_t va; 1262{ 1263 unsigned ptepindex; 1264 vm_offset_t ptepa; 1265 vm_page_t m; 1266 1267 /* 1268 * Calculate pagetable page index 1269 */ 1270 ptepindex = va >> PDRSHIFT; 1271 1272 /* 1273 * Get the page directory entry 1274 */ 1275 ptepa = (vm_offset_t) pmap->pm_pdir[ptepindex]; 1276 1277 /* 1278 * This supports switching from a 4MB page to a 1279 * normal 4K page. 1280 */ 1281 if (ptepa & PG_PS) { 1282 pmap->pm_pdir[ptepindex] = 0; 1283 ptepa = 0; 1284 invltlb(); 1285 } 1286 1287 /* 1288 * If the page table page is mapped, we just increment the 1289 * hold count, and activate it. 1290 */ 1291 if (ptepa) { 1292 /* 1293 * In order to get the page table page, try the 1294 * hint first. 1295 */ 1296 if (pmap->pm_ptphint && 1297 (pmap->pm_ptphint->pindex == ptepindex)) { 1298 m = pmap->pm_ptphint; 1299 } else { 1300 m = pmap_page_lookup( pmap->pm_pteobj, ptepindex); 1301 pmap->pm_ptphint = m; 1302 } 1303 m->hold_count++; 1304 return m; 1305 } 1306 /* 1307 * Here if the pte page isn't mapped, or if it has been deallocated. 1308 */ 1309 return _pmap_allocpte(pmap, ptepindex); 1310} 1311 1312 1313/*************************************************** 1314* Pmap allocation/deallocation routines. 1315 ***************************************************/ 1316 1317/* 1318 * Release any resources held by the given physical map. 1319 * Called when a pmap initialized by pmap_pinit is being released. 1320 * Should only be called if the map contains no valid mappings. 1321 */ 1322void 1323pmap_release(pmap) 1324 register struct pmap *pmap; 1325{ 1326 vm_page_t p,n,ptdpg; 1327 vm_object_t object = pmap->pm_pteobj; 1328 int curgeneration; 1329 1330#if defined(DIAGNOSTIC) 1331 if (object->ref_count != 1) 1332 panic("pmap_release: pteobj reference count != 1"); 1333#endif 1334 1335 ptdpg = NULL; 1336 LIST_REMOVE(pmap, pm_list); 1337retry: 1338 curgeneration = object->generation; 1339 for (p = TAILQ_FIRST(&object->memq); p != NULL; p = n) { 1340 n = TAILQ_NEXT(p, listq); 1341 if (p->pindex == PTDPTDI) { 1342 ptdpg = p; 1343 continue; 1344 } 1345 while (1) { 1346 if (!pmap_release_free_page(pmap, p) && 1347 (object->generation != curgeneration)) 1348 goto retry; 1349 } 1350 } 1351 1352 if (ptdpg && !pmap_release_free_page(pmap, ptdpg)) 1353 goto retry; 1354} 1355 1356/* 1357 * grow the number of kernel page table entries, if needed 1358 */ 1359void 1360pmap_growkernel(vm_offset_t addr) 1361{ 1362 struct pmap *pmap; 1363 int s; 1364 vm_offset_t ptppaddr; 1365 vm_page_t nkpg; 1366 pd_entry_t newpdir; 1367 1368 s = splhigh(); 1369 if (kernel_vm_end == 0) { 1370 kernel_vm_end = KERNBASE; 1371 nkpt = 0; 1372 while (pdir_pde(PTD, kernel_vm_end)) { 1373 kernel_vm_end = (kernel_vm_end + PAGE_SIZE * NPTEPG) & ~(PAGE_SIZE * NPTEPG - 1); 1374 nkpt++; 1375 } 1376 } 1377 addr = (addr + PAGE_SIZE * NPTEPG) & ~(PAGE_SIZE * NPTEPG - 1); 1378 while (kernel_vm_end < addr) { 1379 if (pdir_pde(PTD, kernel_vm_end)) { 1380 kernel_vm_end = (kernel_vm_end + PAGE_SIZE * NPTEPG) & ~(PAGE_SIZE * NPTEPG - 1); 1381 continue; 1382 } 1383 1384 /* 1385 * This index is bogus, but out of the way 1386 */ 1387 nkpg = vm_page_alloc(kptobj, nkpt, VM_ALLOC_SYSTEM); 1388 if (!nkpg) 1389 panic("pmap_growkernel: no memory to grow kernel"); 1390 1391 nkpt++; 1392 1393 vm_page_wire(nkpg); 1394 ptppaddr = VM_PAGE_TO_PHYS(nkpg); 1395 pmap_zero_page(ptppaddr); 1396 newpdir = (pd_entry_t) (ptppaddr | PG_V | PG_RW | PG_A | PG_M); 1397 pdir_pde(PTD, kernel_vm_end) = newpdir; 1398 1399 LIST_FOREACH(pmap, &allpmaps, pm_list) { 1400 *pmap_pde(pmap, kernel_vm_end) = newpdir; 1401 } 1402 kernel_vm_end = (kernel_vm_end + PAGE_SIZE * NPTEPG) & ~(PAGE_SIZE * NPTEPG - 1); 1403 } 1404 splx(s); 1405} 1406 1407/* 1408 * Retire the given physical map from service. 1409 * Should only be called if the map contains 1410 * no valid mappings. 1411 */ 1412void 1413pmap_destroy(pmap) 1414 register pmap_t pmap; 1415{ 1416 int count; 1417 1418 if (pmap == NULL) 1419 return; 1420 1421 count = --pmap->pm_count; 1422 if (count == 0) { 1423 pmap_release(pmap); 1424 panic("destroying a pmap is not yet implemented"); 1425 } 1426} 1427 1428/* 1429 * Add a reference to the specified pmap. 1430 */ 1431void 1432pmap_reference(pmap) 1433 pmap_t pmap; 1434{ 1435 if (pmap != NULL) { 1436 pmap->pm_count++; 1437 } 1438} 1439 1440/*************************************************** 1441* page management routines. 1442 ***************************************************/ 1443 1444/* 1445 * free the pv_entry back to the free list 1446 */ 1447static PMAP_INLINE void 1448free_pv_entry(pv) 1449 pv_entry_t pv; 1450{ 1451 pv_entry_count--; 1452 zfree(pvzone, pv); 1453} 1454 1455/* 1456 * get a new pv_entry, allocating a block from the system 1457 * when needed. 1458 * the memory allocation is performed bypassing the malloc code 1459 * because of the possibility of allocations at interrupt time. 1460 */ 1461static pv_entry_t 1462get_pv_entry(void) 1463{ 1464 pv_entry_count++; 1465 if (pv_entry_high_water && 1466 (pv_entry_count > pv_entry_high_water) && 1467 (pmap_pagedaemon_waken == 0)) { 1468 pmap_pagedaemon_waken = 1; 1469 wakeup (&vm_pages_needed); 1470 } 1471 return zalloc(pvzone); 1472} 1473 1474/* 1475 * This routine is very drastic, but can save the system 1476 * in a pinch. 1477 */ 1478void 1479pmap_collect() 1480{ 1481 int i; 1482 vm_page_t m; 1483 static int warningdone=0; 1484 1485 if (pmap_pagedaemon_waken == 0) 1486 return; 1487 1488 if (warningdone < 5) { 1489 printf("pmap_collect: collecting pv entries -- suggest increasing PMAP_SHPGPERPROC\n"); 1490 warningdone++; 1491 } 1492 1493 for(i = 0; i < vm_page_array_size; i++) { 1494 m = &vm_page_array[i]; 1495 if (m->wire_count || m->hold_count || m->busy || 1496 (m->flags & PG_BUSY)) 1497 continue; 1498 pmap_remove_all(m); 1499 } 1500 pmap_pagedaemon_waken = 0; 1501} 1502 1503 1504/* 1505 * If it is the first entry on the list, it is actually 1506 * in the header and we must copy the following entry up 1507 * to the header. Otherwise we must search the list for 1508 * the entry. In either case we free the now unused entry. 1509 */ 1510 1511static int 1512pmap_remove_entry(pmap, m, va) 1513 struct pmap *pmap; 1514 vm_page_t m; 1515 vm_offset_t va; 1516{ 1517 pv_entry_t pv; 1518 int rtval; 1519 int s; 1520 1521 s = splvm(); 1522 if (m->md.pv_list_count < pmap->pm_stats.resident_count) { 1523 for (pv = TAILQ_FIRST(&m->md.pv_list); 1524 pv; 1525 pv = TAILQ_NEXT(pv, pv_list)) { 1526 if (pmap == pv->pv_pmap && va == pv->pv_va) 1527 break; 1528 } 1529 } else { 1530 for (pv = TAILQ_FIRST(&pmap->pm_pvlist); 1531 pv; 1532 pv = TAILQ_NEXT(pv, pv_plist)) { 1533 if (va == pv->pv_va) 1534 break; 1535 } 1536 } 1537 1538 rtval = 0; 1539 if (pv) { 1540 1541 rtval = pmap_unuse_pt(pmap, va, pv->pv_ptem); 1542 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list); 1543 m->md.pv_list_count--; 1544 if (TAILQ_FIRST(&m->md.pv_list) == NULL) 1545 vm_page_flag_clear(m, PG_MAPPED | PG_WRITEABLE); 1546 1547 TAILQ_REMOVE(&pmap->pm_pvlist, pv, pv_plist); 1548 free_pv_entry(pv); 1549 } 1550 1551 splx(s); 1552 return rtval; 1553} 1554 1555/* 1556 * Create a pv entry for page at pa for 1557 * (pmap, va). 1558 */ 1559static void 1560pmap_insert_entry(pmap, va, mpte, m) 1561 pmap_t pmap; 1562 vm_offset_t va; 1563 vm_page_t mpte; 1564 vm_page_t m; 1565{ 1566 1567 int s; 1568 pv_entry_t pv; 1569 1570 s = splvm(); 1571 pv = get_pv_entry(); 1572 pv->pv_va = va; 1573 pv->pv_pmap = pmap; 1574 pv->pv_ptem = mpte; 1575 1576 TAILQ_INSERT_TAIL(&pmap->pm_pvlist, pv, pv_plist); 1577 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_list); 1578 m->md.pv_list_count++; 1579 1580 splx(s); 1581} 1582 1583/* 1584 * pmap_remove_pte: do the things to unmap a page in a process 1585 */ 1586static int 1587pmap_remove_pte(pmap, ptq, va) 1588 struct pmap *pmap; 1589 unsigned *ptq; 1590 vm_offset_t va; 1591{ 1592 unsigned oldpte; 1593 vm_page_t m; 1594 1595 oldpte = atomic_readandclear_int(ptq); 1596 if (oldpte & PG_W) 1597 pmap->pm_stats.wired_count -= 1; 1598 /* 1599 * Machines that don't support invlpg, also don't support 1600 * PG_G. 1601 */ 1602 if (oldpte & PG_G) 1603 invlpg(va); 1604 pmap->pm_stats.resident_count -= 1; 1605 if (oldpte & PG_MANAGED) { 1606 m = PHYS_TO_VM_PAGE(oldpte); 1607 if (oldpte & PG_M) { 1608#if defined(PMAP_DIAGNOSTIC) 1609 if (pmap_nw_modified((pt_entry_t) oldpte)) { 1610 printf( 1611 "pmap_remove: modified page not writable: va: 0x%x, pte: 0x%x\n", 1612 va, oldpte); 1613 } 1614#endif 1615 if (pmap_track_modified(va)) 1616 vm_page_dirty(m); 1617 } 1618 if (oldpte & PG_A) 1619 vm_page_flag_set(m, PG_REFERENCED); 1620 return pmap_remove_entry(pmap, m, va); 1621 } else { 1622 return pmap_unuse_pt(pmap, va, NULL); 1623 } 1624 1625 return 0; 1626} 1627 1628/* 1629 * Remove a single page from a process address space 1630 */ 1631static void 1632pmap_remove_page(pmap, va) 1633 struct pmap *pmap; 1634 register vm_offset_t va; 1635{ 1636 register unsigned *ptq; 1637 1638 /* 1639 * if there is no pte for this address, just skip it!!! 1640 */ 1641 if (*pmap_pde(pmap, va) == 0) { 1642 return; 1643 } 1644 1645 /* 1646 * get a local va for mappings for this pmap. 1647 */ 1648 ptq = get_ptbase(pmap) + i386_btop(va); 1649 if (*ptq) { 1650 (void) pmap_remove_pte(pmap, ptq, va); 1651 pmap_TLB_invalidate(pmap, va); 1652 } 1653 return; 1654} 1655 1656/* 1657 * Remove the given range of addresses from the specified map. 1658 * 1659 * It is assumed that the start and end are properly 1660 * rounded to the page size. 1661 */ 1662void 1663pmap_remove(pmap, sva, eva) 1664 struct pmap *pmap; 1665 register vm_offset_t sva; 1666 register vm_offset_t eva; 1667{ 1668 register unsigned *ptbase; 1669 vm_offset_t pdnxt; 1670 vm_offset_t ptpaddr; 1671 vm_offset_t sindex, eindex; 1672 int anyvalid; 1673 1674 if (pmap == NULL) 1675 return; 1676 1677 if (pmap->pm_stats.resident_count == 0) 1678 return; 1679 1680 /* 1681 * special handling of removing one page. a very 1682 * common operation and easy to short circuit some 1683 * code. 1684 */ 1685 if (((sva + PAGE_SIZE) == eva) && 1686 (((unsigned) pmap->pm_pdir[(sva >> PDRSHIFT)] & PG_PS) == 0)) { 1687 pmap_remove_page(pmap, sva); 1688 return; 1689 } 1690 1691 anyvalid = 0; 1692 1693 /* 1694 * Get a local virtual address for the mappings that are being 1695 * worked with. 1696 */ 1697 ptbase = get_ptbase(pmap); 1698 1699 sindex = i386_btop(sva); 1700 eindex = i386_btop(eva); 1701 1702 for (; sindex < eindex; sindex = pdnxt) { 1703 unsigned pdirindex; 1704 1705 /* 1706 * Calculate index for next page table. 1707 */ 1708 pdnxt = ((sindex + NPTEPG) & ~(NPTEPG - 1)); 1709 if (pmap->pm_stats.resident_count == 0) 1710 break; 1711 1712 pdirindex = sindex / NPDEPG; 1713 if (((ptpaddr = (unsigned) pmap->pm_pdir[pdirindex]) & PG_PS) != 0) { 1714 pmap->pm_pdir[pdirindex] = 0; 1715 pmap->pm_stats.resident_count -= NBPDR / PAGE_SIZE; 1716 anyvalid++; 1717 continue; 1718 } 1719 1720 /* 1721 * Weed out invalid mappings. Note: we assume that the page 1722 * directory table is always allocated, and in kernel virtual. 1723 */ 1724 if (ptpaddr == 0) 1725 continue; 1726 1727 /* 1728 * Limit our scan to either the end of the va represented 1729 * by the current page table page, or to the end of the 1730 * range being removed. 1731 */ 1732 if (pdnxt > eindex) { 1733 pdnxt = eindex; 1734 } 1735 1736 for ( ;sindex != pdnxt; sindex++) { 1737 vm_offset_t va; 1738 if (ptbase[sindex] == 0) { 1739 continue; 1740 } 1741 va = i386_ptob(sindex); 1742 1743 anyvalid++; 1744 if (pmap_remove_pte(pmap, 1745 ptbase + sindex, va)) 1746 break; 1747 } 1748 } 1749 1750 if (anyvalid) 1751 pmap_TLB_invalidate_all(pmap); 1752} 1753 1754/* 1755 * Routine: pmap_remove_all 1756 * Function: 1757 * Removes this physical page from 1758 * all physical maps in which it resides. 1759 * Reflects back modify bits to the pager. 1760 * 1761 * Notes: 1762 * Original versions of this routine were very 1763 * inefficient because they iteratively called 1764 * pmap_remove (slow...) 1765 */ 1766 1767static void 1768pmap_remove_all(m) 1769 vm_page_t m; 1770{ 1771 register pv_entry_t pv; 1772 register unsigned *pte, tpte; 1773 int s; 1774 1775#if defined(PMAP_DIAGNOSTIC) 1776 /* 1777 * XXX this makes pmap_page_protect(NONE) illegal for non-managed 1778 * pages! 1779 */ 1780 if (!pmap_initialized || (m->flags & PG_FICTITIOUS)) { 1781 panic("pmap_page_protect: illegal for unmanaged page, va: 0x%x", VM_PAGE_TO_PHYS(m)); 1782 } 1783#endif 1784 1785 s = splvm(); 1786 while ((pv = TAILQ_FIRST(&m->md.pv_list)) != NULL) { 1787 pv->pv_pmap->pm_stats.resident_count--; 1788 1789 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va); 1790 1791 tpte = atomic_readandclear_int(pte); 1792 if (tpte & PG_W) 1793 pv->pv_pmap->pm_stats.wired_count--; 1794 1795 if (tpte & PG_A) 1796 vm_page_flag_set(m, PG_REFERENCED); 1797 1798 /* 1799 * Update the vm_page_t clean and reference bits. 1800 */ 1801 if (tpte & PG_M) { 1802#if defined(PMAP_DIAGNOSTIC) 1803 if (pmap_nw_modified((pt_entry_t) tpte)) { 1804 printf( 1805 "pmap_remove_all: modified page not writable: va: 0x%x, pte: 0x%x\n", 1806 pv->pv_va, tpte); 1807 } 1808#endif 1809 if (pmap_track_modified(pv->pv_va)) 1810 vm_page_dirty(m); 1811 } 1812 pmap_TLB_invalidate(pv->pv_pmap, pv->pv_va); 1813 1814 TAILQ_REMOVE(&pv->pv_pmap->pm_pvlist, pv, pv_plist); 1815 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list); 1816 m->md.pv_list_count--; 1817 pmap_unuse_pt(pv->pv_pmap, pv->pv_va, pv->pv_ptem); 1818 free_pv_entry(pv); 1819 } 1820 1821 vm_page_flag_clear(m, PG_MAPPED | PG_WRITEABLE); 1822 1823 splx(s); 1824} 1825 1826/* 1827 * Set the physical protection on the 1828 * specified range of this map as requested. 1829 */ 1830void 1831pmap_protect(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, vm_prot_t prot) 1832{ 1833 register unsigned *ptbase; 1834 vm_offset_t pdnxt, ptpaddr; 1835 vm_pindex_t sindex, eindex; 1836 int anychanged; 1837 1838 if (pmap == NULL) 1839 return; 1840 1841 if ((prot & VM_PROT_READ) == VM_PROT_NONE) { 1842 pmap_remove(pmap, sva, eva); 1843 return; 1844 } 1845 1846 if (prot & VM_PROT_WRITE) 1847 return; 1848 1849 anychanged = 0; 1850 1851 ptbase = get_ptbase(pmap); 1852 1853 sindex = i386_btop(sva); 1854 eindex = i386_btop(eva); 1855 1856 for (; sindex < eindex; sindex = pdnxt) { 1857 1858 unsigned pdirindex; 1859 1860 pdnxt = ((sindex + NPTEPG) & ~(NPTEPG - 1)); 1861 1862 pdirindex = sindex / NPDEPG; 1863 if (((ptpaddr = (unsigned) pmap->pm_pdir[pdirindex]) & PG_PS) != 0) { 1864 (unsigned) pmap->pm_pdir[pdirindex] &= ~(PG_M|PG_RW); 1865 pmap->pm_stats.resident_count -= NBPDR / PAGE_SIZE; 1866 anychanged++; 1867 continue; 1868 } 1869 1870 /* 1871 * Weed out invalid mappings. Note: we assume that the page 1872 * directory table is always allocated, and in kernel virtual. 1873 */ 1874 if (ptpaddr == 0) 1875 continue; 1876 1877 if (pdnxt > eindex) { 1878 pdnxt = eindex; 1879 } 1880 1881 for (; sindex != pdnxt; sindex++) { 1882 1883 unsigned pbits; 1884 vm_page_t m; 1885 1886 pbits = ptbase[sindex]; 1887 1888 if (pbits & PG_MANAGED) { 1889 m = NULL; 1890 if (pbits & PG_A) { 1891 m = PHYS_TO_VM_PAGE(pbits); 1892 vm_page_flag_set(m, PG_REFERENCED); 1893 pbits &= ~PG_A; 1894 } 1895 if (pbits & PG_M) { 1896 if (pmap_track_modified(i386_ptob(sindex))) { 1897 if (m == NULL) 1898 m = PHYS_TO_VM_PAGE(pbits); 1899 vm_page_dirty(m); 1900 pbits &= ~PG_M; 1901 } 1902 } 1903 } 1904 1905 pbits &= ~PG_RW; 1906 1907 if (pbits != ptbase[sindex]) { 1908 ptbase[sindex] = pbits; 1909 anychanged = 1; 1910 } 1911 } 1912 } 1913 if (anychanged) 1914 pmap_TLB_invalidate_all(pmap); 1915} 1916 1917/* 1918 * Insert the given physical page (p) at 1919 * the specified virtual address (v) in the 1920 * target physical map with the protection requested. 1921 * 1922 * If specified, the page will be wired down, meaning 1923 * that the related pte can not be reclaimed. 1924 * 1925 * NB: This is the only routine which MAY NOT lazy-evaluate 1926 * or lose information. That is, this routine must actually 1927 * insert this page into the given map NOW. 1928 */ 1929void 1930pmap_enter(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot, 1931 boolean_t wired) 1932{ 1933 vm_offset_t pa; 1934 register unsigned *pte; 1935 vm_offset_t opa; 1936 vm_offset_t origpte, newpte; 1937 vm_page_t mpte; 1938 1939 if (pmap == NULL) 1940 return; 1941 1942 va &= PG_FRAME; 1943#ifdef PMAP_DIAGNOSTIC 1944 if (va > VM_MAX_KERNEL_ADDRESS) 1945 panic("pmap_enter: toobig"); 1946 if ((va >= UPT_MIN_ADDRESS) && (va < UPT_MAX_ADDRESS)) 1947 panic("pmap_enter: invalid to pmap_enter page table pages (va: 0x%x)", va); 1948#endif 1949 1950 mpte = NULL; 1951 /* 1952 * In the case that a page table page is not 1953 * resident, we are creating it here. 1954 */ 1955 if (va < UPT_MIN_ADDRESS) { 1956 mpte = pmap_allocpte(pmap, va); 1957 } 1958#if 0 && defined(PMAP_DIAGNOSTIC) 1959 else { 1960 vm_offset_t *pdeaddr = (vm_offset_t *)pmap_pde(pmap, va); 1961 if (((origpte = (vm_offset_t) *pdeaddr) & PG_V) == 0) { 1962 panic("pmap_enter: invalid kernel page table page(0), pdir=%p, pde=%p, va=%p\n", 1963 pmap->pm_pdir[PTDPTDI], origpte, va); 1964 } 1965 if (smp_active) { 1966 pdeaddr = (vm_offset_t *) IdlePTDS[PCPU_GET(cpuid)]; 1967 if (((newpte = pdeaddr[va >> PDRSHIFT]) & PG_V) == 0) { 1968 if ((vm_offset_t) my_idlePTD != (vm_offset_t) vtophys(pdeaddr)) 1969 printf("pde mismatch: %x, %x\n", my_idlePTD, pdeaddr); 1970 printf("cpuid: %d, pdeaddr: 0x%x\n", PCPU_GET(cpuid), pdeaddr); 1971 panic("pmap_enter: invalid kernel page table page(1), pdir=%p, npde=%p, pde=%p, va=%p\n", 1972 pmap->pm_pdir[PTDPTDI], newpte, origpte, va); 1973 } 1974 } 1975 } 1976#endif 1977 1978 pte = pmap_pte(pmap, va); 1979 1980 /* 1981 * Page Directory table entry not valid, we need a new PT page 1982 */ 1983 if (pte == NULL) { 1984 panic("pmap_enter: invalid page directory, pdir=%p, va=0x%x\n", 1985 (void *)pmap->pm_pdir[PTDPTDI], va); 1986 } 1987 1988 pa = VM_PAGE_TO_PHYS(m) & PG_FRAME; 1989 origpte = *(vm_offset_t *)pte; 1990 opa = origpte & PG_FRAME; 1991 1992 if (origpte & PG_PS) 1993 panic("pmap_enter: attempted pmap_enter on 4MB page"); 1994 1995 /* 1996 * Mapping has not changed, must be protection or wiring change. 1997 */ 1998 if (origpte && (opa == pa)) { 1999 /* 2000 * Wiring change, just update stats. We don't worry about 2001 * wiring PT pages as they remain resident as long as there 2002 * are valid mappings in them. Hence, if a user page is wired, 2003 * the PT page will be also. 2004 */ 2005 if (wired && ((origpte & PG_W) == 0)) 2006 pmap->pm_stats.wired_count++; 2007 else if (!wired && (origpte & PG_W)) 2008 pmap->pm_stats.wired_count--; 2009 2010#if defined(PMAP_DIAGNOSTIC) 2011 if (pmap_nw_modified((pt_entry_t) origpte)) { 2012 printf( 2013 "pmap_enter: modified page not writable: va: 0x%x, pte: 0x%x\n", 2014 va, origpte); 2015 } 2016#endif 2017 2018 /* 2019 * Remove extra pte reference 2020 */ 2021 if (mpte) 2022 mpte->hold_count--; 2023 2024 if ((prot & VM_PROT_WRITE) && (origpte & PG_V)) { 2025 if ((origpte & PG_RW) == 0) { 2026 *pte |= PG_RW; 2027#ifdef SMP 2028 cpu_invlpg((void *)va); 2029 if (pmap->pm_active & PCPU_GET(other_cpus)) 2030 smp_invltlb(); 2031#else 2032 invltlb_1pg(va); 2033#endif 2034 } 2035 return; 2036 } 2037 2038 /* 2039 * We might be turning off write access to the page, 2040 * so we go ahead and sense modify status. 2041 */ 2042 if (origpte & PG_MANAGED) { 2043 if ((origpte & PG_M) && pmap_track_modified(va)) { 2044 vm_page_t om; 2045 om = PHYS_TO_VM_PAGE(opa); 2046 vm_page_dirty(om); 2047 } 2048 pa |= PG_MANAGED; 2049 } 2050 goto validate; 2051 } 2052 /* 2053 * Mapping has changed, invalidate old range and fall through to 2054 * handle validating new mapping. 2055 */ 2056 if (opa) { 2057 int err; 2058 err = pmap_remove_pte(pmap, pte, va); 2059 if (err) 2060 panic("pmap_enter: pte vanished, va: 0x%x", va); 2061 } 2062 2063 /* 2064 * Enter on the PV list if part of our managed memory. Note that we 2065 * raise IPL while manipulating pv_table since pmap_enter can be 2066 * called at interrupt time. 2067 */ 2068 if (pmap_initialized && 2069 (m->flags & (PG_FICTITIOUS|PG_UNMANAGED)) == 0) { 2070 pmap_insert_entry(pmap, va, mpte, m); 2071 pa |= PG_MANAGED; 2072 } 2073 2074 /* 2075 * Increment counters 2076 */ 2077 pmap->pm_stats.resident_count++; 2078 if (wired) 2079 pmap->pm_stats.wired_count++; 2080 2081validate: 2082 /* 2083 * Now validate mapping with desired protection/wiring. 2084 */ 2085 newpte = (vm_offset_t) (pa | pte_prot(pmap, prot) | PG_V); 2086 2087 if (wired) 2088 newpte |= PG_W; 2089 if (va < UPT_MIN_ADDRESS) 2090 newpte |= PG_U; 2091 if (pmap == kernel_pmap) 2092 newpte |= pgeflag; 2093 2094 /* 2095 * if the mapping or permission bits are different, we need 2096 * to update the pte. 2097 */ 2098 if ((origpte & ~(PG_M|PG_A)) != newpte) { 2099 *pte = newpte | PG_A; 2100 /*if (origpte)*/ { 2101#ifdef SMP 2102 cpu_invlpg((void *)va); 2103 if (pmap->pm_active & PCPU_GET(other_cpus)) 2104 smp_invltlb(); 2105#else 2106 invltlb_1pg(va); 2107#endif 2108 } 2109 } 2110} 2111 2112/* 2113 * this code makes some *MAJOR* assumptions: 2114 * 1. Current pmap & pmap exists. 2115 * 2. Not wired. 2116 * 3. Read access. 2117 * 4. No page table pages. 2118 * 5. Tlbflush is deferred to calling procedure. 2119 * 6. Page IS managed. 2120 * but is *MUCH* faster than pmap_enter... 2121 */ 2122 2123static vm_page_t 2124pmap_enter_quick(pmap, va, m, mpte) 2125 register pmap_t pmap; 2126 vm_offset_t va; 2127 vm_page_t m; 2128 vm_page_t mpte; 2129{ 2130 unsigned *pte; 2131 vm_offset_t pa; 2132 2133 /* 2134 * In the case that a page table page is not 2135 * resident, we are creating it here. 2136 */ 2137 if (va < UPT_MIN_ADDRESS) { 2138 unsigned ptepindex; 2139 vm_offset_t ptepa; 2140 2141 /* 2142 * Calculate pagetable page index 2143 */ 2144 ptepindex = va >> PDRSHIFT; 2145 if (mpte && (mpte->pindex == ptepindex)) { 2146 mpte->hold_count++; 2147 } else { 2148retry: 2149 /* 2150 * Get the page directory entry 2151 */ 2152 ptepa = (vm_offset_t) pmap->pm_pdir[ptepindex]; 2153 2154 /* 2155 * If the page table page is mapped, we just increment 2156 * the hold count, and activate it. 2157 */ 2158 if (ptepa) { 2159 if (ptepa & PG_PS) 2160 panic("pmap_enter_quick: unexpected mapping into 4MB page"); 2161 if (pmap->pm_ptphint && 2162 (pmap->pm_ptphint->pindex == ptepindex)) { 2163 mpte = pmap->pm_ptphint; 2164 } else { 2165 mpte = pmap_page_lookup( pmap->pm_pteobj, ptepindex); 2166 pmap->pm_ptphint = mpte; 2167 } 2168 if (mpte == NULL) 2169 goto retry; 2170 mpte->hold_count++; 2171 } else { 2172 mpte = _pmap_allocpte(pmap, ptepindex); 2173 } 2174 } 2175 } else { 2176 mpte = NULL; 2177 } 2178 2179 /* 2180 * This call to vtopte makes the assumption that we are 2181 * entering the page into the current pmap. In order to support 2182 * quick entry into any pmap, one would likely use pmap_pte_quick. 2183 * But that isn't as quick as vtopte. 2184 */ 2185 pte = (unsigned *)vtopte(va); 2186 if (*pte) { 2187 if (mpte) 2188 pmap_unwire_pte_hold(pmap, mpte); 2189 return 0; 2190 } 2191 2192 /* 2193 * Enter on the PV list if part of our managed memory. Note that we 2194 * raise IPL while manipulating pv_table since pmap_enter can be 2195 * called at interrupt time. 2196 */ 2197 if ((m->flags & (PG_FICTITIOUS|PG_UNMANAGED)) == 0) 2198 pmap_insert_entry(pmap, va, mpte, m); 2199 2200 /* 2201 * Increment counters 2202 */ 2203 pmap->pm_stats.resident_count++; 2204 2205 pa = VM_PAGE_TO_PHYS(m); 2206 2207 /* 2208 * Now validate mapping with RO protection 2209 */ 2210 if (m->flags & (PG_FICTITIOUS|PG_UNMANAGED)) 2211 *pte = pa | PG_V | PG_U; 2212 else 2213 *pte = pa | PG_V | PG_U | PG_MANAGED; 2214 2215 return mpte; 2216} 2217 2218/* 2219 * Make a temporary mapping for a physical address. This is only intended 2220 * to be used for panic dumps. 2221 */ 2222void * 2223pmap_kenter_temporary(vm_offset_t pa, int i) 2224{ 2225 pmap_kenter((vm_offset_t)crashdumpmap + (i * PAGE_SIZE), pa); 2226 return ((void *)crashdumpmap); 2227} 2228 2229#define MAX_INIT_PT (96) 2230/* 2231 * pmap_object_init_pt preloads the ptes for a given object 2232 * into the specified pmap. This eliminates the blast of soft 2233 * faults on process startup and immediately after an mmap. 2234 */ 2235void 2236pmap_object_init_pt(pmap, addr, object, pindex, size, limit) 2237 pmap_t pmap; 2238 vm_offset_t addr; 2239 vm_object_t object; 2240 vm_pindex_t pindex; 2241 vm_size_t size; 2242 int limit; 2243{ 2244 vm_offset_t tmpidx; 2245 int psize; 2246 vm_page_t p, mpte; 2247 int objpgs; 2248 2249 if (pmap == NULL || object == NULL) 2250 return; 2251 2252 /* 2253 * This code maps large physical mmap regions into the 2254 * processor address space. Note that some shortcuts 2255 * are taken, but the code works. 2256 */ 2257 if (pseflag && 2258 (object->type == OBJT_DEVICE) && 2259 ((addr & (NBPDR - 1)) == 0) && 2260 ((size & (NBPDR - 1)) == 0) ) { 2261 int i; 2262 vm_page_t m[1]; 2263 unsigned int ptepindex; 2264 int npdes; 2265 vm_offset_t ptepa; 2266 2267 if (pmap->pm_pdir[ptepindex = (addr >> PDRSHIFT)]) 2268 return; 2269 2270retry: 2271 p = vm_page_lookup(object, pindex); 2272 if (p && vm_page_sleep_busy(p, FALSE, "init4p")) 2273 goto retry; 2274 2275 if (p == NULL) { 2276 p = vm_page_alloc(object, pindex, VM_ALLOC_NORMAL); 2277 if (p == NULL) 2278 return; 2279 m[0] = p; 2280 2281 if (vm_pager_get_pages(object, m, 1, 0) != VM_PAGER_OK) { 2282 vm_page_free(p); 2283 return; 2284 } 2285 2286 p = vm_page_lookup(object, pindex); 2287 vm_page_wakeup(p); 2288 } 2289 2290 ptepa = (vm_offset_t) VM_PAGE_TO_PHYS(p); 2291 if (ptepa & (NBPDR - 1)) { 2292 return; 2293 } 2294 2295 p->valid = VM_PAGE_BITS_ALL; 2296 2297 pmap->pm_stats.resident_count += size >> PAGE_SHIFT; 2298 npdes = size >> PDRSHIFT; 2299 for(i=0;i<npdes;i++) { 2300 pmap->pm_pdir[ptepindex] = 2301 (pd_entry_t) (ptepa | PG_U | PG_RW | PG_V | PG_PS); 2302 ptepa += NBPDR; 2303 ptepindex += 1; 2304 } 2305 vm_page_flag_set(p, PG_MAPPED); 2306 invltlb(); 2307 return; 2308 } 2309 2310 psize = i386_btop(size); 2311 2312 if ((object->type != OBJT_VNODE) || 2313 (limit && (psize > MAX_INIT_PT) && 2314 (object->resident_page_count > MAX_INIT_PT))) { 2315 return; 2316 } 2317 2318 if (psize + pindex > object->size) { 2319 if (object->size < pindex) 2320 return; 2321 psize = object->size - pindex; 2322 } 2323 2324 mpte = NULL; 2325 /* 2326 * if we are processing a major portion of the object, then scan the 2327 * entire thing. 2328 */ 2329 if (psize > (object->resident_page_count >> 2)) { 2330 objpgs = psize; 2331 2332 for (p = TAILQ_FIRST(&object->memq); 2333 ((objpgs > 0) && (p != NULL)); 2334 p = TAILQ_NEXT(p, listq)) { 2335 2336 tmpidx = p->pindex; 2337 if (tmpidx < pindex) { 2338 continue; 2339 } 2340 tmpidx -= pindex; 2341 if (tmpidx >= psize) { 2342 continue; 2343 } 2344 if (((p->valid & VM_PAGE_BITS_ALL) == VM_PAGE_BITS_ALL) && 2345 (p->busy == 0) && 2346 (p->flags & (PG_BUSY | PG_FICTITIOUS)) == 0) { 2347 if ((p->queue - p->pc) == PQ_CACHE) 2348 vm_page_deactivate(p); 2349 vm_page_busy(p); 2350 mpte = pmap_enter_quick(pmap, 2351 addr + i386_ptob(tmpidx), p, mpte); 2352 vm_page_flag_set(p, PG_MAPPED); 2353 vm_page_wakeup(p); 2354 } 2355 objpgs -= 1; 2356 } 2357 } else { 2358 /* 2359 * else lookup the pages one-by-one. 2360 */ 2361 for (tmpidx = 0; tmpidx < psize; tmpidx += 1) { 2362 p = vm_page_lookup(object, tmpidx + pindex); 2363 if (p && 2364 ((p->valid & VM_PAGE_BITS_ALL) == VM_PAGE_BITS_ALL) && 2365 (p->busy == 0) && 2366 (p->flags & (PG_BUSY | PG_FICTITIOUS)) == 0) { 2367 if ((p->queue - p->pc) == PQ_CACHE) 2368 vm_page_deactivate(p); 2369 vm_page_busy(p); 2370 mpte = pmap_enter_quick(pmap, 2371 addr + i386_ptob(tmpidx), p, mpte); 2372 vm_page_flag_set(p, PG_MAPPED); 2373 vm_page_wakeup(p); 2374 } 2375 } 2376 } 2377 return; 2378} 2379 2380/* 2381 * pmap_prefault provides a quick way of clustering 2382 * pagefaults into a processes address space. It is a "cousin" 2383 * of pmap_object_init_pt, except it runs at page fault time instead 2384 * of mmap time. 2385 */ 2386#define PFBAK 4 2387#define PFFOR 4 2388#define PAGEORDER_SIZE (PFBAK+PFFOR) 2389 2390static int pmap_prefault_pageorder[] = { 2391 -PAGE_SIZE, PAGE_SIZE, 2392 -2 * PAGE_SIZE, 2 * PAGE_SIZE, 2393 -3 * PAGE_SIZE, 3 * PAGE_SIZE 2394 -4 * PAGE_SIZE, 4 * PAGE_SIZE 2395}; 2396 2397void 2398pmap_prefault(pmap, addra, entry) 2399 pmap_t pmap; 2400 vm_offset_t addra; 2401 vm_map_entry_t entry; 2402{ 2403 int i; 2404 vm_offset_t starta; 2405 vm_offset_t addr; 2406 vm_pindex_t pindex; 2407 vm_page_t m, mpte; 2408 vm_object_t object; 2409 2410 if (!curproc || (pmap != vmspace_pmap(curproc->p_vmspace))) 2411 return; 2412 2413 object = entry->object.vm_object; 2414 2415 starta = addra - PFBAK * PAGE_SIZE; 2416 if (starta < entry->start) { 2417 starta = entry->start; 2418 } else if (starta > addra) { 2419 starta = 0; 2420 } 2421 2422 mpte = NULL; 2423 for (i = 0; i < PAGEORDER_SIZE; i++) { 2424 vm_object_t lobject; 2425 unsigned *pte; 2426 2427 addr = addra + pmap_prefault_pageorder[i]; 2428 if (addr > addra + (PFFOR * PAGE_SIZE)) 2429 addr = 0; 2430 2431 if (addr < starta || addr >= entry->end) 2432 continue; 2433 2434 if ((*pmap_pde(pmap, addr)) == NULL) 2435 continue; 2436 2437 pte = (unsigned *) vtopte(addr); 2438 if (*pte) 2439 continue; 2440 2441 pindex = ((addr - entry->start) + entry->offset) >> PAGE_SHIFT; 2442 lobject = object; 2443 for (m = vm_page_lookup(lobject, pindex); 2444 (!m && (lobject->type == OBJT_DEFAULT) && (lobject->backing_object)); 2445 lobject = lobject->backing_object) { 2446 if (lobject->backing_object_offset & PAGE_MASK) 2447 break; 2448 pindex += (lobject->backing_object_offset >> PAGE_SHIFT); 2449 m = vm_page_lookup(lobject->backing_object, pindex); 2450 } 2451 2452 /* 2453 * give-up when a page is not in memory 2454 */ 2455 if (m == NULL) 2456 break; 2457 2458 if (((m->valid & VM_PAGE_BITS_ALL) == VM_PAGE_BITS_ALL) && 2459 (m->busy == 0) && 2460 (m->flags & (PG_BUSY | PG_FICTITIOUS)) == 0) { 2461 2462 if ((m->queue - m->pc) == PQ_CACHE) { 2463 vm_page_deactivate(m); 2464 } 2465 vm_page_busy(m); 2466 mpte = pmap_enter_quick(pmap, addr, m, mpte); 2467 vm_page_flag_set(m, PG_MAPPED); 2468 vm_page_wakeup(m); 2469 } 2470 } 2471} 2472 2473/* 2474 * Routine: pmap_change_wiring 2475 * Function: Change the wiring attribute for a map/virtual-address 2476 * pair. 2477 * In/out conditions: 2478 * The mapping must already exist in the pmap. 2479 */ 2480void 2481pmap_change_wiring(pmap, va, wired) 2482 register pmap_t pmap; 2483 vm_offset_t va; 2484 boolean_t wired; 2485{ 2486 register unsigned *pte; 2487 2488 if (pmap == NULL) 2489 return; 2490 2491 pte = pmap_pte(pmap, va); 2492 2493 if (wired && !pmap_pte_w(pte)) 2494 pmap->pm_stats.wired_count++; 2495 else if (!wired && pmap_pte_w(pte)) 2496 pmap->pm_stats.wired_count--; 2497 2498 /* 2499 * Wiring is not a hardware characteristic so there is no need to 2500 * invalidate TLB. 2501 */ 2502 pmap_pte_set_w(pte, wired); 2503} 2504 2505 2506 2507/* 2508 * Copy the range specified by src_addr/len 2509 * from the source map to the range dst_addr/len 2510 * in the destination map. 2511 * 2512 * This routine is only advisory and need not do anything. 2513 */ 2514 2515void 2516pmap_copy(dst_pmap, src_pmap, dst_addr, len, src_addr) 2517 pmap_t dst_pmap, src_pmap; 2518 vm_offset_t dst_addr; 2519 vm_size_t len; 2520 vm_offset_t src_addr; 2521{ 2522 vm_offset_t addr; 2523 vm_offset_t end_addr = src_addr + len; 2524 vm_offset_t pdnxt; 2525 unsigned src_frame, dst_frame; 2526 vm_page_t m; 2527 2528 if (dst_addr != src_addr) 2529 return; 2530 2531 src_frame = ((unsigned) src_pmap->pm_pdir[PTDPTDI]) & PG_FRAME; 2532 if (src_frame != (((unsigned) PTDpde) & PG_FRAME)) { 2533 return; 2534 } 2535 2536 dst_frame = ((unsigned) dst_pmap->pm_pdir[PTDPTDI]) & PG_FRAME; 2537 if (dst_frame != (((unsigned) APTDpde) & PG_FRAME)) { 2538 APTDpde = (pd_entry_t) (dst_frame | PG_RW | PG_V); 2539#if defined(SMP) 2540 /* The page directory is not shared between CPUs */ 2541 cpu_invltlb(); 2542#else 2543 invltlb(); 2544#endif 2545 } 2546 2547 for(addr = src_addr; addr < end_addr; addr = pdnxt) { 2548 unsigned *src_pte, *dst_pte; 2549 vm_page_t dstmpte, srcmpte; 2550 vm_offset_t srcptepaddr; 2551 unsigned ptepindex; 2552 2553 if (addr >= UPT_MIN_ADDRESS) 2554 panic("pmap_copy: invalid to pmap_copy page tables\n"); 2555 2556 /* 2557 * Don't let optional prefaulting of pages make us go 2558 * way below the low water mark of free pages or way 2559 * above high water mark of used pv entries. 2560 */ 2561 if (cnt.v_free_count < cnt.v_free_reserved || 2562 pv_entry_count > pv_entry_high_water) 2563 break; 2564 2565 pdnxt = ((addr + PAGE_SIZE*NPTEPG) & ~(PAGE_SIZE*NPTEPG - 1)); 2566 ptepindex = addr >> PDRSHIFT; 2567 2568 srcptepaddr = (vm_offset_t) src_pmap->pm_pdir[ptepindex]; 2569 if (srcptepaddr == 0) 2570 continue; 2571 2572 if (srcptepaddr & PG_PS) { 2573 if (dst_pmap->pm_pdir[ptepindex] == 0) { 2574 dst_pmap->pm_pdir[ptepindex] = (pd_entry_t) srcptepaddr; 2575 dst_pmap->pm_stats.resident_count += NBPDR / PAGE_SIZE; 2576 } 2577 continue; 2578 } 2579 2580 srcmpte = vm_page_lookup(src_pmap->pm_pteobj, ptepindex); 2581 if ((srcmpte == NULL) || 2582 (srcmpte->hold_count == 0) || (srcmpte->flags & PG_BUSY)) 2583 continue; 2584 2585 if (pdnxt > end_addr) 2586 pdnxt = end_addr; 2587 2588 src_pte = (unsigned *) vtopte(addr); 2589 dst_pte = (unsigned *) avtopte(addr); 2590 while (addr < pdnxt) { 2591 unsigned ptetemp; 2592 ptetemp = *src_pte; 2593 /* 2594 * we only virtual copy managed pages 2595 */ 2596 if ((ptetemp & PG_MANAGED) != 0) { 2597 /* 2598 * We have to check after allocpte for the 2599 * pte still being around... allocpte can 2600 * block. 2601 */ 2602 dstmpte = pmap_allocpte(dst_pmap, addr); 2603 if ((*dst_pte == 0) && (ptetemp = *src_pte)) { 2604 /* 2605 * Clear the modified and 2606 * accessed (referenced) bits 2607 * during the copy. 2608 */ 2609 m = PHYS_TO_VM_PAGE(ptetemp); 2610 *dst_pte = ptetemp & ~(PG_M | PG_A); 2611 dst_pmap->pm_stats.resident_count++; 2612 pmap_insert_entry(dst_pmap, addr, 2613 dstmpte, m); 2614 } else { 2615 pmap_unwire_pte_hold(dst_pmap, dstmpte); 2616 } 2617 if (dstmpte->hold_count >= srcmpte->hold_count) 2618 break; 2619 } 2620 addr += PAGE_SIZE; 2621 src_pte++; 2622 dst_pte++; 2623 } 2624 } 2625} 2626 2627/* 2628 * Routine: pmap_kernel 2629 * Function: 2630 * Returns the physical map handle for the kernel. 2631 */ 2632pmap_t 2633pmap_kernel() 2634{ 2635 return (kernel_pmap); 2636} 2637 2638/* 2639 * pmap_zero_page zeros the specified hardware page by mapping 2640 * the page into KVM and using bzero to clear its contents. 2641 */ 2642void 2643pmap_zero_page(phys) 2644 vm_offset_t phys; 2645{ 2646 2647 if (*(int *) CMAP2) 2648 panic("pmap_zero_page: CMAP2 busy"); 2649 2650 *(int *) CMAP2 = PG_V | PG_RW | (phys & PG_FRAME) | PG_A | PG_M; 2651 invltlb_1pg((vm_offset_t)CADDR2); 2652 2653#if defined(I686_CPU) 2654 if (cpu_class == CPUCLASS_686) 2655 i686_pagezero(CADDR2); 2656 else 2657#endif 2658 bzero(CADDR2, PAGE_SIZE); 2659 *(int *) CMAP2 = 0; 2660} 2661 2662/* 2663 * pmap_zero_page_area zeros the specified hardware page by mapping 2664 * the page into KVM and using bzero to clear its contents. 2665 * 2666 * off and size may not cover an area beyond a single hardware page. 2667 */ 2668void 2669pmap_zero_page_area(phys, off, size) 2670 vm_offset_t phys; 2671 int off; 2672 int size; 2673{ 2674 2675 if (*(int *) CMAP2) 2676 panic("pmap_zero_page: CMAP2 busy"); 2677 2678 *(int *) CMAP2 = PG_V | PG_RW | (phys & PG_FRAME) | PG_A | PG_M; 2679 invltlb_1pg((vm_offset_t)CADDR2); 2680 2681#if defined(I686_CPU) 2682 if (cpu_class == CPUCLASS_686 && off == 0 && size == PAGE_SIZE) 2683 i686_pagezero(CADDR2); 2684 else 2685#endif 2686 bzero((char *)CADDR2 + off, size); 2687 *(int *) CMAP2 = 0; 2688} 2689 2690/* 2691 * pmap_copy_page copies the specified (machine independent) 2692 * page by mapping the page into virtual memory and using 2693 * bcopy to copy the page, one machine dependent page at a 2694 * time. 2695 */ 2696void 2697pmap_copy_page(src, dst) 2698 vm_offset_t src; 2699 vm_offset_t dst; 2700{ 2701 2702 if (*(int *) CMAP1) 2703 panic("pmap_copy_page: CMAP1 busy"); 2704 if (*(int *) CMAP2) 2705 panic("pmap_copy_page: CMAP2 busy"); 2706 2707 *(int *) CMAP1 = PG_V | (src & PG_FRAME) | PG_A; 2708 *(int *) CMAP2 = PG_V | PG_RW | (dst & PG_FRAME) | PG_A | PG_M; 2709#ifdef I386_CPU 2710 invltlb(); 2711#else 2712 invlpg((u_int)CADDR1); 2713 invlpg((u_int)CADDR2); 2714#endif 2715 2716 bcopy(CADDR1, CADDR2, PAGE_SIZE); 2717 2718 *(int *) CMAP1 = 0; 2719 *(int *) CMAP2 = 0; 2720} 2721 2722 2723/* 2724 * Routine: pmap_pageable 2725 * Function: 2726 * Make the specified pages (by pmap, offset) 2727 * pageable (or not) as requested. 2728 * 2729 * A page which is not pageable may not take 2730 * a fault; therefore, its page table entry 2731 * must remain valid for the duration. 2732 * 2733 * This routine is merely advisory; pmap_enter 2734 * will specify that these pages are to be wired 2735 * down (or not) as appropriate. 2736 */ 2737void 2738pmap_pageable(pmap, sva, eva, pageable) 2739 pmap_t pmap; 2740 vm_offset_t sva, eva; 2741 boolean_t pageable; 2742{ 2743} 2744 2745/* 2746 * this routine returns true if a physical page resides 2747 * in the given pmap. 2748 */ 2749boolean_t 2750pmap_page_exists(pmap, m) 2751 pmap_t pmap; 2752 vm_page_t m; 2753{ 2754 register pv_entry_t pv; 2755 int s; 2756 2757 if (!pmap_initialized || (m->flags & PG_FICTITIOUS)) 2758 return FALSE; 2759 2760 s = splvm(); 2761 2762 /* 2763 * Not found, check current mappings returning immediately if found. 2764 */ 2765 for (pv = TAILQ_FIRST(&m->md.pv_list); 2766 pv; 2767 pv = TAILQ_NEXT(pv, pv_list)) { 2768 if (pv->pv_pmap == pmap) { 2769 splx(s); 2770 return TRUE; 2771 } 2772 } 2773 splx(s); 2774 return (FALSE); 2775} 2776 2777#define PMAP_REMOVE_PAGES_CURPROC_ONLY 2778/* 2779 * Remove all pages from specified address space 2780 * this aids process exit speeds. Also, this code 2781 * is special cased for current process only, but 2782 * can have the more generic (and slightly slower) 2783 * mode enabled. This is much faster than pmap_remove 2784 * in the case of running down an entire address space. 2785 */ 2786void 2787pmap_remove_pages(pmap, sva, eva) 2788 pmap_t pmap; 2789 vm_offset_t sva, eva; 2790{ 2791 unsigned *pte, tpte; 2792 pv_entry_t pv, npv; 2793 int s; 2794 vm_page_t m; 2795 2796#ifdef PMAP_REMOVE_PAGES_CURPROC_ONLY 2797 if (!curproc || (pmap != vmspace_pmap(curproc->p_vmspace))) { 2798 printf("warning: pmap_remove_pages called with non-current pmap\n"); 2799 return; 2800 } 2801#endif 2802 2803 s = splvm(); 2804 for(pv = TAILQ_FIRST(&pmap->pm_pvlist); 2805 pv; 2806 pv = npv) { 2807 2808 if (pv->pv_va >= eva || pv->pv_va < sva) { 2809 npv = TAILQ_NEXT(pv, pv_plist); 2810 continue; 2811 } 2812 2813#ifdef PMAP_REMOVE_PAGES_CURPROC_ONLY 2814 pte = (unsigned *)vtopte(pv->pv_va); 2815#else 2816 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va); 2817#endif 2818 tpte = *pte; 2819 2820/* 2821 * We cannot remove wired pages from a process' mapping at this time 2822 */ 2823 if (tpte & PG_W) { 2824 npv = TAILQ_NEXT(pv, pv_plist); 2825 continue; 2826 } 2827 *pte = 0; 2828 2829 m = PHYS_TO_VM_PAGE(tpte); 2830 2831 KASSERT(m < &vm_page_array[vm_page_array_size], 2832 ("pmap_remove_pages: bad tpte %x", tpte)); 2833 2834 pv->pv_pmap->pm_stats.resident_count--; 2835 2836 /* 2837 * Update the vm_page_t clean and reference bits. 2838 */ 2839 if (tpte & PG_M) { 2840 vm_page_dirty(m); 2841 } 2842 2843 2844 npv = TAILQ_NEXT(pv, pv_plist); 2845 TAILQ_REMOVE(&pv->pv_pmap->pm_pvlist, pv, pv_plist); 2846 2847 m->md.pv_list_count--; 2848 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list); 2849 if (TAILQ_FIRST(&m->md.pv_list) == NULL) { 2850 vm_page_flag_clear(m, PG_MAPPED | PG_WRITEABLE); 2851 } 2852 2853 pmap_unuse_pt(pv->pv_pmap, pv->pv_va, pv->pv_ptem); 2854 free_pv_entry(pv); 2855 } 2856 splx(s); 2857 pmap_TLB_invalidate_all(pmap); 2858} 2859 2860/* 2861 * pmap_testbit tests bits in pte's 2862 * note that the testbit/changebit routines are inline, 2863 * and a lot of things compile-time evaluate. 2864 */ 2865static boolean_t 2866pmap_testbit(m, bit) 2867 vm_page_t m; 2868 int bit; 2869{ 2870 pv_entry_t pv; 2871 unsigned *pte; 2872 int s; 2873 2874 if (!pmap_initialized || (m->flags & PG_FICTITIOUS)) 2875 return FALSE; 2876 2877 if (TAILQ_FIRST(&m->md.pv_list) == NULL) 2878 return FALSE; 2879 2880 s = splvm(); 2881 2882 for (pv = TAILQ_FIRST(&m->md.pv_list); 2883 pv; 2884 pv = TAILQ_NEXT(pv, pv_list)) { 2885 2886 /* 2887 * if the bit being tested is the modified bit, then 2888 * mark clean_map and ptes as never 2889 * modified. 2890 */ 2891 if (bit & (PG_A|PG_M)) { 2892 if (!pmap_track_modified(pv->pv_va)) 2893 continue; 2894 } 2895 2896#if defined(PMAP_DIAGNOSTIC) 2897 if (!pv->pv_pmap) { 2898 printf("Null pmap (tb) at va: 0x%x\n", pv->pv_va); 2899 continue; 2900 } 2901#endif 2902 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va); 2903 if (*pte & bit) { 2904 splx(s); 2905 return TRUE; 2906 } 2907 } 2908 splx(s); 2909 return (FALSE); 2910} 2911 2912/* 2913 * this routine is used to modify bits in ptes 2914 */ 2915static __inline void 2916pmap_changebit(m, bit, setem) 2917 vm_page_t m; 2918 int bit; 2919 boolean_t setem; 2920{ 2921 register pv_entry_t pv; 2922 register unsigned *pte; 2923 int s; 2924 2925 if (!pmap_initialized || (m->flags & PG_FICTITIOUS)) 2926 return; 2927 2928 s = splvm(); 2929 2930 /* 2931 * Loop over all current mappings setting/clearing as appropos If 2932 * setting RO do we need to clear the VAC? 2933 */ 2934 for (pv = TAILQ_FIRST(&m->md.pv_list); 2935 pv; 2936 pv = TAILQ_NEXT(pv, pv_list)) { 2937 2938 /* 2939 * don't write protect pager mappings 2940 */ 2941 if (!setem && (bit == PG_RW)) { 2942 if (!pmap_track_modified(pv->pv_va)) 2943 continue; 2944 } 2945 2946#if defined(PMAP_DIAGNOSTIC) 2947 if (!pv->pv_pmap) { 2948 printf("Null pmap (cb) at va: 0x%x\n", pv->pv_va); 2949 continue; 2950 } 2951#endif 2952 2953 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va); 2954 2955 if (setem) { 2956 *(int *)pte |= bit; 2957 pmap_TLB_invalidate(pv->pv_pmap, pv->pv_va); 2958 } else { 2959 vm_offset_t pbits = *(vm_offset_t *)pte; 2960 if (pbits & bit) { 2961 if (bit == PG_RW) { 2962 if (pbits & PG_M) { 2963 vm_page_dirty(m); 2964 } 2965 *(int *)pte = pbits & ~(PG_M|PG_RW); 2966 } else { 2967 *(int *)pte = pbits & ~bit; 2968 } 2969 pmap_TLB_invalidate(pv->pv_pmap, pv->pv_va); 2970 } 2971 } 2972 } 2973 splx(s); 2974} 2975 2976/* 2977 * pmap_page_protect: 2978 * 2979 * Lower the permission for all mappings to a given page. 2980 */ 2981void 2982pmap_page_protect(vm_page_t m, vm_prot_t prot) 2983{ 2984 if ((prot & VM_PROT_WRITE) == 0) { 2985 if (prot & (VM_PROT_READ | VM_PROT_EXECUTE)) { 2986 pmap_changebit(m, PG_RW, FALSE); 2987 } else { 2988 pmap_remove_all(m); 2989 } 2990 } 2991} 2992 2993vm_offset_t 2994pmap_phys_address(ppn) 2995 int ppn; 2996{ 2997 return (i386_ptob(ppn)); 2998} 2999 3000/* 3001 * pmap_ts_referenced: 3002 * 3003 * Return the count of reference bits for a page, clearing all of them. 3004 */ 3005int 3006pmap_ts_referenced(vm_page_t m) 3007{ 3008 register pv_entry_t pv, pvf, pvn; 3009 unsigned *pte; 3010 int s; 3011 int rtval = 0; 3012 3013 if (!pmap_initialized || (m->flags & PG_FICTITIOUS)) 3014 return (rtval); 3015 3016 s = splvm(); 3017 3018 if ((pv = TAILQ_FIRST(&m->md.pv_list)) != NULL) { 3019 3020 pvf = pv; 3021 3022 do { 3023 pvn = TAILQ_NEXT(pv, pv_list); 3024 3025 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list); 3026 3027 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_list); 3028 3029 if (!pmap_track_modified(pv->pv_va)) 3030 continue; 3031 3032 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va); 3033 3034 if (pte && (*pte & PG_A)) { 3035 *pte &= ~PG_A; 3036 3037 pmap_TLB_invalidate(pv->pv_pmap, pv->pv_va); 3038 3039 rtval++; 3040 if (rtval > 4) { 3041 break; 3042 } 3043 } 3044 } while ((pv = pvn) != NULL && pv != pvf); 3045 } 3046 splx(s); 3047 3048 return (rtval); 3049} 3050 3051/* 3052 * pmap_is_modified: 3053 * 3054 * Return whether or not the specified physical page was modified 3055 * in any physical maps. 3056 */ 3057boolean_t 3058pmap_is_modified(vm_page_t m) 3059{ 3060 return pmap_testbit(m, PG_M); 3061} 3062 3063/* 3064 * Clear the modify bits on the specified physical page. 3065 */ 3066void 3067pmap_clear_modify(vm_page_t m) 3068{ 3069 pmap_changebit(m, PG_M, FALSE); 3070} 3071 3072/* 3073 * pmap_clear_reference: 3074 * 3075 * Clear the reference bit on the specified physical page. 3076 */ 3077void 3078pmap_clear_reference(vm_page_t m) 3079{ 3080 pmap_changebit(m, PG_A, FALSE); 3081} 3082 3083/* 3084 * Miscellaneous support routines follow 3085 */ 3086 3087static void 3088i386_protection_init() 3089{ 3090 register int *kp, prot; 3091 3092 kp = protection_codes; 3093 for (prot = 0; prot < 8; prot++) { 3094 switch (prot) { 3095 case VM_PROT_NONE | VM_PROT_NONE | VM_PROT_NONE: 3096 /* 3097 * Read access is also 0. There isn't any execute bit, 3098 * so just make it readable. 3099 */ 3100 case VM_PROT_READ | VM_PROT_NONE | VM_PROT_NONE: 3101 case VM_PROT_READ | VM_PROT_NONE | VM_PROT_EXECUTE: 3102 case VM_PROT_NONE | VM_PROT_NONE | VM_PROT_EXECUTE: 3103 *kp++ = 0; 3104 break; 3105 case VM_PROT_NONE | VM_PROT_WRITE | VM_PROT_NONE: 3106 case VM_PROT_NONE | VM_PROT_WRITE | VM_PROT_EXECUTE: 3107 case VM_PROT_READ | VM_PROT_WRITE | VM_PROT_NONE: 3108 case VM_PROT_READ | VM_PROT_WRITE | VM_PROT_EXECUTE: 3109 *kp++ = PG_RW; 3110 break; 3111 } 3112 } 3113} 3114 3115/* 3116 * Map a set of physical memory pages into the kernel virtual 3117 * address space. Return a pointer to where it is mapped. This 3118 * routine is intended to be used for mapping device memory, 3119 * NOT real memory. 3120 */ 3121void * 3122pmap_mapdev(pa, size) 3123 vm_offset_t pa; 3124 vm_size_t size; 3125{ 3126 vm_offset_t va, tmpva, offset; 3127 unsigned *pte; 3128 3129 offset = pa & PAGE_MASK; 3130 size = roundup(offset + size, PAGE_SIZE); 3131 3132 va = kmem_alloc_pageable(kernel_map, size); 3133 if (!va) 3134 panic("pmap_mapdev: Couldn't alloc kernel virtual memory"); 3135 3136 pa = pa & PG_FRAME; 3137 for (tmpva = va; size > 0;) { 3138 pte = (unsigned *)vtopte(tmpva); 3139 *pte = pa | PG_RW | PG_V | pgeflag; 3140 size -= PAGE_SIZE; 3141 tmpva += PAGE_SIZE; 3142 pa += PAGE_SIZE; 3143 } 3144 invltlb(); 3145 3146 return ((void *)(va + offset)); 3147} 3148 3149void 3150pmap_unmapdev(va, size) 3151 vm_offset_t va; 3152 vm_size_t size; 3153{ 3154 vm_offset_t base, offset; 3155 3156 base = va & PG_FRAME; 3157 offset = va & PAGE_MASK; 3158 size = roundup(offset + size, PAGE_SIZE); 3159 kmem_free(kernel_map, base, size); 3160} 3161 3162/* 3163 * perform the pmap work for mincore 3164 */ 3165int 3166pmap_mincore(pmap, addr) 3167 pmap_t pmap; 3168 vm_offset_t addr; 3169{ 3170 3171 unsigned *ptep, pte; 3172 vm_page_t m; 3173 int val = 0; 3174 3175 ptep = pmap_pte(pmap, addr); 3176 if (ptep == 0) { 3177 return 0; 3178 } 3179 3180 if ((pte = *ptep) != 0) { 3181 vm_offset_t pa; 3182 3183 val = MINCORE_INCORE; 3184 if ((pte & PG_MANAGED) == 0) 3185 return val; 3186 3187 pa = pte & PG_FRAME; 3188 3189 m = PHYS_TO_VM_PAGE(pa); 3190 3191 /* 3192 * Modified by us 3193 */ 3194 if (pte & PG_M) 3195 val |= MINCORE_MODIFIED|MINCORE_MODIFIED_OTHER; 3196 /* 3197 * Modified by someone 3198 */ 3199 else if (m->dirty || pmap_is_modified(m)) 3200 val |= MINCORE_MODIFIED_OTHER; 3201 /* 3202 * Referenced by us 3203 */ 3204 if (pte & PG_A) 3205 val |= MINCORE_REFERENCED|MINCORE_REFERENCED_OTHER; 3206 3207 /* 3208 * Referenced by someone 3209 */ 3210 else if ((m->flags & PG_REFERENCED) || pmap_ts_referenced(m)) { 3211 val |= MINCORE_REFERENCED_OTHER; 3212 vm_page_flag_set(m, PG_REFERENCED); 3213 } 3214 } 3215 return val; 3216} 3217 3218void 3219pmap_activate(struct proc *p) 3220{ 3221 pmap_t pmap; 3222 3223 pmap = vmspace_pmap(p->p_vmspace); 3224#if defined(SMP) 3225 pmap->pm_active |= 1 << PCPU_GET(cpuid); 3226#else 3227 pmap->pm_active |= 1; 3228#endif 3229#if defined(SWTCH_OPTIM_STATS) 3230 tlb_flush_count++; 3231#endif 3232 load_cr3(p->p_addr->u_pcb.pcb_cr3 = vtophys(pmap->pm_pdir)); 3233} 3234 3235vm_offset_t 3236pmap_addr_hint(vm_object_t obj, vm_offset_t addr, vm_size_t size) 3237{ 3238 3239 if ((obj == NULL) || (size < NBPDR) || (obj->type != OBJT_DEVICE)) { 3240 return addr; 3241 } 3242 3243 addr = (addr + (NBPDR - 1)) & ~(NBPDR - 1); 3244 return addr; 3245} 3246 3247 3248#if defined(PMAP_DEBUG) 3249pmap_pid_dump(int pid) 3250{ 3251 pmap_t pmap; 3252 struct proc *p; 3253 int npte = 0; 3254 int index; 3255 ALLPROC_LOCK(AP_SHARED); 3256 LIST_FOREACH(p, &allproc, p_list) { 3257 if (p->p_pid != pid) 3258 continue; 3259 3260 if (p->p_vmspace) { 3261 int i,j; 3262 index = 0; 3263 pmap = vmspace_pmap(p->p_vmspace); 3264 for(i=0;i<1024;i++) { 3265 pd_entry_t *pde; 3266 unsigned *pte; 3267 unsigned base = i << PDRSHIFT; 3268 3269 pde = &pmap->pm_pdir[i]; 3270 if (pde && pmap_pde_v(pde)) { 3271 for(j=0;j<1024;j++) { 3272 unsigned va = base + (j << PAGE_SHIFT); 3273 if (va >= (vm_offset_t) VM_MIN_KERNEL_ADDRESS) { 3274 if (index) { 3275 index = 0; 3276 printf("\n"); 3277 } 3278 ALLPROC_LOCK(AP_RELEASE); 3279 return npte; 3280 } 3281 pte = pmap_pte_quick( pmap, va); 3282 if (pte && pmap_pte_v(pte)) { 3283 vm_offset_t pa; 3284 vm_page_t m; 3285 pa = *(int *)pte; 3286 m = PHYS_TO_VM_PAGE(pa); 3287 printf("va: 0x%x, pt: 0x%x, h: %d, w: %d, f: 0x%x", 3288 va, pa, m->hold_count, m->wire_count, m->flags); 3289 npte++; 3290 index++; 3291 if (index >= 2) { 3292 index = 0; 3293 printf("\n"); 3294 } else { 3295 printf(" "); 3296 } 3297 } 3298 } 3299 } 3300 } 3301 } 3302 } 3303 ALLPROC_LOCK(AP_RELEASE); 3304 return npte; 3305} 3306#endif 3307 3308#if defined(DEBUG) 3309 3310static void pads __P((pmap_t pm)); 3311void pmap_pvdump __P((vm_offset_t pa)); 3312 3313/* print address space of pmap*/ 3314static void 3315pads(pm) 3316 pmap_t pm; 3317{ 3318 unsigned va, i, j; 3319 unsigned *ptep; 3320 3321 if (pm == kernel_pmap) 3322 return; 3323 for (i = 0; i < 1024; i++) 3324 if (pm->pm_pdir[i]) 3325 for (j = 0; j < 1024; j++) { 3326 va = (i << PDRSHIFT) + (j << PAGE_SHIFT); 3327 if (pm == kernel_pmap && va < KERNBASE) 3328 continue; 3329 if (pm != kernel_pmap && va > UPT_MAX_ADDRESS) 3330 continue; 3331 ptep = pmap_pte_quick(pm, va); 3332 if (pmap_pte_v(ptep)) 3333 printf("%x:%x ", va, *(int *) ptep); 3334 }; 3335 3336} 3337 3338void 3339pmap_pvdump(pa) 3340 vm_offset_t pa; 3341{ 3342 register pv_entry_t pv; 3343 vm_page_t m; 3344 3345 printf("pa %x", pa); 3346 m = PHYS_TO_VM_PAGE(pa); 3347 for (pv = TAILQ_FIRST(&m->md.pv_list); 3348 pv; 3349 pv = TAILQ_NEXT(pv, pv_list)) { 3350#ifdef used_to_be 3351 printf(" -> pmap %p, va %x, flags %x", 3352 (void *)pv->pv_pmap, pv->pv_va, pv->pv_flags); 3353#endif 3354 printf(" -> pmap %p, va %x", (void *)pv->pv_pmap, pv->pv_va); 3355 pads(pv->pv_pmap); 3356 } 3357 printf(" "); 3358} 3359#endif 3360