The Design and Implementation of the FreeBSD Operating System, Second Edition
Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]

FreeBSD/Linux Kernel Cross Reference
sys/amd64/include/pmap.h

Version: -  FREEBSD  -  FREEBSD-12-STABLE  -  FREEBSD-12-0  -  FREEBSD-11-STABLE  -  FREEBSD-11-2  -  FREEBSD-11-1  -  FREEBSD-11-0  -  FREEBSD-10-STABLE  -  FREEBSD-10-4  -  FREEBSD-10-3  -  FREEBSD-10-2  -  FREEBSD-10-1  -  FREEBSD-10-0  -  FREEBSD-9-STABLE  -  FREEBSD-9-3  -  FREEBSD-9-2  -  FREEBSD-9-1  -  FREEBSD-9-0  -  FREEBSD-8-STABLE  -  FREEBSD-8-4  -  FREEBSD-8-3  -  FREEBSD-8-2  -  FREEBSD-8-1  -  FREEBSD-8-0  -  FREEBSD-7-STABLE  -  FREEBSD-7-4  -  FREEBSD-7-3  -  FREEBSD-7-2  -  FREEBSD-7-1  -  FREEBSD-7-0  -  FREEBSD-6-STABLE  -  FREEBSD-6-4  -  FREEBSD-6-3  -  FREEBSD-6-2  -  FREEBSD-6-1  -  FREEBSD-6-0  -  FREEBSD-5-STABLE  -  FREEBSD-5-5  -  FREEBSD-5-4  -  FREEBSD-5-3  -  FREEBSD-5-2  -  FREEBSD-5-1  -  FREEBSD-5-0  -  FREEBSD-4-STABLE  -  FREEBSD-3-STABLE  -  FREEBSD22  -  linux-2.6  -  linux-2.4.22  -  MK83  -  MK84  -  PLAN9  -  DFBSD  -  NETBSD  -  NETBSD5  -  NETBSD4  -  NETBSD3  -  NETBSD20  -  OPENBSD  -  xnu-517  -  xnu-792  -  xnu-792.6.70  -  xnu-1228  -  xnu-1456.1.26  -  xnu-1699.24.8  -  xnu-2050.18.24  -  OPENSOLARIS  -  minix-3-1-1 
SearchContext: -  none  -  3  -  10 

    1 /*-
    2  * Copyright (c) 2003 Peter Wemm.
    3  * Copyright (c) 1991 Regents of the University of California.
    4  * All rights reserved.
    5  *
    6  * This code is derived from software contributed to Berkeley by
    7  * the Systems Programming Group of the University of Utah Computer
    8  * Science Department and William Jolitz of UUNET Technologies Inc.
    9  *
   10  * Redistribution and use in source and binary forms, with or without
   11  * modification, are permitted provided that the following conditions
   12  * are met:
   13  * 1. Redistributions of source code must retain the above copyright
   14  *    notice, this list of conditions and the following disclaimer.
   15  * 2. Redistributions in binary form must reproduce the above copyright
   16  *    notice, this list of conditions and the following disclaimer in the
   17  *    documentation and/or other materials provided with the distribution.
   18  * 4. Neither the name of the University nor the names of its contributors
   19  *    may be used to endorse or promote products derived from this software
   20  *    without specific prior written permission.
   21  *
   22  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
   23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
   26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   32  * SUCH DAMAGE.
   33  *
   34  * Derived from hp300 version by Mike Hibler, this version by William
   35  * Jolitz uses a recursive map [a pde points to the page directory] to
   36  * map the page tables using the pagetables themselves. This is done to
   37  * reduce the impact on kernel virtual memory for lots of sparse address
   38  * space, and to reduce the cost of memory to each process.
   39  *
   40  *      from: hp300: @(#)pmap.h 7.2 (Berkeley) 12/16/90
   41  *      from: @(#)pmap.h        7.4 (Berkeley) 5/12/91
   42  * $FreeBSD$
   43  */
   44 
   45 #ifndef _MACHINE_PMAP_H_
   46 #define _MACHINE_PMAP_H_
   47 
   48 /*
   49  * Page-directory and page-table entries follow this format, with a few
   50  * of the fields not present here and there, depending on a lot of things.
   51  */
   52                                 /* ---- Intel Nomenclature ---- */
   53 #define PG_V            0x001   /* P    Valid                   */
   54 #define PG_RW           0x002   /* R/W  Read/Write              */
   55 #define PG_U            0x004   /* U/S  User/Supervisor         */
   56 #define PG_NC_PWT       0x008   /* PWT  Write through           */
   57 #define PG_NC_PCD       0x010   /* PCD  Cache disable           */
   58 #define PG_A            0x020   /* A    Accessed                */
   59 #define PG_M            0x040   /* D    Dirty                   */
   60 #define PG_PS           0x080   /* PS   Page size (0=4k,1=2M)   */
   61 #define PG_PTE_PAT      0x080   /* PAT  PAT index               */
   62 #define PG_G            0x100   /* G    Global                  */
   63 #define PG_AVAIL1       0x200   /*    / Available for system    */
   64 #define PG_AVAIL2       0x400   /*   <  programmers use         */
   65 #define PG_AVAIL3       0x800   /*    \                         */
   66 #define PG_PDE_PAT      0x1000  /* PAT  PAT index               */
   67 #define PG_NX           (1ul<<63) /* No-execute */
   68 
   69 
   70 /* Our various interpretations of the above */
   71 #define PG_W            PG_AVAIL1       /* "Wired" pseudoflag */
   72 #define PG_MANAGED      PG_AVAIL2
   73 #define PG_FRAME        (0x000ffffffffff000ul)
   74 #define PG_PS_FRAME     (0x000fffffffe00000ul)
   75 #define PG_PROT         (PG_RW|PG_U)    /* all protection bits . */
   76 #define PG_N            (PG_NC_PWT|PG_NC_PCD)   /* Non-cacheable */
   77 
   78 /*
   79  * Promotion to a 2MB (PDE) page mapping requires that the corresponding 4KB
   80  * (PTE) page mappings have identical settings for the following fields:
   81  */
   82 #define PG_PTE_PROMOTE  (PG_NX | PG_MANAGED | PG_W | PG_G | PG_PTE_PAT | \
   83             PG_M | PG_A | PG_NC_PCD | PG_NC_PWT | PG_U | PG_RW | PG_V)
   84 
   85 /*
   86  * Page Protection Exception bits
   87  */
   88 
   89 #define PGEX_P          0x01    /* Protection violation vs. not present */
   90 #define PGEX_W          0x02    /* during a Write cycle */
   91 #define PGEX_U          0x04    /* access from User mode (UPL) */
   92 #define PGEX_RSV        0x08    /* reserved PTE field is non-zero */
   93 #define PGEX_I          0x10    /* during an instruction fetch */
   94 
   95 /*
   96  * Pte related macros.  This is complicated by having to deal with
   97  * the sign extension of the 48th bit.
   98  */
   99 #define KVADDR(l4, l3, l2, l1) ( \
  100         ((unsigned long)-1 << 47) | \
  101         ((unsigned long)(l4) << PML4SHIFT) | \
  102         ((unsigned long)(l3) << PDPSHIFT) | \
  103         ((unsigned long)(l2) << PDRSHIFT) | \
  104         ((unsigned long)(l1) << PAGE_SHIFT))
  105 
  106 #define UVADDR(l4, l3, l2, l1) ( \
  107         ((unsigned long)(l4) << PML4SHIFT) | \
  108         ((unsigned long)(l3) << PDPSHIFT) | \
  109         ((unsigned long)(l2) << PDRSHIFT) | \
  110         ((unsigned long)(l1) << PAGE_SHIFT))
  111 
  112 /* Initial number of kernel page tables. */
  113 #ifndef NKPT
  114 #define NKPT            32
  115 #endif
  116 
  117 #define NKPML4E         1               /* number of kernel PML4 slots */
  118 #define NKPDPE          howmany(NKPT, NPDEPG)/* number of kernel PDP slots */
  119 
  120 #define NUPML4E         (NPML4EPG/2)    /* number of userland PML4 pages */
  121 #define NUPDPE          (NUPML4E*NPDPEPG)/* number of userland PDP pages */
  122 #define NUPDE           (NUPDPE*NPDEPG) /* number of userland PD entries */
  123 
  124 #define NDMPML4E        1               /* number of dmap PML4 slots */
  125 
  126 /*
  127  * The *PDI values control the layout of virtual memory
  128  */
  129 #define PML4PML4I       (NPML4EPG/2)    /* Index of recursive pml4 mapping */
  130 
  131 #define KPML4I          (NPML4EPG-1)    /* Top 512GB for KVM */
  132 #define DMPML4I         (KPML4I-1)      /* Next 512GB down for direct map */
  133 
  134 #define KPDPI           (NPDPEPG-2)     /* kernbase at -2GB */
  135 
  136 /*
  137  * XXX doesn't really belong here I guess...
  138  */
  139 #define ISA_HOLE_START    0xa0000
  140 #define ISA_HOLE_LENGTH (0x100000-ISA_HOLE_START)
  141 
  142 #ifndef LOCORE
  143 
  144 #include <sys/queue.h>
  145 #include <sys/_lock.h>
  146 #include <sys/_mutex.h>
  147 
  148 typedef u_int64_t pd_entry_t;
  149 typedef u_int64_t pt_entry_t;
  150 typedef u_int64_t pdp_entry_t;
  151 typedef u_int64_t pml4_entry_t;
  152 
  153 #define PML4ESHIFT      (3)
  154 #define PDPESHIFT       (3)
  155 #define PTESHIFT        (3)
  156 #define PDESHIFT        (3)
  157 
  158 /*
  159  * Address of current address space page table maps and directories.
  160  */
  161 #ifdef _KERNEL
  162 #define addr_PTmap      (KVADDR(PML4PML4I, 0, 0, 0))
  163 #define addr_PDmap      (KVADDR(PML4PML4I, PML4PML4I, 0, 0))
  164 #define addr_PDPmap     (KVADDR(PML4PML4I, PML4PML4I, PML4PML4I, 0))
  165 #define addr_PML4map    (KVADDR(PML4PML4I, PML4PML4I, PML4PML4I, PML4PML4I))
  166 #define addr_PML4pml4e  (addr_PML4map + (PML4PML4I * sizeof(pml4_entry_t)))
  167 #define PTmap           ((pt_entry_t *)(addr_PTmap))
  168 #define PDmap           ((pd_entry_t *)(addr_PDmap))
  169 #define PDPmap          ((pd_entry_t *)(addr_PDPmap))
  170 #define PML4map         ((pd_entry_t *)(addr_PML4map))
  171 #define PML4pml4e       ((pd_entry_t *)(addr_PML4pml4e))
  172 
  173 extern u_int64_t KPML4phys;     /* physical address of kernel level 4 */
  174 #endif
  175 
  176 #ifdef _KERNEL
  177 /*
  178  * virtual address to page table entry and
  179  * to physical address.
  180  * Note: these work recursively, thus vtopte of a pte will give
  181  * the corresponding pde that in turn maps it.
  182  */
  183 pt_entry_t *vtopte(vm_offset_t);
  184 #define vtophys(va)     pmap_kextract(((vm_offset_t) (va)))
  185 
  186 static __inline pt_entry_t
  187 pte_load(pt_entry_t *ptep)
  188 {
  189         pt_entry_t r;
  190 
  191         r = *ptep;
  192         return (r);
  193 }
  194 
  195 static __inline pt_entry_t
  196 pte_load_store(pt_entry_t *ptep, pt_entry_t pte)
  197 {
  198         pt_entry_t r;
  199 
  200         __asm __volatile(
  201             "xchgq %0,%1"
  202             : "=m" (*ptep),
  203               "=r" (r)
  204             : "1" (pte),
  205               "m" (*ptep));
  206         return (r);
  207 }
  208 
  209 #define pte_load_clear(pte)     atomic_readandclear_long(pte)
  210 
  211 static __inline void
  212 pte_store(pt_entry_t *ptep, pt_entry_t pte)
  213 {
  214 
  215         *ptep = pte;
  216 }
  217 
  218 #define pte_clear(ptep)         pte_store((ptep), (pt_entry_t)0ULL)
  219 
  220 #define pde_store(pdep, pde)    pte_store((pdep), (pde))
  221 
  222 extern pt_entry_t pg_nx;
  223 
  224 #endif /* _KERNEL */
  225 
  226 /*
  227  * Pmap stuff
  228  */
  229 struct  pv_entry;
  230 struct  pv_chunk;
  231 
  232 struct md_page {
  233         int pv_unused;
  234         TAILQ_HEAD(,pv_entry)   pv_list;
  235 };
  236 
  237 struct pmap {
  238         struct mtx              pm_mtx;
  239         pml4_entry_t            *pm_pml4;       /* KVA of level 4 page table */
  240         TAILQ_HEAD(,pv_chunk)   pm_pvchunk;     /* list of mappings in pmap */
  241         u_int                   pm_active;      /* active on cpus */
  242         /* spare u_int here due to padding */
  243         struct pmap_statistics  pm_stats;       /* pmap statistics */
  244         vm_page_t               pm_root;        /* spare page table pages */
  245 };
  246 
  247 typedef struct pmap     *pmap_t;
  248 
  249 #ifdef _KERNEL
  250 extern struct pmap      kernel_pmap_store;
  251 #define kernel_pmap     (&kernel_pmap_store)
  252 
  253 #define PMAP_LOCK(pmap)         mtx_lock(&(pmap)->pm_mtx)
  254 #define PMAP_LOCK_ASSERT(pmap, type) \
  255                                 mtx_assert(&(pmap)->pm_mtx, (type))
  256 #define PMAP_LOCK_DESTROY(pmap) mtx_destroy(&(pmap)->pm_mtx)
  257 #define PMAP_LOCK_INIT(pmap)    mtx_init(&(pmap)->pm_mtx, "pmap", \
  258                                     NULL, MTX_DEF | MTX_DUPOK)
  259 #define PMAP_LOCKED(pmap)       mtx_owned(&(pmap)->pm_mtx)
  260 #define PMAP_MTX(pmap)          (&(pmap)->pm_mtx)
  261 #define PMAP_TRYLOCK(pmap)      mtx_trylock(&(pmap)->pm_mtx)
  262 #define PMAP_UNLOCK(pmap)       mtx_unlock(&(pmap)->pm_mtx)
  263 #endif
  264 
  265 /*
  266  * For each vm_page_t, there is a list of all currently valid virtual
  267  * mappings of that page.  An entry is a pv_entry_t, the list is pv_list.
  268  */
  269 typedef struct pv_entry {
  270         vm_offset_t     pv_va;          /* virtual address for mapping */
  271         TAILQ_ENTRY(pv_entry)   pv_list;
  272 } *pv_entry_t;
  273 
  274 /*
  275  * pv_entries are allocated in chunks per-process.  This avoids the
  276  * need to track per-pmap assignments.
  277  */
  278 #define _NPCM   3
  279 #define _NPCPV  168
  280 struct pv_chunk {
  281         pmap_t                  pc_pmap;
  282         TAILQ_ENTRY(pv_chunk)   pc_list;
  283         uint64_t                pc_map[_NPCM];  /* bitmap; 1 = free */
  284         uint64_t                pc_spare[2];
  285         struct pv_entry         pc_pventry[_NPCPV];
  286 };
  287 
  288 #ifdef  _KERNEL
  289 
  290 #define NPPROVMTRR              8
  291 #define PPRO_VMTRRphysBase0     0x200
  292 #define PPRO_VMTRRphysMask0     0x201
  293 struct ppro_vmtrr {
  294         u_int64_t base, mask;
  295 };
  296 extern struct ppro_vmtrr PPro_vmtrr[NPPROVMTRR];
  297 
  298 extern caddr_t  CADDR1;
  299 extern pt_entry_t *CMAP1;
  300 extern vm_paddr_t phys_avail[];
  301 extern vm_paddr_t dump_avail[];
  302 extern vm_offset_t virtual_avail;
  303 extern vm_offset_t virtual_end;
  304 
  305 #define pmap_unmapbios(va, sz)  pmap_unmapdev((va), (sz))
  306 
  307 void    pmap_bootstrap(vm_paddr_t *);
  308 int     pmap_change_attr(vm_offset_t, vm_size_t, int);
  309 void    pmap_init_pat(void);
  310 void    pmap_kenter(vm_offset_t va, vm_paddr_t pa);
  311 void    pmap_kenter_attr(vm_offset_t va, vm_paddr_t pa, int mode);
  312 void    *pmap_kenter_temporary(vm_paddr_t pa, int i);
  313 vm_paddr_t pmap_kextract(vm_offset_t);
  314 void    pmap_kremove(vm_offset_t);
  315 void    *pmap_mapbios(vm_paddr_t, vm_size_t);
  316 void    *pmap_mapdev(vm_paddr_t, vm_size_t);
  317 void    *pmap_mapdev_attr(vm_paddr_t, vm_size_t, int);
  318 boolean_t pmap_page_is_mapped(vm_page_t m);
  319 void    pmap_unmapdev(vm_offset_t, vm_size_t);
  320 void    pmap_invalidate_page(pmap_t, vm_offset_t);
  321 void    pmap_invalidate_range(pmap_t, vm_offset_t, vm_offset_t);
  322 void    pmap_invalidate_all(pmap_t);
  323 void    pmap_invalidate_cache(void);
  324 
  325 #endif /* _KERNEL */
  326 
  327 #endif /* !LOCORE */
  328 
  329 #endif /* !_MACHINE_PMAP_H_ */

Cache object: 5706752ca763616a6902f5086ed97482


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]


This page is part of the FreeBSD/Linux Linux Kernel Cross-Reference, and was automatically generated using a modified version of the LXR engine.