Subversion Repositories HelenOS

Rev

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

Rev 2106 Rev 2125
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
55
as_operations_t as_pt_operations = {
80
as_operations_t as_pt_operations = {
56
    .page_table_create = ptl0_create,
81
    .page_table_create = ptl0_create,
57
    .page_table_destroy = ptl0_destroy,
82
    .page_table_destroy = ptl0_destroy,
58
    .page_table_lock = pt_lock,
83
    .page_table_lock = pt_lock,
59
    .page_table_unlock = pt_unlock
84
    .page_table_unlock = pt_unlock
60
};
85
};
-
 
86
#endif
61
 
87
 
62
/** Create PTL0.
88
/** Create PTL0.
63
 *
89
 *
64
 * PTL0 of 4-level page table will be created for each address space.
90
 * PTL0 of 4-level page table will be created for each address space.
65
 *
91
 *
66
 * @param flags Flags can specify whether ptl0 is for the kernel address space.
92
 * @param flags Flags can specify whether ptl0 is for the kernel address space.
67
 *
93
 *
68
 * @return New PTL0.
94
 * @return New PTL0.
69
 */
95
 */
70
pte_t *ptl0_create(int flags)
96
pte_t *ptl0_create(int flags)
71
{
97
{
72
    pte_t *src_ptl0, *dst_ptl0;
98
    pte_t *src_ptl0, *dst_ptl0;
73
    ipl_t ipl;
99
    ipl_t ipl;
74
 
100
 
75
    dst_ptl0 = (pte_t *) frame_alloc(ONE_FRAME, FRAME_KA);
101
    dst_ptl0 = (pte_t *) frame_alloc(ONE_FRAME, FRAME_KA);
76
 
102
 
77
    if (flags & FLAG_AS_KERNEL) {
103
    if (flags & FLAG_AS_KERNEL) {
78
        memsetb((uintptr_t) dst_ptl0, PAGE_SIZE, 0);
104
        memsetb((uintptr_t) dst_ptl0, PAGE_SIZE, 0);
79
    } else {
105
    } else {
80
        uintptr_t src, dst;
106
        uintptr_t src, dst;
81
   
107
   
82
        /*
108
        /*
83
         * Copy the kernel address space portion to new PTL0.
109
         * Copy the kernel address space portion to new PTL0.
84
         */
110
         */
85
         
111
         
86
        ipl = interrupts_disable();
112
        ipl = interrupts_disable();
87
        mutex_lock(&AS_KERNEL->lock);      
113
        mutex_lock(&AS_KERNEL->lock);      
88
        src_ptl0 = (pte_t *) PA2KA((uintptr_t) AS_KERNEL->genarch.page_table);
114
        src_ptl0 = (pte_t *) PA2KA((uintptr_t) AS_KERNEL->genarch.page_table);
89
 
115
 
90
        src = (uintptr_t) &src_ptl0[PTL0_INDEX(KERNEL_ADDRESS_SPACE_START)];
116
        src = (uintptr_t) &src_ptl0[PTL0_INDEX(KERNEL_ADDRESS_SPACE_START)];
91
        dst = (uintptr_t) &dst_ptl0[PTL0_INDEX(KERNEL_ADDRESS_SPACE_START)];
117
        dst = (uintptr_t) &dst_ptl0[PTL0_INDEX(KERNEL_ADDRESS_SPACE_START)];
92
 
118
 
93
        memsetb((uintptr_t) dst_ptl0, PAGE_SIZE, 0);
119
        memsetb((uintptr_t) dst_ptl0, PAGE_SIZE, 0);
94
        memcpy((void *) dst, (void *) src, PAGE_SIZE - (src - (uintptr_t) src_ptl0));
120
        memcpy((void *) dst, (void *) src, PAGE_SIZE - (src - (uintptr_t) src_ptl0));
95
        mutex_unlock(&AS_KERNEL->lock);
121
        mutex_unlock(&AS_KERNEL->lock);
96
        interrupts_restore(ipl);
122
        interrupts_restore(ipl);
97
    }
123
    }
98
 
124
 
99
    return (pte_t *) KA2PA((uintptr_t) dst_ptl0);
125
    return (pte_t *) KA2PA((uintptr_t) dst_ptl0);
100
}
126
}
101
 
127
 
102
/** Destroy page table.
128
/** Destroy page table.
103
 *
129
 *
104
 * Destroy PTL0, other levels are expected to be already deallocated.
130
 * Destroy PTL0, other levels are expected to be already deallocated.
105
 *
131
 *
106
 * @param page_table Physical address of PTL0.
132
 * @param page_table Physical address of PTL0.
107
 */
133
 */
108
void ptl0_destroy(pte_t *page_table)
134
void ptl0_destroy(pte_t *page_table)
109
{
135
{
110
    frame_free((uintptr_t)page_table);
136
    frame_free((uintptr_t)page_table);
111
}
137
}
112
 
138
 
113
/** Lock page tables.
139
/** Lock page tables.
114
 *
140
 *
115
 * Lock only the address space.
141
 * Lock only the address space.
116
 * Interrupts must be disabled.
142
 * Interrupts must be disabled.
117
 *
143
 *
118
 * @param as Address space.
144
 * @param as Address space.
119
 * @param lock If false, do not attempt to lock the address space.
145
 * @param lock If false, do not attempt to lock the address space.
120
 */
146
 */
121
void pt_lock(as_t *as, bool lock)
147
void pt_lock(as_t *as, bool lock)
122
{
148
{
123
    if (lock)
149
    if (lock)
124
        mutex_lock(&as->lock);
150
        mutex_lock(&as->lock);
125
}
151
}
126
 
152
 
127
/** Unlock page tables.
153
/** Unlock page tables.
128
 *
154
 *
129
 * Unlock the address space.
155
 * Unlock the address space.
130
 * Interrupts must be disabled.
156
 * Interrupts must be disabled.
131
 *
157
 *
132
 * @param as Address space.
158
 * @param as Address space.
133
 * @param unlock If false, do not attempt to unlock the address space.
159
 * @param unlock If false, do not attempt to unlock the address space.
134
 */
160
 */
135
void pt_unlock(as_t *as, bool unlock)
161
void pt_unlock(as_t *as, bool unlock)
136
{
162
{
137
    if (unlock)
163
    if (unlock)
138
        mutex_unlock(&as->lock);
164
        mutex_unlock(&as->lock);
139
}
165
}
140
 
166
 
141
/** @}
167
/** @}
142
 */
168
 */
143
 
169