Subversion Repositories HelenOS

Rev

Rev 2465 | Rev 3233 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

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