sys/platform/pc64/include/pmap.h

   1 /*
   2  * Copyright (c) 1991 Regents of the University of California.
   3  * Copyright (c) 2003 Peter Wemm.
   4  * Copyright (c) 2008 The DragonFly Project.
   5  * All rights reserved.
   6  *
   7  * This code is derived from software contributed to Berkeley by
   8  * the Systems Programming Group of the University of Utah Computer
   9  * Science Department and William Jolitz of UUNET Technologies Inc.
  10  *
  11  * Redistribution and use in source and binary forms, with or without
  12  * modification, are permitted provided that the following conditions
  13  * are met:
  14  * 1. Redistributions of source code must retain the above copyright
  15  *    notice, this list of conditions and the following disclaimer.
  16  * 2. Redistributions in binary form must reproduce the above copyright
  17  *    notice, this list of conditions and the following disclaimer in the
  18  *    documentation and/or other materials provided with the distribution.
  19  * 3. All advertising materials mentioning features or use of this software
  20  *    must display the following acknowledgement:
  21  *      This product includes software developed by the University of
  22  *      California, Berkeley and its contributors.
  23  * 4. Neither the name of the University nor the names of its contributors
  24  *    may be used to endorse or promote products derived from this software
  25  *    without specific prior written permission.
  26  *
  27  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  28  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  29  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  30  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  31  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  32  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  33  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  34  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  35  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  36  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  37  * SUCH DAMAGE.
  38  *
  39  * Derived from hp300 version by Mike Hibler, this version by William
  40  * Jolitz uses a recursive map [a pde points to the page directory] to
  41  * map the page tables using the pagetables themselves. This is done to
  42  * reduce the impact on kernel virtual memory for lots of sparse address
  43  * space, and to reduce the cost of memory to each process.
  44  *
  45  * from: hp300: @(#)pmap.h      7.2 (Berkeley) 12/16/90
  46  * from: @(#)pmap.h     7.4 (Berkeley) 5/12/91
  47  * $FreeBSD: src/sys/i386/include/pmap.h,v 1.65.2.3 2001/10/03 07:15:37 peter Exp $
  48  * $DragonFly: src/sys/platform/pc64/include/pmap.h,v 1.1 2008/08/29 17:07:17 dillon Exp $
  49  */
  50
  51 #ifndef _MACHINE_PMAP_H_
  52 #define _MACHINE_PMAP_H_
  53
  54 #include <cpu/pmap.h>
  55
  56 /*
  57  * Size of Kernel address space.  This is the number of page table pages
  58  * (2MB each) to use for the kernel.  256 pages == 512 Megabyte.
  59  * This **MUST** be a multiple of 4 (eg: 252, 256, 260, etc).
  60  */
  61 #ifndef KVA_PAGES
  62 #define KVA_PAGES       256
  63 #endif
  64
  65 /*
  66  * Pte related macros.  This is complicated by having to deal with
  67  * the sign extension of the 48th bit.
  68  */
  69 #define KVADDR(l4, l3, l2, l1) ( \
  70         ((unsigned long)-1 << 47) | \
  71         ((unsigned long)(l4) << PML4SHIFT) | \
  72         ((unsigned long)(l3) << PDPSHIFT) | \
  73         ((unsigned long)(l2) << PDRSHIFT) | \
  74         ((unsigned long)(l1) << PAGE_SHIFT))
  75
  76 #define UVADDR(l4, l3, l2, l1) ( \
  77         ((unsigned long)(l4) << PML4SHIFT) | \
  78         ((unsigned long)(l3) << PDPSHIFT) | \
  79         ((unsigned long)(l2) << PDRSHIFT) | \
  80         ((unsigned long)(l1) << PAGE_SHIFT))
  81
  82 /*
  83  * Initial number of kernel page tables x 2
  84  */
  85 #ifndef NKPT
  86 #define NKPT            64
  87 #endif
  88
  89 #define NKPML4E         1               /* number of kernel PML4 slots */
  90 /* NKPDPE defined in vmparam.h */
  91
  92 #define NUPML4E         (NPML4EPG/2)    /* number of userland PML4 pages */
  93 #define NUPDPE          (NUPML4E*NPDPEPG)/* number of userland PDP pages */
  94 #define NUPDE           (NUPDPE*NPDEPG) /* number of userland PD entries */
  95
  96 #define NDMPML4E        1               /* number of dmap PML4 slots */
  97
  98 /*
  99  * The *PML4I values control the layout of virtual memory
 100  */
 101 #define PML4PML4I       (NPML4EPG/2)    /* Index of recursive pml4 mapping */
 102
 103 #define KPML4I          (NPML4EPG-1)    /* Top 512GB for KVM */
 104 #define DMPML4I         (KPML4I-1)      /* Next 512GB down for direct map */
 105
 106 #define KPDPI           (NPDPEPG-2)     /* kernbase at -2GB */
 107
 108 /* per-CPU data is at -2MB */
 109 /* XXX can the kernel decide to use this memory for something else? */
 110 #define MPPML4I         KPML4I
 111 #define MPPDPI          KPDPI
 112 #define MPPTDI          (NPDEPG-1)
 113
 114 /*
 115  * XXX doesn't really belong here I guess...
 116  */
 117 #define ISA_HOLE_START    0xa0000
 118 #define ISA_HOLE_LENGTH (0x100000-ISA_HOLE_START)
 119
 120 #ifndef LOCORE
 121
 122 #ifndef _SYS_TYPES_H_
 123 #include <sys/types.h>
 124 #endif
 125 #ifndef _SYS_QUEUE_H_
 126 #include <sys/queue.h>
 127 #endif
 128 #ifndef _MACHINE_TYPES_H_
 129 #include <machine/types.h>
 130 #endif
 131 #ifndef _MACHINE_PARAM_H_
 132 #include <machine/param.h>
 133 #endif
 134
 135 /*
 136  * Address of current and alternate address space page table maps
 137  * and directories.
 138  */
 139 #ifdef _KERNEL
 140 #define addr_PTmap      (KVADDR(PML4PML4I, 0, 0, 0))
 141 #define addr_PDmap      (KVADDR(PML4PML4I, PML4PML4I, 0, 0))
 142 #define addr_PDPmap     (KVADDR(PML4PML4I, PML4PML4I, PML4PML4I, 0))
 143 #define addr_PML4map    (KVADDR(PML4PML4I, PML4PML4I, PML4PML4I, PML4PML4I))
 144 #define addr_PML4pml4e  (addr_PML4map + (PML4PML4I * sizeof(pml4_entry_t)))
 145 #define PTmap           ((pt_entry_t *)(addr_PTmap))
 146 #define PDmap           ((pd_entry_t *)(addr_PDmap))
 147 #define PDPmap          ((pd_entry_t *)(addr_PDPmap))
 148 #define PML4map         ((pd_entry_t *)(addr_PML4map))
 149 #define PML4pml4e       ((pd_entry_t *)(addr_PML4pml4e))
 150
 151 extern u_int64_t KPML4phys;     /* physical address of kernel level 4 */
 152 #endif
 153
 154 #ifdef _KERNEL
 155
 156 /*
 157  * XXX
 158  */
 159 #define vtophys(va)     pmap_kextract(((vm_offset_t)(va)))
 160 #define vtophys_pte(va) ((pt_entry_t)pmap_kextract(((vm_offset_t)(va))))
 161
 162 #endif
 163
 164 #define pte_load_clear(pte)     atomic_readandclear_long(pte)
 165
 166 static __inline void
 167 pte_store(pt_entry_t *ptep, pt_entry_t pte)
 168 {
 169
 170         *ptep = pte;
 171 }
 172
 173 #define pde_store(pdep, pde)    pte_store((pdep), (pde))
 174
 175 /*
 176  * Pmap stuff
 177  */
 178 struct pv_entry;
 179 struct vm_page;
 180 struct vm_object;
 181 struct vmspace;
 182
 183 struct md_page {
 184         int pv_list_count;
 185         TAILQ_HEAD(,pv_entry)   pv_list;
 186 };
 187
 188 /*
 189  * Each machine dependent implementation is expected to
 190  * keep certain statistics.  They may do this anyway they
 191  * so choose, but are expected to return the statistics
 192  * in the following structure.
 193  *
 194  * NOTE: We try to match the size of the pc32 pmap with the vkernel pmap
 195  * so the same utilities (like 'ps') can be used on both.
 196  */
 197 struct pmap_statistics {
 198         long resident_count;    /* # of pages mapped (total) */
 199         long wired_count;       /* # of pages wired */
 200 };
 201 typedef struct pmap_statistics *pmap_statistics_t;
 202
 203 struct pmap {
 204         pml4_entry_t            *pm_pml4;       /* KVA of level 4 page table */
 205         struct vm_page          *pm_pdirm;      /* VM page for pg directory */
 206         struct vm_object        *pm_pteobj;     /* Container for pte's */
 207         TAILQ_ENTRY(pmap)       pm_pmnode;      /* list of pmaps */
 208         TAILQ_HEAD(,pv_entry)   pm_pvlist;      /* list of mappings in pmap */
 209         int                     pm_count;       /* reference count */
 210         cpumask_t               pm_active;      /* active on cpus */
 211         int                     pm_filler02;    /* (filler sync w/vkernel) */
 212         struct pmap_statistics  pm_stats;       /* pmap statistics */
 213         struct  vm_page         *pm_ptphint;    /* pmap ptp hint */
 214         int                     pm_generation;  /* detect pvlist deletions */
 215 };
 216
 217 #define CPUMASK_LOCK            (1 << SMP_MAXCPU)
 218
 219 #define pmap_resident_count(pmap) (pmap)->pm_stats.resident_count
 220
 221 typedef struct pmap     *pmap_t;
 222
 223 #ifdef _KERNEL
 224 extern struct pmap      kernel_pmap;
 225 #endif
 226
 227 /*
 228  * For each vm_page_t, there is a list of all currently valid virtual
 229  * mappings of that page.  An entry is a pv_entry_t, the list is pv_table.
 230  */
 231 typedef struct pv_entry {
 232         pmap_t          pv_pmap;        /* pmap where mapping lies */
 233         vm_offset_t     pv_va;          /* virtual address for mapping */
 234         TAILQ_ENTRY(pv_entry)   pv_list;
 235         TAILQ_ENTRY(pv_entry)   pv_plist;
 236         struct vm_page  *pv_ptem;       /* VM page for pte */
 237 } *pv_entry_t;
 238
 239 #ifdef  _KERNEL
 240
 241 #define NPPROVMTRR              8
 242 #define PPRO_VMTRRphysBase0     0x200
 243 #define PPRO_VMTRRphysMask0     0x201
 244 struct ppro_vmtrr {
 245         u_int64_t base, mask;
 246 };
 247 extern struct ppro_vmtrr PPro_vmtrr[NPPROVMTRR];
 248
 249 extern caddr_t  CADDR1;
 250 extern pt_entry_t *CMAP1;
 251 extern vm_paddr_t dump_avail[];
 252 extern vm_paddr_t avail_end;
 253 extern vm_paddr_t avail_start;
 254 extern vm_offset_t clean_eva;
 255 extern vm_offset_t clean_sva;
 256 extern char *ptvmmap;           /* poor name! */
 257
 258 void    init_paging(vm_paddr_t *);
 259 void    pmap_interlock_wait (struct vmspace *);
 260 void    pmap_bootstrap (vm_paddr_t *);
 261 void    *pmap_mapdev (vm_paddr_t, vm_size_t);
 262 void    *pmap_mapdev_uncacheable(vm_paddr_t, vm_size_t);
 263 void    pmap_unmapdev (vm_offset_t, vm_size_t);
 264 #if JG
 265 pt_entry_t *pmap_pte (pmap_t, vm_offset_t) __pure2;
 266 #endif
 267 struct vm_page *pmap_use_pt (pmap_t, vm_offset_t);
 268 #ifdef SMP
 269 void    pmap_set_opt (void);
 270 #endif
 271 vm_paddr_t pmap_kextract(vm_offset_t);
 272
 273 #endif /* _KERNEL */
 274
 275 #endif /* !LOCORE */
 276
 277 #endif /* !_MACHINE_PMAP_H_ */