Subversion Repositories HelenOS

Rev

Rev 3104 | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 3104 Rev 3240
1
/*
1
/*
2
 * Copyright (c) 2006 Jakub Jermar
2
 * Copyright (c) 2006 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 genarchmm
29
/** @addtogroup genarchmm
30
 * @{
30
 * @{
31
 */
31
 */
32
 
32
 
33
/**
33
/**
34
 * @file
34
 * @file
35
 * @brief   Address space functions for 4-level hierarchical pagetables.
35
 * @brief   Address space functions for 4-level hierarchical pagetables.
36
 */
36
 */
37
 
37
 
38
#include <genarch/mm/page_pt.h>
38
#include <genarch/mm/page_pt.h>
39
#include <mm/page.h>
39
#include <mm/page.h>
40
#include <mm/frame.h>
40
#include <mm/frame.h>
41
#include <mm/as.h>
41
#include <mm/as.h>
42
#include <synch/mutex.h>
42
#include <synch/mutex.h>
43
#include <arch/mm/page.h>
43
#include <arch/mm/page.h>
44
#include <arch/mm/as.h>
44
#include <arch/mm/as.h>
45
#include <arch/types.h>
45
#include <arch/types.h>
46
#include <memstr.h>
46
#include <memstr.h>
47
#include <arch.h>
47
#include <arch.h>
48
 
48
 
49
static pte_t *ptl0_create(int flags);
49
static pte_t *ptl0_create(int flags);
50
static void ptl0_destroy(pte_t *page_table);
50
static void ptl0_destroy(pte_t *page_table);
51
 
51
 
52
static void pt_lock(as_t *as, bool lock);
52
static void pt_lock(as_t *as, bool lock);
53
static void pt_unlock(as_t *as, bool unlock);
53
static void pt_unlock(as_t *as, bool unlock);
54
 
54
 
55
#ifdef __OBJC__
-
 
56
@implementation as_t
-
 
57
 
-
 
58
+ (pte_t *) page_table_create: (int) flags
-
 
59
{
-
 
60
    return ptl0_create(flags);
-
 
61
}
-
 
62
 
-
 
63
+ (void) page_table_destroy: (pte_t *) page_table
-
 
64
{
-
 
65
    ptl0_destroy(page_table);
-
 
66
}
-
 
67
 
-
 
68
- (void) page_table_lock: (bool) _lock
-
 
69
{
-
 
70
    pt_lock(self, _lock);
-
 
71
}
-
 
72
 
-
 
73
- (void) page_table_unlock: (bool) unlock
-
 
74
{
-
 
75
    pt_unlock(self, unlock);
-
 
76
}
-
 
77
 
-
 
78
@end
-
 
79
#else
-
 
80
as_operations_t as_pt_operations = {
55
as_operations_t as_pt_operations = {
81
    .page_table_create = ptl0_create,
56
    .page_table_create = ptl0_create,
82
    .page_table_destroy = ptl0_destroy,
57
    .page_table_destroy = ptl0_destroy,
83
    .page_table_lock = pt_lock,
58
    .page_table_lock = pt_lock,
84
    .page_table_unlock = pt_unlock
59
    .page_table_unlock = pt_unlock
85
};
60
};
86
#endif
-
 
87
 
61
 
88
/** Create PTL0.
62
/** Create PTL0.
89
 *
63
 *
90
 * PTL0 of 4-level page table will be created for each address space.
64
 * PTL0 of 4-level page table will be created for each address space.
91
 *
65
 *
92
 * @param flags Flags can specify whether ptl0 is for the kernel address space.
66
 * @param flags Flags can specify whether ptl0 is for the kernel address space.
93
 *
67
 *
94
 * @return New PTL0.
68
 * @return New PTL0.
95
 */
69
 */
96
pte_t *ptl0_create(int flags)
70
pte_t *ptl0_create(int flags)
97
{
71
{
98
    pte_t *src_ptl0, *dst_ptl0;
72
    pte_t *src_ptl0, *dst_ptl0;
99
    ipl_t ipl;
73
    ipl_t ipl;
100
    int table_size;
74
    int table_size;
101
 
75
 
102
    dst_ptl0 = (pte_t *) frame_alloc(PTL0_SIZE, FRAME_KA);
76
    dst_ptl0 = (pte_t *) frame_alloc(PTL0_SIZE, FRAME_KA);
103
    table_size = FRAME_SIZE << PTL0_SIZE;
77
    table_size = FRAME_SIZE << PTL0_SIZE;
104
 
78
 
105
    if (flags & FLAG_AS_KERNEL) {
79
    if (flags & FLAG_AS_KERNEL) {
106
        memsetb(dst_ptl0, table_size, 0);
80
        memsetb(dst_ptl0, table_size, 0);
107
    } else {
81
    } else {
108
        uintptr_t src, dst;
82
        uintptr_t src, dst;
109
   
83
   
110
        /*
84
        /*
111
         * Copy the kernel address space portion to new PTL0.
85
         * Copy the kernel address space portion to new PTL0.
112
         */
86
         */
113
         
87
         
114
        ipl = interrupts_disable();
88
        ipl = interrupts_disable();
115
        mutex_lock(&AS_KERNEL->lock);      
89
        mutex_lock(&AS_KERNEL->lock);      
116
        src_ptl0 = (pte_t *) PA2KA((uintptr_t) AS_KERNEL->genarch.page_table);
90
        src_ptl0 = (pte_t *) PA2KA((uintptr_t) AS_KERNEL->genarch.page_table);
117
 
91
 
118
        src = (uintptr_t) &src_ptl0[PTL0_INDEX(KERNEL_ADDRESS_SPACE_START)];
92
        src = (uintptr_t) &src_ptl0[PTL0_INDEX(KERNEL_ADDRESS_SPACE_START)];
119
        dst = (uintptr_t) &dst_ptl0[PTL0_INDEX(KERNEL_ADDRESS_SPACE_START)];
93
        dst = (uintptr_t) &dst_ptl0[PTL0_INDEX(KERNEL_ADDRESS_SPACE_START)];
120
 
94
 
121
        memsetb(dst_ptl0, table_size, 0);
95
        memsetb(dst_ptl0, table_size, 0);
122
        memcpy((void *) dst, (void *) src, table_size - (src - (uintptr_t) src_ptl0));
96
        memcpy((void *) dst, (void *) src, table_size - (src - (uintptr_t) src_ptl0));
123
        mutex_unlock(&AS_KERNEL->lock);
97
        mutex_unlock(&AS_KERNEL->lock);
124
        interrupts_restore(ipl);
98
        interrupts_restore(ipl);
125
    }
99
    }
126
 
100
 
127
    return (pte_t *) KA2PA((uintptr_t) dst_ptl0);
101
    return (pte_t *) KA2PA((uintptr_t) dst_ptl0);
128
}
102
}
129
 
103
 
130
/** Destroy page table.
104
/** Destroy page table.
131
 *
105
 *
132
 * Destroy PTL0, other levels are expected to be already deallocated.
106
 * Destroy PTL0, other levels are expected to be already deallocated.
133
 *
107
 *
134
 * @param page_table Physical address of PTL0.
108
 * @param page_table Physical address of PTL0.
135
 */
109
 */
136
void ptl0_destroy(pte_t *page_table)
110
void ptl0_destroy(pte_t *page_table)
137
{
111
{
138
    frame_free((uintptr_t)page_table);
112
    frame_free((uintptr_t)page_table);
139
}
113
}
140
 
114
 
141
/** Lock page tables.
115
/** Lock page tables.
142
 *
116
 *
143
 * Lock only the address space.
117
 * Lock only the address space.
144
 * Interrupts must be disabled.
118
 * Interrupts must be disabled.
145
 *
119
 *
146
 * @param as Address space.
120
 * @param as Address space.
147
 * @param lock If false, do not attempt to lock the address space.
121
 * @param lock If false, do not attempt to lock the address space.
148
 */
122
 */
149
void pt_lock(as_t *as, bool lock)
123
void pt_lock(as_t *as, bool lock)
150
{
124
{
151
    if (lock)
125
    if (lock)
152
        mutex_lock(&as->lock);
126
        mutex_lock(&as->lock);
153
}
127
}
154
 
128
 
155
/** Unlock page tables.
129
/** Unlock page tables.
156
 *
130
 *
157
 * Unlock the address space.
131
 * Unlock the address space.
158
 * Interrupts must be disabled.
132
 * Interrupts must be disabled.
159
 *
133
 *
160
 * @param as Address space.
134
 * @param as Address space.
161
 * @param unlock If false, do not attempt to unlock the address space.
135
 * @param unlock If false, do not attempt to unlock the address space.
162
 */
136
 */
163
void pt_unlock(as_t *as, bool unlock)
137
void pt_unlock(as_t *as, bool unlock)
164
{
138
{
165
    if (unlock)
139
    if (unlock)
166
        mutex_unlock(&as->lock);
140
        mutex_unlock(&as->lock);
167
}
141
}
168
 
142
 
169
/** @}
143
/** @}
170
 */
144
 */
171
 
145