pmap-v6.h revision 295799
1/*- 2 * Copyright 2014 Svatopluk Kraus <onwahe@gmail.com> 3 * Copyright 2014 Michal Meloun <meloun@miracle.cz> 4 * Copyright (c) 1991 Regents of the University of California. 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 * 20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 * 32 * The ARM version of this file was more or less based on the i386 version, 33 * which has the following provenance... 34 * 35 * Derived from hp300 version by Mike Hibler, this version by William 36 * Jolitz uses a recursive map [a pde points to the page directory] to 37 * map the page tables using the pagetables themselves. This is done to 38 * reduce the impact on kernel virtual memory for lots of sparse address 39 * space, and to reduce the cost of memory to each process. 40 * 41 * from: hp300: @(#)pmap.h 7.2 (Berkeley) 12/16/90 42 * from: @(#)pmap.h 7.4 (Berkeley) 5/12/91 43 * from: FreeBSD: src/sys/i386/include/pmap.h,v 1.70 2000/11/30 44 * 45 * $FreeBSD: head/sys/arm/include/pmap-v6.h 295799 2016-02-19 08:41:47Z skra $ 46 */ 47 48#ifndef _MACHINE_PMAP_V6_H_ 49#define _MACHINE_PMAP_V6_H_ 50 51#include <sys/queue.h> 52#include <sys/_cpuset.h> 53#include <sys/_lock.h> 54#include <sys/_mutex.h> 55 56typedef uint32_t pt1_entry_t; /* L1 table entry */ 57typedef uint32_t pt2_entry_t; /* L2 table entry */ 58typedef uint32_t ttb_entry_t; /* TTB entry */ 59 60#ifdef _KERNEL 61 62#if 0 63#define PMAP_PTE_NOCACHE // Use uncached page tables 64#endif 65 66/* 67 * (1) During pmap bootstrap, physical pages for L2 page tables are 68 * allocated in advance which are used for KVA continuous mapping 69 * starting from KERNBASE. This makes things more simple. 70 * (2) During vm subsystem initialization, only vm subsystem itself can 71 * allocate physical memory safely. As pmap_map() is called during 72 * this initialization, we must be prepared for that and have some 73 * preallocated physical pages for L2 page tables. 74 * 75 * Note that some more pages for L2 page tables are preallocated too 76 * for mappings laying above VM_MAX_KERNEL_ADDRESS. 77 */ 78#ifndef NKPT2PG 79/* 80 * The optimal way is to define this in board configuration as 81 * definition here must be safe enough. It means really big. 82 * 83 * 1 GB KVA <=> 256 kernel L2 page table pages 84 * 85 * From real platforms: 86 * 1 GB physical memory <=> 10 pages is enough 87 * 2 GB physical memory <=> 21 pages is enough 88 */ 89#define NKPT2PG 32 90#endif 91 92/* 93 * Pmap stuff 94 */ 95 96/* 97 * This structure is used to hold a virtual<->physical address 98 * association and is used mostly by bootstrap code 99 */ 100struct pv_addr { 101 SLIST_ENTRY(pv_addr) pv_list; 102 vm_offset_t pv_va; 103 vm_paddr_t pv_pa; 104}; 105#endif 106struct pv_entry; 107struct pv_chunk; 108 109struct md_page { 110 TAILQ_HEAD(,pv_entry) pv_list; 111 uint16_t pt2_wirecount[4]; 112 vm_memattr_t pat_mode; 113}; 114 115struct pmap { 116 struct mtx pm_mtx; 117 pt1_entry_t *pm_pt1; /* KVA of pt1 */ 118 pt2_entry_t *pm_pt2tab; /* KVA of pt2 pages table */ 119 TAILQ_HEAD(,pv_chunk) pm_pvchunk; /* list of mappings in pmap */ 120 cpuset_t pm_active; /* active on cpus */ 121 struct pmap_statistics pm_stats; /* pmap statictics */ 122 LIST_ENTRY(pmap) pm_list; /* List of all pmaps */ 123}; 124 125typedef struct pmap *pmap_t; 126 127#ifdef _KERNEL 128extern struct pmap kernel_pmap_store; 129#define kernel_pmap (&kernel_pmap_store) 130 131#define PMAP_LOCK(pmap) mtx_lock(&(pmap)->pm_mtx) 132#define PMAP_LOCK_ASSERT(pmap, type) \ 133 mtx_assert(&(pmap)->pm_mtx, (type)) 134#define PMAP_LOCK_DESTROY(pmap) mtx_destroy(&(pmap)->pm_mtx) 135#define PMAP_LOCK_INIT(pmap) mtx_init(&(pmap)->pm_mtx, "pmap", \ 136 NULL, MTX_DEF | MTX_DUPOK) 137#define PMAP_LOCKED(pmap) mtx_owned(&(pmap)->pm_mtx) 138#define PMAP_MTX(pmap) (&(pmap)->pm_mtx) 139#define PMAP_TRYLOCK(pmap) mtx_trylock(&(pmap)->pm_mtx) 140#define PMAP_UNLOCK(pmap) mtx_unlock(&(pmap)->pm_mtx) 141#endif 142 143/* 144 * For each vm_page_t, there is a list of all currently valid virtual 145 * mappings of that page. An entry is a pv_entry_t, the list is pv_list. 146 */ 147typedef struct pv_entry { 148 vm_offset_t pv_va; /* virtual address for mapping */ 149 TAILQ_ENTRY(pv_entry) pv_next; 150} *pv_entry_t; 151 152/* 153 * pv_entries are allocated in chunks per-process. This avoids the 154 * need to track per-pmap assignments. 155 */ 156#define _NPCM 11 157#define _NPCPV 336 158struct pv_chunk { 159 pmap_t pc_pmap; 160 TAILQ_ENTRY(pv_chunk) pc_list; 161 uint32_t pc_map[_NPCM]; /* bitmap; 1 = free */ 162 TAILQ_ENTRY(pv_chunk) pc_lru; 163 struct pv_entry pc_pventry[_NPCPV]; 164}; 165 166#ifdef _KERNEL 167extern ttb_entry_t pmap_kern_ttb; /* TTB for kernel pmap */ 168 169#define pmap_page_get_memattr(m) ((m)->md.pat_mode) 170 171/* 172 * Only the following functions or macros may be used before pmap_bootstrap() 173 * is called: pmap_kenter(), pmap_kextract(), pmap_kremove(), vtophys(), and 174 * vtopte2(). 175 */ 176void pmap_bootstrap(vm_offset_t ); 177void pmap_kenter(vm_offset_t , vm_paddr_t ); 178void pmap_kremove(vm_offset_t); 179void *pmap_mapdev_attr(vm_paddr_t, vm_size_t, int); 180boolean_t pmap_page_is_mapped(vm_page_t ); 181 182void pmap_tlb_flush(pmap_t , vm_offset_t ); 183void pmap_tlb_flush_range(pmap_t , vm_offset_t , vm_size_t ); 184 185void pmap_dcache_wb_range(vm_paddr_t , vm_size_t , vm_memattr_t ); 186 187vm_paddr_t pmap_dump_kextract(vm_offset_t, pt2_entry_t *); 188 189int pmap_fault(pmap_t , vm_offset_t , uint32_t , int , bool); 190 191void pmap_set_tex(void); 192void reinit_mmu(ttb_entry_t ttb, u_int aux_clr, u_int aux_set); 193 194/* 195 * Pre-bootstrap epoch functions set. 196 */ 197void pmap_bootstrap_prepare(vm_paddr_t ); 198vm_paddr_t pmap_preboot_get_pages(u_int ); 199void pmap_preboot_map_pages(vm_paddr_t , vm_offset_t , u_int ); 200vm_offset_t pmap_preboot_reserve_pages(u_int ); 201vm_offset_t pmap_preboot_get_vpages(u_int ); 202void pmap_preboot_map_attr(vm_paddr_t, vm_offset_t, vm_size_t, vm_prot_t, 203 vm_memattr_t); 204 205#endif /* _KERNEL */ 206#endif /* !_MACHINE_PMAP_V6_H_ */ 207