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/i386/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) 1991 Regents of the University of California.
    3  * All rights reserved.
    4  *
    5  * This code is derived from software contributed to Berkeley by
    6  * the Systems Programming Group of the University of Utah Computer
    7  * Science Department and William Jolitz of UUNET Technologies Inc.
    8  *
    9  * Redistribution and use in source and binary forms, with or without
   10  * modification, are permitted provided that the following conditions
   11  * are met:
   12  * 1. Redistributions of source code must retain the above copyright
   13  *    notice, this list of conditions and the following disclaimer.
   14  * 2. Redistributions in binary form must reproduce the above copyright
   15  *    notice, this list of conditions and the following disclaimer in the
   16  *    documentation and/or other materials provided with the distribution.
   17  * 4. Neither the name of the University nor the names of its contributors
   18  *    may be used to endorse or promote products derived from this software
   19  *    without specific prior written permission.
   20  *
   21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
   22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
   25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   31  * SUCH DAMAGE.
   32  *
   33  * Derived from hp300 version by Mike Hibler, this version by William
   34  * Jolitz uses a recursive map [a pde points to the page directory] to
   35  * map the page tables using the pagetables themselves. This is done to
   36  * reduce the impact on kernel virtual memory for lots of sparse address
   37  * space, and to reduce the cost of memory to each process.
   38  *
   39  *      from: hp300: @(#)pmap.h 7.2 (Berkeley) 12/16/90
   40  *      from: @(#)pmap.h        7.4 (Berkeley) 5/12/91
   41  * $FreeBSD$
   42  */
   43 
   44 #ifndef _MACHINE_PMAP_H_
   45 #define _MACHINE_PMAP_H_
   46 
   47 /*
   48  * Page-directory and page-table entires follow this format, with a few
   49  * of the fields not present here and there, depending on a lot of things.
   50  */
   51                                 /* ---- Intel Nomenclature ---- */
   52 #define PG_V            0x001   /* P    Valid                   */
   53 #define PG_RW           0x002   /* R/W  Read/Write              */
   54 #define PG_U            0x004   /* U/S  User/Supervisor         */
   55 #define PG_NC_PWT       0x008   /* PWT  Write through           */
   56 #define PG_NC_PCD       0x010   /* PCD  Cache disable           */
   57 #define PG_A            0x020   /* A    Accessed                */
   58 #define PG_M            0x040   /* D    Dirty                   */
   59 #define PG_PS           0x080   /* PS   Page size (0=4k,1=4M)   */
   60 #define PG_PTE_PAT      0x080   /* PAT  PAT index               */
   61 #define PG_G            0x100   /* G    Global                  */
   62 #define PG_AVAIL1       0x200   /*    / Available for system    */
   63 #define PG_AVAIL2       0x400   /*   <  programmers use         */
   64 #define PG_AVAIL3       0x800   /*    \                         */
   65 #define PG_PDE_PAT      0x1000  /* PAT  PAT index               */
   66 
   67 
   68 /* Our various interpretations of the above */
   69 #define PG_W            PG_AVAIL1       /* "Wired" pseudoflag */
   70 #define PG_MANAGED      PG_AVAIL2
   71 #define PG_FRAME        (~((vm_paddr_t)PAGE_MASK))
   72 #define PG_PROT         (PG_RW|PG_U)    /* all protection bits . */
   73 #define PG_N            (PG_NC_PWT|PG_NC_PCD)   /* Non-cacheable */
   74 
   75 /*
   76  * Page Protection Exception bits
   77  */
   78 
   79 #define PGEX_P          0x01    /* Protection violation vs. not present */
   80 #define PGEX_W          0x02    /* during a Write cycle */
   81 #define PGEX_U          0x04    /* access from User mode (UPL) */
   82 
   83 /*
   84  * Size of Kernel address space.  This is the number of page table pages
   85  * (4MB each) to use for the kernel.  256 pages == 1 Gigabyte.
   86  * This **MUST** be a multiple of 4 (eg: 252, 256, 260, etc).
   87  * For PAE, the page table page unit size is 2MB.  This means that 512 pages
   88  * is 1 Gigabyte.  Double everything.  It must be a multiple of 8 for PAE.
   89  */
   90 #ifndef KVA_PAGES
   91 #ifdef PAE
   92 #define KVA_PAGES       512
   93 #else
   94 #define KVA_PAGES       256
   95 #endif
   96 #endif
   97 
   98 /*
   99  * Pte related macros
  100  */
  101 #define VADDR(pdi, pti) ((vm_offset_t)(((pdi)<<PDRSHIFT)|((pti)<<PAGE_SHIFT)))
  102 
  103 /* Actual number of kernel page tables */
  104 #ifndef NKPT
  105 #ifdef PAE
  106 #define NKPT            240     /* Enough for 16GB (2MB page tables) */
  107 #else
  108 #define NKPT            30      /* Enough for 4GB (4MB page tables) */
  109 #endif
  110 #endif
  111 #ifndef NKPDE
  112 #define NKPDE   (KVA_PAGES)     /* number of page tables/pde's */
  113 #endif
  114 
  115 /*
  116  * The *PTDI values control the layout of virtual memory
  117  *
  118  * XXX This works for now, but I am not real happy with it, I'll fix it
  119  * right after I fix locore.s and the magic 28K hole
  120  */
  121 #define KPTDI           (NPDEPTD-NKPDE) /* start of kernel virtual pde's */
  122 #define PTDPTDI         (KPTDI-NPGPTD)  /* ptd entry that points to ptd! */
  123 
  124 /*
  125  * XXX doesn't really belong here I guess...
  126  */
  127 #define ISA_HOLE_START    0xa0000
  128 #define ISA_HOLE_LENGTH (0x100000-ISA_HOLE_START)
  129 
  130 #ifndef LOCORE
  131 
  132 #include <sys/queue.h>
  133 #include <sys/_lock.h>
  134 #include <sys/_mutex.h>
  135 
  136 #ifdef PAE
  137 
  138 typedef uint64_t pdpt_entry_t;
  139 typedef uint64_t pd_entry_t;
  140 typedef uint64_t pt_entry_t;
  141 
  142 #define PTESHIFT        (3)
  143 #define PDESHIFT        (3)
  144 
  145 #else
  146 
  147 typedef uint32_t pd_entry_t;
  148 typedef uint32_t pt_entry_t;
  149 
  150 #define PTESHIFT        (2)
  151 #define PDESHIFT        (2)
  152 
  153 #endif
  154 
  155 /*
  156  * Address of current and alternate address space page table maps
  157  * and directories.
  158  */
  159 #ifdef _KERNEL
  160 extern pt_entry_t PTmap[];
  161 extern pd_entry_t PTD[];
  162 extern pd_entry_t PTDpde[];
  163 
  164 #ifdef PAE
  165 extern pdpt_entry_t *IdlePDPT;
  166 #endif
  167 extern pd_entry_t *IdlePTD;     /* physical address of "Idle" state directory */
  168 #endif
  169 
  170 #ifdef _KERNEL
  171 /*
  172  * virtual address to page table entry and
  173  * to physical address. Likewise for alternate address space.
  174  * Note: these work recursively, thus vtopte of a pte will give
  175  * the corresponding pde that in turn maps it.
  176  */
  177 #define vtopte(va)      (PTmap + i386_btop(va))
  178 
  179 /*
  180  *      Routine:        pmap_kextract
  181  *      Function:
  182  *              Extract the physical page address associated
  183  *              kernel virtual address.
  184  */
  185 static __inline vm_paddr_t
  186 pmap_kextract(vm_offset_t va)
  187 {
  188         vm_paddr_t pa;
  189 
  190         if ((pa = PTD[va >> PDRSHIFT]) & PG_PS) {
  191                 pa = (pa & ~(NBPDR - 1)) | (va & (NBPDR - 1));
  192         } else {
  193                 pa = *vtopte(va);
  194                 pa = (pa & PG_FRAME) | (va & PAGE_MASK);
  195         }
  196         return pa;
  197 }
  198 
  199 #define vtophys(va)     pmap_kextract(((vm_offset_t) (va)))
  200 
  201 #ifdef PAE
  202 
  203 static __inline pt_entry_t
  204 pte_load(pt_entry_t *ptep)
  205 {
  206         pt_entry_t r;
  207 
  208         __asm __volatile(
  209             "lock; cmpxchg8b %1"
  210             : "=A" (r)
  211             : "m" (*ptep), "a" (0), "d" (0), "b" (0), "c" (0));
  212         return (r);
  213 }
  214 
  215 static __inline pt_entry_t
  216 pte_load_store(pt_entry_t *ptep, pt_entry_t v)
  217 {
  218         pt_entry_t r;
  219 
  220         r = *ptep;
  221         __asm __volatile(
  222             "1:\n"
  223             "\tlock; cmpxchg8b %1\n"
  224             "\tjnz 1b"
  225             : "+A" (r)
  226             : "m" (*ptep), "b" ((uint32_t)v), "c" ((uint32_t)(v >> 32)));
  227         return (r);
  228 }
  229 
  230 #define pte_load_clear(ptep)    pte_load_store((ptep), (pt_entry_t)0ULL)
  231 
  232 #define pte_store(ptep, pte)    pte_load_store((ptep), (pt_entry_t)pte)
  233 
  234 #else /* PAE */
  235 
  236 static __inline pt_entry_t
  237 pte_load(pt_entry_t *ptep)
  238 {
  239         pt_entry_t r;
  240 
  241         r = *ptep;
  242         return (r);
  243 }
  244 
  245 static __inline pt_entry_t
  246 pte_load_store(pt_entry_t *ptep, pt_entry_t pte)
  247 {
  248         pt_entry_t r;
  249 
  250         __asm __volatile(
  251             "xchgl %0,%1"
  252             : "=m" (*ptep),
  253               "=r" (r)
  254             : "1" (pte),
  255               "m" (*ptep));
  256         return (r);
  257 }
  258 
  259 #define pte_load_clear(pte)     atomic_readandclear_int(pte)
  260 
  261 static __inline void
  262 pte_store(pt_entry_t *ptep, pt_entry_t pte)
  263 {
  264 
  265         *ptep = pte;
  266 }
  267 
  268 #endif /* PAE */
  269 
  270 #define pte_clear(ptep)         pte_store((ptep), (pt_entry_t)0ULL)
  271 
  272 #define pde_store(pdep, pde)    pte_store((pdep), (pde))
  273 
  274 #endif /* _KERNEL */
  275 
  276 /*
  277  * Pmap stuff
  278  */
  279 struct  pv_entry;
  280 
  281 struct md_page {
  282         int pv_list_count;
  283         TAILQ_HEAD(,pv_entry)   pv_list;
  284 };
  285 
  286 struct pmap {
  287         struct mtx              pm_mtx;
  288         pd_entry_t              *pm_pdir;       /* KVA of page directory */
  289         TAILQ_HEAD(,pv_entry)   pm_pvlist;      /* list of mappings in pmap */
  290         u_int                   pm_active;      /* active on cpus */
  291         struct pmap_statistics  pm_stats;       /* pmap statistics */
  292         LIST_ENTRY(pmap)        pm_list;        /* List of all pmaps */
  293 #ifdef PAE
  294         pdpt_entry_t            *pm_pdpt;       /* KVA of page director pointer
  295                                                    table */
  296 #endif
  297 };
  298 
  299 typedef struct pmap     *pmap_t;
  300 
  301 #ifdef _KERNEL
  302 extern struct pmap      kernel_pmap_store;
  303 #define kernel_pmap     (&kernel_pmap_store)
  304 
  305 #define PMAP_LOCK(pmap)         mtx_lock(&(pmap)->pm_mtx)
  306 #define PMAP_LOCK_ASSERT(pmap, type) \
  307                                 mtx_assert(&(pmap)->pm_mtx, (type))
  308 #define PMAP_LOCK_DESTROY(pmap) mtx_destroy(&(pmap)->pm_mtx)
  309 #define PMAP_LOCK_INIT(pmap)    mtx_init(&(pmap)->pm_mtx, "pmap", \
  310                                     NULL, MTX_DEF | MTX_DUPOK)
  311 #define PMAP_LOCKED(pmap)       mtx_owned(&(pmap)->pm_mtx)
  312 #define PMAP_MTX(pmap)          (&(pmap)->pm_mtx)
  313 #define PMAP_TRYLOCK(pmap)      mtx_trylock(&(pmap)->pm_mtx)
  314 #define PMAP_UNLOCK(pmap)       mtx_unlock(&(pmap)->pm_mtx)
  315 #endif
  316 
  317 /*
  318  * For each vm_page_t, there is a list of all currently valid virtual
  319  * mappings of that page.  An entry is a pv_entry_t, the list is pv_table.
  320  */
  321 typedef struct pv_entry {
  322         pmap_t          pv_pmap;        /* pmap where mapping lies */
  323         vm_offset_t     pv_va;          /* virtual address for mapping */
  324         TAILQ_ENTRY(pv_entry)   pv_list;
  325         TAILQ_ENTRY(pv_entry)   pv_plist;
  326 } *pv_entry_t;
  327 
  328 #ifdef  _KERNEL
  329 
  330 #define NPPROVMTRR              8
  331 #define PPRO_VMTRRphysBase0     0x200
  332 #define PPRO_VMTRRphysMask0     0x201
  333 struct ppro_vmtrr {
  334         u_int64_t base, mask;
  335 };
  336 extern struct ppro_vmtrr PPro_vmtrr[NPPROVMTRR];
  337 
  338 extern caddr_t  CADDR1;
  339 extern pt_entry_t *CMAP1;
  340 extern vm_paddr_t avail_end;
  341 extern vm_paddr_t phys_avail[];
  342 extern vm_paddr_t dump_avail[];
  343 extern int pseflag;
  344 extern int pgeflag;
  345 extern char *ptvmmap;           /* poor name! */
  346 extern vm_offset_t virtual_avail;
  347 extern vm_offset_t virtual_end;
  348 
  349 #define pmap_page_is_mapped(m)  (!TAILQ_EMPTY(&(m)->md.pv_list))
  350 #define pmap_unmapbios(va, sz)  pmap_unmapdev((va), (sz))
  351 
  352 void    pmap_bootstrap(vm_paddr_t, vm_paddr_t);
  353 int     pmap_change_attr(vm_offset_t, vm_size_t, int);
  354 void    pmap_init_pat(void);
  355 void    pmap_kenter(vm_offset_t va, vm_paddr_t pa);
  356 void    pmap_kenter_attr(vm_offset_t va, vm_paddr_t pa, int mode);
  357 void    *pmap_kenter_temporary(vm_paddr_t pa, int i);
  358 void    pmap_kremove(vm_offset_t);
  359 void    *pmap_mapbios(vm_paddr_t, vm_size_t);
  360 void    *pmap_mapdev(vm_paddr_t, vm_size_t);
  361 void    *pmap_mapdev_attr(vm_paddr_t, vm_size_t, int);
  362 void    pmap_unmapdev(vm_offset_t, vm_size_t);
  363 pt_entry_t *pmap_pte(pmap_t, vm_offset_t) __pure2;
  364 void    pmap_set_pg(void);
  365 void    pmap_invalidate_page(pmap_t, vm_offset_t);
  366 void    pmap_invalidate_range(pmap_t, vm_offset_t, vm_offset_t);
  367 void    pmap_invalidate_all(pmap_t);
  368 void    pmap_invalidate_cache(void);
  369 
  370 #endif /* _KERNEL */
  371 
  372 #endif /* !LOCORE */
  373 
  374 #endif /* !_MACHINE_PMAP_H_ */

Cache object: 74645d7e4b5989885ad11073ae919741


[ 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.