| 1 | /*
|
|---|
| 2 | * Copyright (c) 2003-2004 Jakub Jermar
|
|---|
| 3 | * All rights reserved.
|
|---|
| 4 | *
|
|---|
| 5 | * Redistribution and use in source and binary forms, with or without
|
|---|
| 6 | * modification, are permitted provided that the following conditions
|
|---|
| 7 | * are met:
|
|---|
| 8 | *
|
|---|
| 9 | * - Redistributions of source code must retain the above copyright
|
|---|
| 10 | * notice, this list of conditions and the following disclaimer.
|
|---|
| 11 | * - Redistributions in binary form must reproduce the above copyright
|
|---|
| 12 | * notice, this list of conditions and the following disclaimer in the
|
|---|
| 13 | * documentation and/or other materials provided with the distribution.
|
|---|
| 14 | * - The name of the author may not be used to endorse or promote products
|
|---|
| 15 | * derived from this software without specific prior written permission.
|
|---|
| 16 | *
|
|---|
| 17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|---|
| 18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|---|
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|---|
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|---|
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|---|
| 22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|---|
| 23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|---|
| 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|---|
| 25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|---|
| 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|---|
| 27 | */
|
|---|
| 28 |
|
|---|
| 29 | /** @addtogroup mips32mm
|
|---|
| 30 | * @{
|
|---|
| 31 | */
|
|---|
| 32 | /** @file
|
|---|
| 33 | */
|
|---|
| 34 |
|
|---|
| 35 | #ifndef KERN_mips32_PAGE_H_
|
|---|
| 36 | #define KERN_mips32_PAGE_H_
|
|---|
| 37 |
|
|---|
| 38 | #include <arch/mm/frame.h>
|
|---|
| 39 | #include <trace.h>
|
|---|
| 40 |
|
|---|
| 41 | #define PAGE_WIDTH FRAME_WIDTH
|
|---|
| 42 | #define PAGE_SIZE FRAME_SIZE
|
|---|
| 43 |
|
|---|
| 44 | #ifndef __ASM__
|
|---|
| 45 | # define KA2PA(x) (((uintptr_t) (x)) - 0x80000000)
|
|---|
| 46 | # define PA2KA(x) (((uintptr_t) (x)) + 0x80000000)
|
|---|
| 47 | #else
|
|---|
| 48 | # define KA2PA(x) ((x) - 0x80000000)
|
|---|
| 49 | # define PA2KA(x) ((x) + 0x80000000)
|
|---|
| 50 | #endif
|
|---|
| 51 |
|
|---|
| 52 | /*
|
|---|
| 53 | * Implementation of generic 4-level page table interface.
|
|---|
| 54 | *
|
|---|
| 55 | * Page table layout:
|
|---|
| 56 | * - 32-bit virtual addresses
|
|---|
| 57 | * - Offset is 14 bits => pages are 16K long
|
|---|
| 58 | * - PTE's use similar format as CP0 EntryLo[01] registers => PTE is therefore
|
|---|
| 59 | * 4 bytes long
|
|---|
| 60 | * - PTE's replace EntryLo v (valid) bit with p (present) bit
|
|---|
| 61 | * - PTE's use only one bit to distinguish between cacheable and uncacheable
|
|---|
| 62 | * mappings
|
|---|
| 63 | * - PTE's define soft_valid field to ensure there is at least one 1 bit even if
|
|---|
| 64 | * the p bit is cleared
|
|---|
| 65 | * - PTE's make use of CP0 EntryLo's two-bit reserved field for bit W (writable)
|
|---|
| 66 | * and bit A (accessed)
|
|---|
| 67 | * - PTL0 has 64 entries (6 bits)
|
|---|
| 68 | * - PTL1 is not used
|
|---|
| 69 | * - PTL2 is not used
|
|---|
| 70 | * - PTL3 has 4096 entries (12 bits)
|
|---|
| 71 | */
|
|---|
| 72 |
|
|---|
| 73 | /* Macros describing number of entries in each level. */
|
|---|
| 74 | #define PTL0_ENTRIES_ARCH 64
|
|---|
| 75 | #define PTL1_ENTRIES_ARCH 0
|
|---|
| 76 | #define PTL2_ENTRIES_ARCH 0
|
|---|
| 77 | #define PTL3_ENTRIES_ARCH 4096
|
|---|
| 78 |
|
|---|
| 79 | /* Macros describing size of page tables in each level. */
|
|---|
| 80 | #define PTL0_SIZE_ARCH ONE_FRAME
|
|---|
| 81 | #define PTL1_SIZE_ARCH 0
|
|---|
| 82 | #define PTL2_SIZE_ARCH 0
|
|---|
| 83 | #define PTL3_SIZE_ARCH ONE_FRAME
|
|---|
| 84 |
|
|---|
| 85 | /* Macros calculating entry indices for each level. */
|
|---|
| 86 | #define PTL0_INDEX_ARCH(vaddr) ((vaddr) >> 26)
|
|---|
| 87 | #define PTL1_INDEX_ARCH(vaddr) 0
|
|---|
| 88 | #define PTL2_INDEX_ARCH(vaddr) 0
|
|---|
| 89 | #define PTL3_INDEX_ARCH(vaddr) (((vaddr) >> 14) & 0xfff)
|
|---|
| 90 |
|
|---|
| 91 | /* Set accessor for PTL0 address. */
|
|---|
| 92 | #define SET_PTL0_ADDRESS_ARCH(ptl0)
|
|---|
| 93 |
|
|---|
| 94 | /* Get PTE address accessors for each level. */
|
|---|
| 95 | #define GET_PTL1_ADDRESS_ARCH(ptl0, i) \
|
|---|
| 96 | (((pte_t *) (ptl0))[(i)].pfn << 12)
|
|---|
| 97 | #define GET_PTL2_ADDRESS_ARCH(ptl1, i) \
|
|---|
| 98 | (ptl1)
|
|---|
| 99 | #define GET_PTL3_ADDRESS_ARCH(ptl2, i) \
|
|---|
| 100 | (ptl2)
|
|---|
| 101 | #define GET_FRAME_ADDRESS_ARCH(ptl3, i) \
|
|---|
| 102 | (((pte_t *) (ptl3))[(i)].pfn << 12)
|
|---|
| 103 |
|
|---|
| 104 | /* Set PTE address accessors for each level. */
|
|---|
| 105 | #define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) \
|
|---|
| 106 | (((pte_t *) (ptl0))[(i)].pfn = (a) >> 12)
|
|---|
| 107 | #define SET_PTL2_ADDRESS_ARCH(ptl1, i, a)
|
|---|
| 108 | #define SET_PTL3_ADDRESS_ARCH(ptl2, i, a)
|
|---|
| 109 | #define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) \
|
|---|
| 110 | (((pte_t *) (ptl3))[(i)].pfn = (a) >> 12)
|
|---|
| 111 |
|
|---|
| 112 | /* Get PTE flags accessors for each level. */
|
|---|
| 113 | #define GET_PTL1_FLAGS_ARCH(ptl0, i) \
|
|---|
| 114 | get_pt_flags((pte_t *) (ptl0), (size_t) (i))
|
|---|
| 115 | #define GET_PTL2_FLAGS_ARCH(ptl1, i) \
|
|---|
| 116 | PAGE_PRESENT
|
|---|
| 117 | #define GET_PTL3_FLAGS_ARCH(ptl2, i) \
|
|---|
| 118 | PAGE_PRESENT
|
|---|
| 119 | #define GET_FRAME_FLAGS_ARCH(ptl3, i) \
|
|---|
| 120 | get_pt_flags((pte_t *) (ptl3), (size_t) (i))
|
|---|
| 121 |
|
|---|
| 122 | /* Set PTE flags accessors for each level. */
|
|---|
| 123 | #define SET_PTL1_FLAGS_ARCH(ptl0, i, x) \
|
|---|
| 124 | set_pt_flags((pte_t *) (ptl0), (size_t) (i), (x))
|
|---|
| 125 | #define SET_PTL2_FLAGS_ARCH(ptl1, i, x)
|
|---|
| 126 | #define SET_PTL3_FLAGS_ARCH(ptl2, i, x)
|
|---|
| 127 | #define SET_FRAME_FLAGS_ARCH(ptl3, i, x) \
|
|---|
| 128 | set_pt_flags((pte_t *) (ptl3), (size_t) (i), (x))
|
|---|
| 129 |
|
|---|
| 130 | /* Last-level info macros. */
|
|---|
| 131 | #define PTE_VALID_ARCH(pte) (*((uint32_t *) (pte)) != 0)
|
|---|
| 132 | #define PTE_PRESENT_ARCH(pte) ((pte)->p != 0)
|
|---|
| 133 | #define PTE_GET_FRAME_ARCH(pte) ((pte)->pfn << 12)
|
|---|
| 134 | #define PTE_WRITABLE_ARCH(pte) ((pte)->w != 0)
|
|---|
| 135 | #define PTE_EXECUTABLE_ARCH(pte) 1
|
|---|
| 136 |
|
|---|
| 137 | #ifndef __ASM__
|
|---|
| 138 |
|
|---|
| 139 | #include <mm/mm.h>
|
|---|
| 140 | #include <arch/exception.h>
|
|---|
| 141 |
|
|---|
| 142 | /** Page Table Entry. */
|
|---|
| 143 | typedef struct {
|
|---|
| 144 | unsigned g : 1; /**< Global bit. */
|
|---|
| 145 | unsigned p : 1; /**< Present bit. */
|
|---|
| 146 | unsigned d : 1; /**< Dirty bit. */
|
|---|
| 147 | unsigned cacheable : 1; /**< Cacheable bit. */
|
|---|
| 148 | unsigned : 1; /**< Unused. */
|
|---|
| 149 | unsigned soft_valid : 1; /**< Valid content even if not present. */
|
|---|
| 150 | unsigned pfn : 24; /**< Physical frame number. */
|
|---|
| 151 | unsigned w : 1; /**< Page writable bit. */
|
|---|
| 152 | unsigned a : 1; /**< Accessed bit. */
|
|---|
| 153 | } pte_t;
|
|---|
| 154 |
|
|---|
| 155 |
|
|---|
| 156 | NO_TRACE static inline unsigned int get_pt_flags(pte_t *pt, size_t i)
|
|---|
| 157 | {
|
|---|
| 158 | pte_t *p = &pt[i];
|
|---|
| 159 |
|
|---|
| 160 | return ((p->cacheable << PAGE_CACHEABLE_SHIFT) |
|
|---|
| 161 | ((!p->p) << PAGE_PRESENT_SHIFT) |
|
|---|
| 162 | (1 << PAGE_USER_SHIFT) |
|
|---|
| 163 | (1 << PAGE_READ_SHIFT) |
|
|---|
| 164 | ((p->w) << PAGE_WRITE_SHIFT) |
|
|---|
| 165 | (1 << PAGE_EXEC_SHIFT) |
|
|---|
| 166 | (p->g << PAGE_GLOBAL_SHIFT));
|
|---|
| 167 | }
|
|---|
| 168 |
|
|---|
| 169 | NO_TRACE static inline void set_pt_flags(pte_t *pt, size_t i, int flags)
|
|---|
| 170 | {
|
|---|
| 171 | pte_t *p = &pt[i];
|
|---|
| 172 |
|
|---|
| 173 | p->cacheable = (flags & PAGE_CACHEABLE) != 0;
|
|---|
| 174 | p->p = !(flags & PAGE_NOT_PRESENT);
|
|---|
| 175 | p->g = (flags & PAGE_GLOBAL) != 0;
|
|---|
| 176 | p->w = (flags & PAGE_WRITE) != 0;
|
|---|
| 177 |
|
|---|
| 178 | /*
|
|---|
| 179 | * Ensure that valid entries have at least one bit set.
|
|---|
| 180 | */
|
|---|
| 181 | p->soft_valid = 1;
|
|---|
| 182 | }
|
|---|
| 183 |
|
|---|
| 184 | extern void page_arch_init(void);
|
|---|
| 185 |
|
|---|
| 186 | #endif /* __ASM__ */
|
|---|
| 187 |
|
|---|
| 188 | #endif
|
|---|
| 189 |
|
|---|
| 190 | /** @}
|
|---|
| 191 | */
|
|---|