source: mainline/kernel/arch/mips32/include/mm/page.h@ 294f7a52

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 294f7a52 was 7a0359b, checked in by Martin Decky <martin@…>, 15 years ago

improve kernel function tracing

  • add support for more generic kernel sources
  • replace attribute((no_instrument_function)) with NO_TRACE macro (shorter and for future compatibility with different compilers)
  • to be on the safe side, do not instrument most of the inline and static functions (plus some specific non-static functions)

collateral code cleanup (no change in functionality)

  • Property mode set to 100644
File size: 6.0 KB
Line 
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#ifdef KERNEL
53
54/*
55 * Implementation of generic 4-level page table interface.
56 *
57 * Page table layout:
58 * - 32-bit virtual addresses
59 * - Offset is 14 bits => pages are 16K long
60 * - PTE's use similar format as CP0 EntryLo[01] registers => PTE is therefore
61 * 4 bytes long
62 * - PTE's replace EntryLo v (valid) bit with p (present) bit
63 * - PTE's use only one bit to distinguish between cacheable and uncacheable
64 * mappings
65 * - PTE's define soft_valid field to ensure there is at least one 1 bit even if
66 * the p bit is cleared
67 * - PTE's make use of CP0 EntryLo's two-bit reserved field for bit W (writable)
68 * and bit A (accessed)
69 * - PTL0 has 64 entries (6 bits)
70 * - PTL1 is not used
71 * - PTL2 is not used
72 * - PTL3 has 4096 entries (12 bits)
73 */
74
75/* Macros describing number of entries in each level. */
76#define PTL0_ENTRIES_ARCH 64
77#define PTL1_ENTRIES_ARCH 0
78#define PTL2_ENTRIES_ARCH 0
79#define PTL3_ENTRIES_ARCH 4096
80
81/* Macros describing size of page tables in each level. */
82#define PTL0_SIZE_ARCH ONE_FRAME
83#define PTL1_SIZE_ARCH 0
84#define PTL2_SIZE_ARCH 0
85#define PTL3_SIZE_ARCH ONE_FRAME
86
87/* Macros calculating entry indices for each level. */
88#define PTL0_INDEX_ARCH(vaddr) ((vaddr) >> 26)
89#define PTL1_INDEX_ARCH(vaddr) 0
90#define PTL2_INDEX_ARCH(vaddr) 0
91#define PTL3_INDEX_ARCH(vaddr) (((vaddr) >> 14) & 0xfff)
92
93/* Set accessor for PTL0 address. */
94#define SET_PTL0_ADDRESS_ARCH(ptl0)
95
96/* Get PTE address accessors for each level. */
97#define GET_PTL1_ADDRESS_ARCH(ptl0, i) \
98 (((pte_t *) (ptl0))[(i)].pfn << 12)
99#define GET_PTL2_ADDRESS_ARCH(ptl1, i) \
100 (ptl1)
101#define GET_PTL3_ADDRESS_ARCH(ptl2, i) \
102 (ptl2)
103#define GET_FRAME_ADDRESS_ARCH(ptl3, i) \
104 (((pte_t *) (ptl3))[(i)].pfn << 12)
105
106/* Set PTE address accessors for each level. */
107#define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) \
108 (((pte_t *) (ptl0))[(i)].pfn = (a) >> 12)
109#define SET_PTL2_ADDRESS_ARCH(ptl1, i, a)
110#define SET_PTL3_ADDRESS_ARCH(ptl2, i, a)
111#define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) \
112 (((pte_t *) (ptl3))[(i)].pfn = (a) >> 12)
113
114/* Get PTE flags accessors for each level. */
115#define GET_PTL1_FLAGS_ARCH(ptl0, i) \
116 get_pt_flags((pte_t *) (ptl0), (size_t) (i))
117#define GET_PTL2_FLAGS_ARCH(ptl1, i) \
118 PAGE_PRESENT
119#define GET_PTL3_FLAGS_ARCH(ptl2, i) \
120 PAGE_PRESENT
121#define GET_FRAME_FLAGS_ARCH(ptl3, i) \
122 get_pt_flags((pte_t *) (ptl3), (size_t) (i))
123
124/* Set PTE flags accessors for each level. */
125#define SET_PTL1_FLAGS_ARCH(ptl0, i, x) \
126 set_pt_flags((pte_t *) (ptl0), (size_t) (i), (x))
127#define SET_PTL2_FLAGS_ARCH(ptl1, i, x)
128#define SET_PTL3_FLAGS_ARCH(ptl2, i, x)
129#define SET_FRAME_FLAGS_ARCH(ptl3, i, x) \
130 set_pt_flags((pte_t *) (ptl3), (size_t) (i), (x))
131
132/* Last-level info macros. */
133#define PTE_VALID_ARCH(pte) (*((uint32_t *) (pte)) != 0)
134#define PTE_PRESENT_ARCH(pte) ((pte)->p != 0)
135#define PTE_GET_FRAME_ARCH(pte) ((pte)->pfn << 12)
136#define PTE_WRITABLE_ARCH(pte) ((pte)->w != 0)
137#define PTE_EXECUTABLE_ARCH(pte) 1
138
139#ifndef __ASM__
140
141#include <mm/mm.h>
142#include <arch/exception.h>
143
144/** Page Table Entry. */
145typedef struct {
146 unsigned g : 1; /**< Global bit. */
147 unsigned p : 1; /**< Present bit. */
148 unsigned d : 1; /**< Dirty bit. */
149 unsigned cacheable : 1; /**< Cacheable bit. */
150 unsigned : 1; /**< Unused. */
151 unsigned soft_valid : 1; /**< Valid content even if not present. */
152 unsigned pfn : 24; /**< Physical frame number. */
153 unsigned w : 1; /**< Page writable bit. */
154 unsigned a : 1; /**< Accessed bit. */
155} pte_t;
156
157
158NO_TRACE static inline unsigned int get_pt_flags(pte_t *pt, size_t i)
159{
160 pte_t *p = &pt[i];
161
162 return ((p->cacheable << PAGE_CACHEABLE_SHIFT) |
163 ((!p->p) << PAGE_PRESENT_SHIFT) |
164 (1 << PAGE_USER_SHIFT) |
165 (1 << PAGE_READ_SHIFT) |
166 ((p->w) << PAGE_WRITE_SHIFT) |
167 (1 << PAGE_EXEC_SHIFT) |
168 (p->g << PAGE_GLOBAL_SHIFT));
169}
170
171NO_TRACE static inline void set_pt_flags(pte_t *pt, size_t i, int flags)
172{
173 pte_t *p = &pt[i];
174
175 p->cacheable = (flags & PAGE_CACHEABLE) != 0;
176 p->p = !(flags & PAGE_NOT_PRESENT);
177 p->g = (flags & PAGE_GLOBAL) != 0;
178 p->w = (flags & PAGE_WRITE) != 0;
179
180 /*
181 * Ensure that valid entries have at least one bit set.
182 */
183 p->soft_valid = 1;
184}
185
186extern void page_arch_init(void);
187
188#endif /* __ASM__ */
189
190#endif /* KERNEL */
191
192#endif
193
194/** @}
195 */
Note: See TracBrowser for help on using the repository browser.