Subversion Repositories HelenOS-historic

Rev

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

Rev 195 Rev 226
1
/*
1
/*
2
 * Copyright (C) 2001-2004 Jakub Jermar
2
 * Copyright (C) 2001-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
#include <mm/page.h>
29
#include <mm/page.h>
30
#include <mm/frame.h>
30
#include <mm/frame.h>
31
#include <arch/mm/page.h>
31
#include <arch/mm/page.h>
32
#include <arch/types.h>
32
#include <arch/types.h>
33
#include <typedefs.h>
33
#include <typedefs.h>
34
#include <arch/asm.h>
34
#include <arch/asm.h>
35
#include <memstr.h>
35
#include <memstr.h>
36
 
36
 
37
 
37
 
38
void page_init(void)
38
void page_init(void)
39
{  
39
{
40
    page_arch_init();
40
    page_arch_init();
41
    map_page_to_frame(0x0, 0x0, PAGE_NOT_PRESENT, 0);
41
    map_page_to_frame(0x0, 0x0, PAGE_NOT_PRESENT, 0);
42
}
42
}
43
 
43
 
44
/** Map memory structure
44
/** Map memory structure
45
 *
45
 *
46
 * Identity-map memory structure
46
 * Identity-map memory structure
47
 * considering possible crossings
47
 * considering possible crossings
48
 * of page boundaries.
48
 * of page boundaries.
49
 *
49
 *
50
 * @param s Address of the structure.
50
 * @param s Address of the structure.
51
 * @param size Size of the structure.
51
 * @param size Size of the structure.
52
 */
52
 */
53
void map_structure(__address s, size_t size)
53
void map_structure(__address s, size_t size)
54
{
54
{
55
    int i, cnt, length;
55
    int i, cnt, length;
56
 
56
 
57
    /* TODO: implement portable way of computing page address from address */
-
 
58
    length = size + (s - (s & 0xfffff000));
57
    length = size + (s - (s & ~(PAGE_SIZE-1)));
59
    cnt = length/PAGE_SIZE + (length%PAGE_SIZE>0);
58
    cnt = length/PAGE_SIZE + (length%PAGE_SIZE>0);
60
 
59
 
61
    for (i = 0; i < cnt; i++)
60
    for (i = 0; i < cnt; i++)
62
        map_page_to_frame(s + i*PAGE_SIZE, s + i*PAGE_SIZE, PAGE_NOT_CACHEABLE, 0);
61
        map_page_to_frame(s + i*PAGE_SIZE, s + i*PAGE_SIZE, PAGE_NOT_CACHEABLE, 0);
63
 
62
 
64
}
63
}
65
 
64
 
66
/** Map page to frame
65
/** Map page to frame
67
 *
66
 *
68
 * Map virtual address 'page' to physical address 'frame'
67
 * Map virtual address 'page' to physical address 'frame'
69
 * using 'flags'. Allocate and setup any missing page tables.
68
 * using 'flags'. Allocate and setup any missing page tables.
70
 *
69
 *
71
 * @param page Virtual address of the page to be mapped.
70
 * @param page Virtual address of the page to be mapped.
72
 * @param frame Physical address of memory frame to which the mapping is done.
71
 * @param frame Physical address of memory frame to which the mapping is done.
73
 * @param flags Flags to be used for mapping.
72
 * @param flags Flags to be used for mapping.
74
 * @param root Explicit PTL0 address.
73
 * @param root Explicit PTL0 address.
75
 */
74
 */
76
void map_page_to_frame(__address page, __address frame, int flags, __address root)
75
void map_page_to_frame(__address page, __address frame, int flags, __address root)
77
{
76
{
78
    pte_t *ptl0, *ptl1, *ptl2, *ptl3;
77
    pte_t *ptl0, *ptl1, *ptl2, *ptl3;
79
    __address newpt;
78
    __address newpt;
80
 
79
 
81
    ptl0 = (pte_t *) PA2KA(root ? root : (__address) GET_PTL0_ADDRESS());
80
    ptl0 = (pte_t *) PA2KA(root ? root : (__address) GET_PTL0_ADDRESS());
82
 
81
 
83
    if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT) {
82
    if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT) {
84
        newpt = frame_alloc(FRAME_KA);
83
        newpt = frame_alloc(FRAME_KA);
85
        memsetb(newpt, PAGE_SIZE, 0);
84
        memsetb(newpt, PAGE_SIZE, 0);
86
        SET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page), KA2PA(newpt));
85
        SET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page), KA2PA(newpt));
87
        SET_PTL1_FLAGS(ptl0, PTL0_INDEX(page), PAGE_PRESENT | PAGE_USER);
86
        SET_PTL1_FLAGS(ptl0, PTL0_INDEX(page), PAGE_PRESENT | PAGE_USER);
88
    }
87
    }
89
 
88
 
90
    ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page)));
89
    ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page)));
91
 
90
 
92
    if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT) {
91
    if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT) {
93
        newpt = frame_alloc(FRAME_KA);
92
        newpt = frame_alloc(FRAME_KA);
94
        memsetb(newpt, PAGE_SIZE, 0);
93
        memsetb(newpt, PAGE_SIZE, 0);
95
        SET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page), KA2PA(newpt));
94
        SET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page), KA2PA(newpt));
96
        SET_PTL2_FLAGS(ptl1, PTL1_INDEX(page), PAGE_PRESENT | PAGE_USER);
95
        SET_PTL2_FLAGS(ptl1, PTL1_INDEX(page), PAGE_PRESENT | PAGE_USER);
97
    }
96
    }
98
 
97
 
99
    ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page)));
98
    ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page)));
100
 
99
 
101
    if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT) {
100
    if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT) {
102
        newpt = frame_alloc(FRAME_KA);
101
        newpt = frame_alloc(FRAME_KA);
103
        memsetb(newpt, PAGE_SIZE, 0);
102
        memsetb(newpt, PAGE_SIZE, 0);
104
        SET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page), KA2PA(newpt));
103
        SET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page), KA2PA(newpt));
105
        SET_PTL3_FLAGS(ptl2, PTL2_INDEX(page), PAGE_PRESENT | PAGE_USER);
104
        SET_PTL3_FLAGS(ptl2, PTL2_INDEX(page), PAGE_PRESENT | PAGE_USER);
106
    }
105
    }
107
 
106
 
108
    ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page)));
107
    ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page)));
109
 
108
 
110
    SET_FRAME_ADDRESS(ptl3, PTL3_INDEX(page), frame);
109
    SET_FRAME_ADDRESS(ptl3, PTL3_INDEX(page), frame);
111
    SET_FRAME_FLAGS(ptl3, PTL3_INDEX(page), flags);
110
    SET_FRAME_FLAGS(ptl3, PTL3_INDEX(page), flags);
112
}
111
}
113
 
112