1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1991 Regents of the University of California. 5 * All rights reserved. 6 * 7 * Copyright (c) 2018 The FreeBSD Foundation 8 * All rights reserved. 9 * 10 * This code is derived from software contributed to Berkeley by 11 * the Systems Programming Group of the University of Utah Computer 12 * Science Department and William Jolitz of UUNET Technologies Inc. 13 * 14 * Portions of this software were developed by 15 * Konstantin Belousov <kib@FreeBSD.org> under sponsorship from 16 * the FreeBSD Foundation. 17 * 18 * Redistribution and use in source and binary forms, with or without 19 * modification, are permitted provided that the following conditions 20 * are met: 21 * 1. Redistributions of source code must retain the above copyright 22 * notice, this list of conditions and the following disclaimer. 23 * 2. Redistributions in binary form must reproduce the above copyright 24 * notice, this list of conditions and the following disclaimer in the 25 * documentation and/or other materials provided with the distribution. 26 * 3. Neither the name of the University nor the names of its contributors 27 * may be used to endorse or promote products derived from this software 28 * without specific prior written permission. 29 * 30 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 31 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 32 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 33 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 34 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 35 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 36 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 37 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 38 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 39 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 40 * SUCH DAMAGE. 41 * 42 * Derived from hp300 version by Mike Hibler, this version by William 43 * Jolitz uses a recursive map [a pde points to the page directory] to 44 * map the page tables using the pagetables themselves. This is done to 45 * reduce the impact on kernel virtual memory for lots of sparse address 46 * space, and to reduce the cost of memory to each process. 47 */ 48 49 #ifndef _MACHINE_PMAP_NOPAE_H 50 #define _MACHINE_PMAP_NOPAE_H 51 52 #define NTRPPTD 1 53 #define LOWPTDI 1 54 #define KERNPTDI 2 55 56 #define NPGPTD 1 57 #define NPGPTD_SHIFT 10 58 #undef PDRSHIFT 59 #define PDRSHIFT PDRSHIFT_NOPAE 60 #undef NBPDR 61 #define NBPDR (1 << PDRSHIFT_NOPAE) /* bytes/page dir */ 62 63 #define PG_FRAME PG_FRAME_NOPAE 64 #define PG_PS_FRAME PG_PS_FRAME_NOPAE 65 66 #define KVA_PAGES (256*4) 67 68 #ifndef NKPT 69 #define NKPT 30 70 #endif 71 72 typedef uint32_t pd_entry_t; 73 typedef uint32_t pt_entry_t; 74 typedef uint32_t pdpt_entry_t; /* Only to keep struct pmap layout. */ 75 76 #define PTESHIFT (2) 77 #define PDESHIFT (2) 78 79 #define pde_cmpset(pdep, old, new) atomic_cmpset_int(pdep, old, new) 80 #define pte_load_store(ptep, pte) atomic_swap_int(ptep, pte) 81 #define pte_load_clear(ptep) atomic_swap_int(ptep, 0) 82 #define pte_store(ptep, pte) do { \ 83 *(u_int *)(ptep) = (u_int)(pte); \ 84 } while (0) 85 #define pte_store_zero(ptep, pte) pte_store(ptep, pte) 86 #define pte_load(ptep) atomic_load_int(ptep) 87 88 extern pt_entry_t PTmap[]; 89 extern pd_entry_t PTD[]; 90 extern pd_entry_t PTDpde[]; 91 extern pd_entry_t *IdlePTD_nopae; 92 extern pt_entry_t *KPTmap_nopae; 93 94 struct pmap; 95 pt_entry_t *__CONCAT(PMTYPE, pmap_pte)(struct pmap *, vm_offset_t) __pure2; 96 97 #endif 98