Rev 746 | Rev 756 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 746 | Rev 755 | ||
---|---|---|---|
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 | #include <genarch/mm/page_ht.h> |
29 | #include <genarch/mm/page_ht.h> |
30 | #include <mm/page.h> |
30 | #include <mm/page.h> |
31 | #include <mm/frame.h> |
31 | #include <mm/frame.h> |
32 | #include <mm/heap.h> |
32 | #include <mm/heap.h> |
- | 33 | #include <mm/as.h> |
|
33 | #include <arch/mm/asid.h> |
34 | #include <arch/mm/asid.h> |
34 | #include <arch/types.h> |
35 | #include <arch/types.h> |
35 | #include <typedefs.h> |
36 | #include <typedefs.h> |
36 | #include <arch/asm.h> |
37 | #include <arch/asm.h> |
37 | #include <synch/spinlock.h> |
38 | #include <synch/spinlock.h> |
38 | #include <arch.h> |
39 | #include <arch.h> |
39 | #include <debug.h> |
40 | #include <debug.h> |
40 | 41 | ||
41 | /** |
42 | /** |
42 | * This lock protects the page hash table. Note that software must |
43 | * This lock protects the page hash table. Note that software must |
43 | * be still careful about ordering of writes to ensure consistent |
44 | * be still careful about ordering of writes to ensure consistent |
44 | * view of the page hash table for hardware helpers such as VHPT |
45 | * view of the page hash table for hardware helpers such as VHPT |
45 | * walker on ia64. |
46 | * walker on ia64. |
46 | */ |
47 | */ |
47 | SPINLOCK_INITIALIZE(page_ht_lock); |
48 | SPINLOCK_INITIALIZE(page_ht_lock); |
48 | 49 | ||
49 | /** |
50 | /** |
50 | * Page hash table pointer. |
51 | * Page hash table pointer. |
51 | * The page hash table may be accessed only when page_ht_lock is held. |
52 | * The page hash table may be accessed only when page_ht_lock is held. |
52 | */ |
53 | */ |
53 | pte_t *page_ht = NULL; |
54 | pte_t *page_ht = NULL; |
54 | 55 | ||
55 | static void ht_mapping_insert(__address page, asid_t asid, __address frame, int flags, __address root); |
56 | static void ht_mapping_insert(as_t *as, __address page, __address frame, int flags, __address root); |
56 | static pte_t *ht_mapping_find(__address page, asid_t asid, __address root); |
57 | static pte_t *ht_mapping_find(as_t *as, __address page, __address root); |
57 | 58 | ||
58 | page_operations_t page_ht_operations = { |
59 | page_operations_t page_ht_operations = { |
59 | .mapping_insert = ht_mapping_insert, |
60 | .mapping_insert = ht_mapping_insert, |
60 | .mapping_find = ht_mapping_find |
61 | .mapping_find = ht_mapping_find |
61 | }; |
62 | }; |
62 | 63 | ||
63 | /** Map page to frame using page hash table. |
64 | /** Map page to frame using page hash table. |
64 | * |
65 | * |
65 | * Map virtual address 'page' to physical address 'frame' |
66 | * Map virtual address 'page' to physical address 'frame' |
66 | * using 'flags'. In order not to disturb hardware searching, |
67 | * using 'flags'. In order not to disturb hardware searching, |
67 | * new mappings are appended to the end of the collision |
68 | * new mappings are appended to the end of the collision |
68 | * chain. |
69 | * chain. |
69 | * |
70 | * |
- | 71 | * @param as Address space to which page belongs. Must be locked prior the call. |
|
70 | * @param page Virtual address of the page to be mapped. |
72 | * @param page Virtual address of the page to be mapped. |
71 | * @param asid Address space to which page belongs. |
- | |
72 | * @param frame Physical address of memory frame to which the mapping is done. |
73 | * @param frame Physical address of memory frame to which the mapping is done. |
73 | * @param flags Flags to be used for mapping. |
74 | * @param flags Flags to be used for mapping. |
74 | * @param root Ignored. |
75 | * @param root Ignored. |
75 | */ |
76 | */ |
76 | void ht_mapping_insert(__address page, asid_t asid, __address frame, int flags, __address root) |
77 | void ht_mapping_insert(as_t *as, __address page, __address frame, int flags, __address root) |
77 | { |
78 | { |
78 | pte_t *t, *u; |
79 | pte_t *t, *u; |
79 | ipl_t ipl; |
80 | ipl_t ipl; |
80 | 81 | ||
81 | ipl = interrupts_disable(); |
82 | ipl = interrupts_disable(); |
82 | spinlock_lock(&page_ht_lock); |
83 | spinlock_lock(&page_ht_lock); |
83 | 84 | ||
84 | t = HT_HASH(page, asid); |
85 | t = HT_HASH(page, as->asid); |
85 | if (!HT_SLOT_EMPTY(t)) { |
86 | if (!HT_SLOT_EMPTY(t)) { |
86 | 87 | ||
87 | /* |
88 | /* |
88 | * The slot is occupied. |
89 | * The slot is occupied. |
89 | * Walk through the collision chain and append the mapping to its end. |
90 | * Walk through the collision chain and append the mapping to its end. |
90 | */ |
91 | */ |
91 | 92 | ||
92 | do { |
93 | do { |
93 | u = t; |
94 | u = t; |
94 | if (HT_COMPARE(page, asid, t)) { |
95 | if (HT_COMPARE(page, as->asid, t)) { |
95 | /* |
96 | /* |
96 | * Nothing to do, |
97 | * Nothing to do, |
97 | * the record is already there. |
98 | * the record is already there. |
98 | */ |
99 | */ |
99 | spinlock_unlock(&page_ht_lock); |
100 | spinlock_unlock(&page_ht_lock); |
100 | interrupts_restore(ipl); |
101 | interrupts_restore(ipl); |
101 | return; |
102 | return; |
102 | } |
103 | } |
103 | } while ((t = HT_GET_NEXT(t))); |
104 | } while ((t = HT_GET_NEXT(t))); |
104 | 105 | ||
105 | t = (pte_t *) malloc(sizeof(pte_t)); /* FIXME: use slab allocator for this */ |
106 | t = (pte_t *) malloc(sizeof(pte_t)); /* FIXME: use slab allocator for this */ |
106 | if (!t) |
107 | if (!t) |
107 | panic("could not allocate memory\n"); |
108 | panic("could not allocate memory\n"); |
108 | 109 | ||
109 | HT_SET_NEXT(u, t); |
110 | HT_SET_NEXT(u, t); |
110 | } |
111 | } |
111 | 112 | ||
112 | HT_SET_RECORD(t, page, asid, frame, flags); |
113 | HT_SET_RECORD(t, page, as->asid, frame, flags); |
113 | HT_SET_NEXT(t, NULL); |
114 | HT_SET_NEXT(t, NULL); |
114 | 115 | ||
115 | spinlock_unlock(&page_ht_lock); |
116 | spinlock_unlock(&page_ht_lock); |
116 | interrupts_restore(ipl); |
117 | interrupts_restore(ipl); |
117 | } |
118 | } |
118 | 119 | ||
119 | /** Find mapping for virtual page in page hash table. |
120 | /** Find mapping for virtual page in page hash table. |
120 | * |
121 | * |
121 | * Find mapping for virtual page. |
122 | * Find mapping for virtual page. |
122 | * |
123 | * |
123 | * Interrupts must be disabled. |
124 | * Interrupts must be disabled. |
124 | * |
125 | * |
- | 126 | * @param as Address space to wich page belongs. Must be locked prior the call. |
|
125 | * @param page Virtual page. |
127 | * @param page Virtual page. |
126 | * @param asid Address space to wich page belongs. |
- | |
127 | * @param root Ignored. |
128 | * @param root Ignored. |
128 | * |
129 | * |
129 | * @return NULL if there is no such mapping; requested mapping otherwise. |
130 | * @return NULL if there is no such mapping; requested mapping otherwise. |
130 | */ |
131 | */ |
131 | pte_t *ht_mapping_find(__address page, asid_t asid, __address root) |
132 | pte_t *ht_mapping_find(as_t *as, __address page, __address root) |
132 | { |
133 | { |
133 | pte_t *t; |
134 | pte_t *t; |
134 | 135 | ||
135 | spinlock_lock(&page_ht_lock); |
136 | spinlock_lock(&page_ht_lock); |
136 | t = HT_HASH(page, asid); |
137 | t = HT_HASH(page, as->asid); |
137 | if (!HT_SLOT_EMPTY(t)) { |
138 | if (!HT_SLOT_EMPTY(t)) { |
138 | while (!HT_COMPARE(page, asid, t) && HT_GET_NEXT(t)) |
139 | while (!HT_COMPARE(page, as->asid, t) && HT_GET_NEXT(t)) |
139 | t = HT_GET_NEXT(t); |
140 | t = HT_GET_NEXT(t); |
140 | t = HT_COMPARE(page, asid, t) ? t : NULL; |
141 | t = HT_COMPARE(page, as->asid, t) ? t : NULL; |
141 | } else { |
142 | } else { |
142 | t = NULL; |
143 | t = NULL; |
143 | } |
144 | } |
144 | spinlock_unlock(&page_ht_lock); |
145 | spinlock_unlock(&page_ht_lock); |
145 | return t; |
146 | return t; |
146 | } |
147 | } |
147 | 148 | ||
148 | /** Invalidate page hash table. |
149 | /** Invalidate page hash table. |
149 | * |
150 | * |
150 | * Interrupts must be disabled. |
151 | * Interrupts must be disabled. |
151 | */ |
152 | */ |
152 | void ht_invalidate_all(void) |
153 | void ht_invalidate_all(void) |
153 | { |
154 | { |
154 | pte_t *t, *u; |
155 | pte_t *t, *u; |
155 | int i; |
156 | int i; |
156 | 157 | ||
157 | spinlock_lock(&page_ht_lock); |
158 | spinlock_lock(&page_ht_lock); |
158 | for (i = 0; i < HT_ENTRIES; i++) { |
159 | for (i = 0; i < HT_ENTRIES; i++) { |
159 | if (!HT_SLOT_EMPTY(&page_ht[i])) { |
160 | if (!HT_SLOT_EMPTY(&page_ht[i])) { |
160 | t = HT_GET_NEXT(&page_ht[i]); |
161 | t = HT_GET_NEXT(&page_ht[i]); |
161 | while (t) { |
162 | while (t) { |
162 | u = t; |
163 | u = t; |
163 | t = HT_GET_NEXT(t); |
164 | t = HT_GET_NEXT(t); |
164 | free(u); /* FIXME: use slab allocator for this */ |
165 | free(u); /* FIXME: use slab allocator for this */ |
165 | } |
166 | } |
166 | HT_INVALIDATE_SLOT(&page_ht[i]); |
167 | HT_INVALIDATE_SLOT(&page_ht[i]); |
167 | } |
168 | } |
168 | } |
169 | } |
169 | spinlock_unlock(&page_ht_lock); |
170 | spinlock_unlock(&page_ht_lock); |
170 | } |
171 | } |
171 | 172 |