Subversion Repositories HelenOS

Rev

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

Rev 2132 Rev 2134
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 genericmm
29
/** @addtogroup genericmm
30
 * @{
30
 * @{
31
 */
31
 */
32
 
32
 
33
/**
33
/**
34
 * @file
34
 * @file
35
 * @brief   Backend for anonymous memory address space areas.
35
 * @brief   Backend for anonymous memory address space areas.
36
 *
36
 *
37
 */
37
 */
38
 
38
 
39
#include <mm/as.h>
39
#include <mm/as.h>
40
#include <mm/page.h>
40
#include <mm/page.h>
41
#include <genarch/mm/page_pt.h>
41
#include <genarch/mm/page_pt.h>
42
#include <genarch/mm/page_ht.h>
42
#include <genarch/mm/page_ht.h>
43
#include <mm/frame.h>
43
#include <mm/frame.h>
44
#include <mm/slab.h>
44
#include <mm/slab.h>
45
#include <synch/mutex.h>
45
#include <synch/mutex.h>
46
#include <adt/list.h>
46
#include <adt/list.h>
47
#include <adt/btree.h>
47
#include <adt/btree.h>
48
#include <errno.h>
48
#include <errno.h>
49
#include <arch/types.h>
49
#include <arch/types.h>
50
#include <align.h>
50
#include <align.h>
51
#include <arch.h>
51
#include <arch.h>
52
 
52
 
53
#ifdef CONFIG_VIRT_IDX_DCACHE
53
#ifdef CONFIG_VIRT_IDX_DCACHE
54
#include <arch/mm/cache.h>
54
#include <arch/mm/cache.h>
55
#endif
55
#endif
56
 
56
 
57
static int anon_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access);
57
static int anon_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access);
58
static void anon_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame);
58
static void anon_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame);
59
static void anon_share(as_area_t *area);
59
static void anon_share(as_area_t *area);
60
 
60
 
61
mem_backend_t anon_backend = {
61
mem_backend_t anon_backend = {
62
    .page_fault = anon_page_fault,
62
    .page_fault = anon_page_fault,
63
    .frame_free = anon_frame_free,
63
    .frame_free = anon_frame_free,
64
    .share = anon_share
64
    .share = anon_share
65
};
65
};
66
 
66
 
67
/** Service a page fault in the anonymous memory address space area.
67
/** Service a page fault in the anonymous memory address space area.
68
 *
68
 *
69
 * The address space area and page tables must be already locked.
69
 * The address space area and page tables must be already locked.
70
 *
70
 *
71
 * @param area Pointer to the address space area.
71
 * @param area Pointer to the address space area.
72
 * @param addr Faulting virtual address.
72
 * @param addr Faulting virtual address.
73
 * @param access Access mode that caused the fault (i.e. read/write/exec).
73
 * @param access Access mode that caused the fault (i.e. read/write/exec).
74
 *
74
 *
75
 * @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK on success (i.e.
75
 * @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK on success (i.e.
76
 *     serviced).
76
 *     serviced).
77
 */
77
 */
78
int anon_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access)
78
int anon_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access)
79
{
79
{
80
    uintptr_t frame;
80
    uintptr_t frame;
-
 
81
    bool dirty = false;
81
 
82
 
82
    if (!as_area_check_access(area, access))
83
    if (!as_area_check_access(area, access))
83
        return AS_PF_FAULT;
84
        return AS_PF_FAULT;
84
 
85
 
85
    if (area->sh_info) {
86
    if (area->sh_info) {
86
        btree_node_t *leaf;
87
        btree_node_t *leaf;
87
       
88
       
88
        /*
89
        /*
89
         * The area is shared, chances are that the mapping can be found
90
         * The area is shared, chances are that the mapping can be found
90
         * in the pagemap of the address space area share info
91
         * in the pagemap of the address space area share info
91
         * structure.
92
         * structure.
92
         * In the case that the pagemap does not contain the respective
93
         * In the case that the pagemap does not contain the respective
93
         * mapping, a new frame is allocated and the mapping is created.
94
         * mapping, a new frame is allocated and the mapping is created.
94
         */
95
         */
95
        mutex_lock(&area->sh_info->lock);
96
        mutex_lock(&area->sh_info->lock);
96
        frame = (uintptr_t) btree_search(&area->sh_info->pagemap,
97
        frame = (uintptr_t) btree_search(&area->sh_info->pagemap,
97
            ALIGN_DOWN(addr, PAGE_SIZE) - area->base, &leaf);
98
            ALIGN_DOWN(addr, PAGE_SIZE) - area->base, &leaf);
98
        if (!frame) {
99
        if (!frame) {
99
            bool allocate = true;
100
            bool allocate = true;
100
            int i;
101
            int i;
101
           
102
           
102
            /*
103
            /*
103
             * Zero can be returned as a valid frame address.
104
             * Zero can be returned as a valid frame address.
104
             * Just a small workaround.
105
             * Just a small workaround.
105
             */
106
             */
106
            for (i = 0; i < leaf->keys; i++) {
107
            for (i = 0; i < leaf->keys; i++) {
107
                if (leaf->key[i] ==
108
                if (leaf->key[i] ==
108
                    ALIGN_DOWN(addr, PAGE_SIZE)) {
109
                    ALIGN_DOWN(addr, PAGE_SIZE)) {
109
                    allocate = false;
110
                    allocate = false;
110
                    break;
111
                    break;
111
                }
112
                }
112
            }
113
            }
113
            if (allocate) {
114
            if (allocate) {
114
                frame = (uintptr_t) frame_alloc(ONE_FRAME, 0);
115
                frame = (uintptr_t) frame_alloc(ONE_FRAME, 0);
115
                memsetb(PA2KA(frame), FRAME_SIZE, 0);
116
                memsetb(PA2KA(frame), FRAME_SIZE, 0);
-
 
117
                dirty = true;
116
               
118
               
117
                /*
119
                /*
118
                 * Insert the address of the newly allocated
120
                 * Insert the address of the newly allocated
119
                 * frame to the pagemap.
121
                 * frame to the pagemap.
120
                 */
122
                 */
121
                btree_insert(&area->sh_info->pagemap,
123
                btree_insert(&area->sh_info->pagemap,
122
                    ALIGN_DOWN(addr, PAGE_SIZE) - area->base,
124
                    ALIGN_DOWN(addr, PAGE_SIZE) - area->base,
123
                    (void *) frame, leaf);
125
                    (void *) frame, leaf);
124
            }
126
            }
125
        }
127
        }
126
        frame_reference_add(ADDR2PFN(frame));
128
        frame_reference_add(ADDR2PFN(frame));
127
        mutex_unlock(&area->sh_info->lock);
129
        mutex_unlock(&area->sh_info->lock);
128
    } else {
130
    } else {
129
 
131
 
130
        /*
132
        /*
131
         * In general, there can be several reasons that
133
         * In general, there can be several reasons that
132
         * can have caused this fault.
134
         * can have caused this fault.
133
         *
135
         *
134
         * - non-existent mapping: the area is an anonymous
136
         * - non-existent mapping: the area is an anonymous
135
         *   area (e.g. heap or stack) and so far has not been
137
         *   area (e.g. heap or stack) and so far has not been
136
         *   allocated a frame for the faulting page
138
         *   allocated a frame for the faulting page
137
         *
139
         *
138
         * - non-present mapping: another possibility,
140
         * - non-present mapping: another possibility,
139
         *   currently not implemented, would be frame
141
         *   currently not implemented, would be frame
140
         *   reuse; when this becomes a possibility,
142
         *   reuse; when this becomes a possibility,
141
         *   do not forget to distinguish between
143
         *   do not forget to distinguish between
142
         *   the different causes
144
         *   the different causes
143
         */
145
         */
144
        frame = (uintptr_t) frame_alloc(ONE_FRAME, 0);
146
        frame = (uintptr_t) frame_alloc(ONE_FRAME, 0);
145
        memsetb(PA2KA(frame), FRAME_SIZE, 0);
147
        memsetb(PA2KA(frame), FRAME_SIZE, 0);
-
 
148
        dirty = true;
146
    }
149
    }
147
   
150
   
148
    /*
151
    /*
149
     * Map 'page' to 'frame'.
152
     * Map 'page' to 'frame'.
150
     * Note that TLB shootdown is not attempted as only new information is
153
     * Note that TLB shootdown is not attempted as only new information is
151
     * being inserted into page tables.
154
     * being inserted into page tables.
152
     */
155
     */
153
    page_mapping_insert(AS, addr, frame, as_area_get_flags(area));
156
    page_mapping_insert(AS, addr, frame, as_area_get_flags(area));
154
    if (!used_space_insert(area, ALIGN_DOWN(addr, PAGE_SIZE), 1))
157
    if (!used_space_insert(area, ALIGN_DOWN(addr, PAGE_SIZE), 1))
155
        panic("Could not insert used space.\n");
158
        panic("Could not insert used space.\n");
156
       
159
       
-
 
160
#ifdef CONFIG_VIRT_IDX_DCACHE
-
 
161
    if (dirty && PAGE_COLOR(PA2KA(frame)) != PAGE_COLOR(addr)) {
-
 
162
        /*
-
 
163
         * By writing to the frame using kernel virtual address,
-
 
164
         * we have created an illegal virtual alias. We now have to
-
 
165
         * invalidate cachelines belonging to addr on all processors
-
 
166
         * so that they will be reloaded with the new content on next
-
 
167
         * read.
-
 
168
         */
-
 
169
        dcache_flush_frame(addr, frame);
-
 
170
        dcache_shootdown_start(DCACHE_INVL_FRAME, PAGE_COLOR(addr), frame);
-
 
171
        dcache_shootdown_finalize();
-
 
172
    }
-
 
173
#endif
-
 
174
 
157
    return AS_PF_OK;
175
    return AS_PF_OK;
158
}
176
}
159
 
177
 
160
/** Free a frame that is backed by the anonymous memory backend.
178
/** Free a frame that is backed by the anonymous memory backend.
161
 *
179
 *
162
 * The address space area and page tables must be already locked.
180
 * The address space area and page tables must be already locked.
163
 *
181
 *
164
 * @param area Ignored.
182
 * @param area Ignored.
165
 * @param page Virtual address of the page corresponding to the frame.
183
 * @param page Virtual address of the page corresponding to the frame.
166
 * @param frame Frame to be released.
184
 * @param frame Frame to be released.
167
 */
185
 */
168
void anon_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame)
186
void anon_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame)
169
{
187
{
170
    frame_free(frame);
188
    frame_free(frame);
171
#ifdef CONFIG_VIRT_IDX_DCACHE
-
 
172
    dcache_flush_frame(page, frame);
-
 
173
#endif
-
 
174
}
189
}
175
 
190
 
176
/** Share the anonymous address space area.
191
/** Share the anonymous address space area.
177
 *
192
 *
178
 * Sharing of anonymous area is done by duplicating its entire mapping
193
 * Sharing of anonymous area is done by duplicating its entire mapping
179
 * to the pagemap. Page faults will primarily search for frames there.
194
 * to the pagemap. Page faults will primarily search for frames there.
180
 *
195
 *
181
 * The address space and address space area must be already locked.
196
 * The address space and address space area must be already locked.
182
 *
197
 *
183
 * @param area Address space area to be shared.
198
 * @param area Address space area to be shared.
184
 */
199
 */
185
void anon_share(as_area_t *area)
200
void anon_share(as_area_t *area)
186
{
201
{
187
    link_t *cur;
202
    link_t *cur;
188
 
203
 
189
    /*
204
    /*
190
     * Copy used portions of the area to sh_info's page map.
205
     * Copy used portions of the area to sh_info's page map.
191
     */
206
     */
192
    mutex_lock(&area->sh_info->lock);
207
    mutex_lock(&area->sh_info->lock);
193
    for (cur = area->used_space.leaf_head.next;
208
    for (cur = area->used_space.leaf_head.next;
194
        cur != &area->used_space.leaf_head; cur = cur->next) {
209
        cur != &area->used_space.leaf_head; cur = cur->next) {
195
        btree_node_t *node;
210
        btree_node_t *node;
196
        int i;
211
        int i;
197
       
212
       
198
        node = list_get_instance(cur, btree_node_t, leaf_link);
213
        node = list_get_instance(cur, btree_node_t, leaf_link);
199
        for (i = 0; i < node->keys; i++) {
214
        for (i = 0; i < node->keys; i++) {
200
            uintptr_t base = node->key[i];
215
            uintptr_t base = node->key[i];
201
            count_t count = (count_t) node->value[i];
216
            count_t count = (count_t) node->value[i];
202
            int j;
217
            int j;
203
           
218
           
204
            for (j = 0; j < count; j++) {
219
            for (j = 0; j < count; j++) {
205
                pte_t *pte;
220
                pte_t *pte;
206
           
221
           
207
                page_table_lock(area->as, false);
222
                page_table_lock(area->as, false);
208
                pte = page_mapping_find(area->as,
223
                pte = page_mapping_find(area->as,
209
                    base + j * PAGE_SIZE);
224
                    base + j * PAGE_SIZE);
210
                ASSERT(pte && PTE_VALID(pte) &&
225
                ASSERT(pte && PTE_VALID(pte) &&
211
                    PTE_PRESENT(pte));
226
                    PTE_PRESENT(pte));
212
                btree_insert(&area->sh_info->pagemap,
227
                btree_insert(&area->sh_info->pagemap,
213
                    (base + j * PAGE_SIZE) - area->base,
228
                    (base + j * PAGE_SIZE) - area->base,
214
                    (void *) PTE_GET_FRAME(pte), NULL);
229
                    (void *) PTE_GET_FRAME(pte), NULL);
215
                page_table_unlock(area->as, false);
230
                page_table_unlock(area->as, false);
216
 
231
 
217
                pfn_t pfn = ADDR2PFN(PTE_GET_FRAME(pte));
232
                pfn_t pfn = ADDR2PFN(PTE_GET_FRAME(pte));
218
                frame_reference_add(pfn);
233
                frame_reference_add(pfn);
219
            }
234
            }
220
               
235
 
221
        }
236
        }
222
    }
237
    }
223
    mutex_unlock(&area->sh_info->lock);
238
    mutex_unlock(&area->sh_info->lock);
224
}
239
}
225
 
240
 
226
/** @}
241
/** @}
227
 */
242
 */
228
 
243
 
229
 
244