Rev 121 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1 | jermar | 1 | /* |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
||
3 | * All rights reserved. |
||
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
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 |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
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 |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
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 |
||
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 |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
29 | #include <mm/vm.h> |
||
30 | #include <mm/page.h> |
||
31 | #include <mm/frame.h> |
||
5 | jermar | 32 | #include <mm/tlb.h> |
35 | jermar | 33 | #include <mm/heap.h> |
1 | jermar | 34 | #include <arch/mm/page.h> |
35 | #include <arch/types.h> |
||
36 | #include <typedefs.h> |
||
37 | #include <synch/spinlock.h> |
||
38 | #include <config.h> |
||
39 | #include <list.h> |
||
40 | #include <panic.h> |
||
115 | jermar | 41 | #include <arch/asm.h> |
167 | jermar | 42 | #include <debug.h> |
1 | jermar | 43 | |
167 | jermar | 44 | #define KAS_START_INDEX PTL0_INDEX(KERNEL_ADDRESS_SPACE_START) |
45 | #define KAS_END_INDEX PTL0_INDEX(KERNEL_ADDRESS_SPACE_END) |
||
46 | #define KAS_INDICES (1+(KAS_END_INDEX-KAS_START_INDEX)) |
||
47 | |||
48 | vm_t *vm_create(pte_t *ptl0) |
||
1 | jermar | 49 | { |
50 | vm_t *m; |
||
51 | |||
52 | m = (vm_t *) malloc(sizeof(vm_t)); |
||
53 | if (m) { |
||
54 | spinlock_initialize(&m->lock); |
||
55 | list_initialize(&m->vm_area_head); |
||
167 | jermar | 56 | |
57 | /* |
||
58 | * Each vm_t is supposed to have its own page table. |
||
59 | * It is either passed one or it has to allocate and set one up. |
||
60 | */ |
||
61 | if (!(m->ptl0 = ptl0)) { |
||
62 | pte_t *src_ptl0, *dst_ptl0; |
||
63 | |||
64 | src_ptl0 = (pte_t *) PA2KA(GET_PTL0_ADDRESS()); |
||
65 | dst_ptl0 = (pte_t *) frame_alloc(FRAME_KA | FRAME_PANIC); |
||
66 | memsetb((__address) dst_ptl0, PAGE_SIZE, 0); |
||
67 | memcopy((__address) &src_ptl0[KAS_START_INDEX], (__address) &dst_ptl0[KAS_START_INDEX], KAS_INDICES*sizeof(pte_t)); |
||
68 | m->ptl0 = (pte_t *) KA2PA(dst_ptl0); |
||
69 | } |
||
1 | jermar | 70 | } |
71 | |||
72 | return m; |
||
73 | } |
||
74 | |||
75 | void vm_destroy(vm_t *m) |
||
76 | { |
||
77 | } |
||
78 | |||
72 | decky | 79 | vm_area_t *vm_area_create(vm_t *m, vm_type_t type, size_t size, __address addr) |
1 | jermar | 80 | { |
81 | pri_t pri; |
||
82 | vm_area_t *a; |
||
83 | |||
84 | if (addr % PAGE_SIZE) |
||
68 | decky | 85 | panic("addr not aligned to a page boundary"); |
1 | jermar | 86 | |
87 | pri = cpu_priority_high(); |
||
88 | spinlock_lock(&m->lock); |
||
89 | |||
90 | /* |
||
91 | * TODO: test vm_area which is to be created doesn't overlap with an existing one. |
||
92 | */ |
||
93 | |||
94 | a = (vm_area_t *) malloc(sizeof(vm_area_t)); |
||
95 | if (a) { |
||
96 | int i; |
||
97 | |||
98 | a->mapping = (__address *) malloc(size * sizeof(__address)); |
||
99 | if (!a->mapping) { |
||
100 | free(a); |
||
101 | spinlock_unlock(&m->lock); |
||
102 | cpu_priority_restore(pri); |
||
103 | return NULL; |
||
104 | } |
||
105 | |||
106 | for (i=0; i<size; i++) |
||
107 | a->mapping[i] = frame_alloc(0); |
||
108 | |||
109 | spinlock_initialize(&a->lock); |
||
110 | |||
111 | link_initialize(&a->link); |
||
112 | a->type = type; |
||
113 | a->size = size; |
||
114 | a->address = addr; |
||
115 | |||
116 | list_append(&a->link, &m->vm_area_head); |
||
117 | |||
118 | } |
||
119 | |||
120 | spinlock_unlock(&m->lock); |
||
121 | cpu_priority_restore(pri); |
||
122 | |||
123 | return a; |
||
124 | } |
||
125 | |||
126 | void vm_area_destroy(vm_area_t *a) |
||
127 | { |
||
128 | } |
||
129 | |||
167 | jermar | 130 | void vm_area_map(vm_area_t *a, vm_t *m) |
1 | jermar | 131 | { |
132 | int i, flags; |
||
133 | pri_t pri; |
||
134 | |||
135 | pri = cpu_priority_high(); |
||
167 | jermar | 136 | spinlock_lock(&m->lock); |
1 | jermar | 137 | spinlock_lock(&a->lock); |
138 | |||
139 | switch (a->type) { |
||
140 | case VMA_TEXT: |
||
141 | flags = PAGE_EXEC | PAGE_READ | PAGE_USER | PAGE_PRESENT | PAGE_CACHEABLE; |
||
142 | break; |
||
143 | case VMA_DATA: |
||
144 | case VMA_STACK: |
||
145 | flags = PAGE_READ | PAGE_WRITE | PAGE_USER | PAGE_PRESENT | PAGE_CACHEABLE; |
||
146 | break; |
||
147 | default: |
||
167 | jermar | 148 | panic("unexpected vm_type_t %d", a->type); |
1 | jermar | 149 | } |
167 | jermar | 150 | |
151 | ASSERT(m->ptl0); |
||
1 | jermar | 152 | for (i=0; i<a->size; i++) |
167 | jermar | 153 | map_page_to_frame(a->address + i*PAGE_SIZE, a->mapping[i], flags, (__address) m->ptl0); |
1 | jermar | 154 | |
155 | spinlock_unlock(&a->lock); |
||
167 | jermar | 156 | spinlock_unlock(&m->lock); |
1 | jermar | 157 | cpu_priority_restore(pri); |
158 | } |
||
159 | |||
167 | jermar | 160 | void vm_area_unmap(vm_area_t *a, vm_t *m) |
1 | jermar | 161 | { |
162 | int i; |
||
163 | pri_t pri; |
||
164 | |||
165 | pri = cpu_priority_high(); |
||
167 | jermar | 166 | spinlock_lock(&m->lock); |
1 | jermar | 167 | spinlock_lock(&a->lock); |
168 | |||
167 | jermar | 169 | ASSERT(m->ptl0); |
1 | jermar | 170 | for (i=0; i<a->size; i++) |
167 | jermar | 171 | map_page_to_frame(a->address + i*PAGE_SIZE, 0, PAGE_NOT_PRESENT, (__address) m->ptl0); |
5 | jermar | 172 | |
1 | jermar | 173 | spinlock_unlock(&a->lock); |
167 | jermar | 174 | spinlock_unlock(&m->lock); |
1 | jermar | 175 | cpu_priority_restore(pri); |
176 | } |
||
177 | |||
178 | void vm_install(vm_t *m) |
||
179 | { |
||
180 | link_t *l; |
||
181 | pri_t pri; |
||
182 | |||
183 | pri = cpu_priority_high(); |
||
184 | |||
6 | jermar | 185 | tlb_shootdown_start(); |
1 | jermar | 186 | spinlock_lock(&m->lock); |
187 | |||
167 | jermar | 188 | ASSERT(m->ptl0); |
189 | SET_PTL0_ADDRESS(m->ptl0); |
||
1 | jermar | 190 | |
191 | spinlock_unlock(&m->lock); |
||
6 | jermar | 192 | tlb_shootdown_finalize(); |
5 | jermar | 193 | |
1 | jermar | 194 | cpu_priority_restore(pri); |
195 | } |