source: mainline/kernel/genarch/src/mm/page_ht.c@ d8bb821

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since d8bb821 was de73242, checked in by Jakub Jermar <jakub@…>, 13 years ago

Comment the purpose of the recently added barriers.

  • Property mode set to 100644
File size: 7.1 KB
RevLine 
[6d7ffa65]1/*
[df4ed85]2 * Copyright (c) 2006 Jakub Jermar
[6d7ffa65]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
[f47fd19]29/** @addtogroup genarchmm
[b45c443]30 * @{
31 */
32
[0f27b4c]33/**
[b45c443]34 * @file
[da1bafb]35 * @brief Virtual Address Translation (VAT) for global page hash table.
[0f27b4c]36 */
37
[6d7ffa65]38#include <genarch/mm/page_ht.h>
39#include <mm/page.h>
[c7ec94a4]40#include <arch/mm/page.h>
[6d7ffa65]41#include <mm/frame.h>
[5e3757d]42#include <mm/slab.h>
[fc1e4f6]43#include <mm/as.h>
[677a6d5]44#include <arch/mm/asid.h>
[d99c1d2]45#include <typedefs.h>
[6d7ffa65]46#include <arch/asm.h>
[7d68da80]47#include <arch/barrier.h>
[2a003d5b]48#include <synch/spinlock.h>
49#include <arch.h>
[0c0410b]50#include <debug.h>
[ef67bab]51#include <memstr.h>
[c7ec94a4]52#include <adt/hash_table.h>
[a2a46ba]53#include <align.h>
[c7ec94a4]54
[96b02eb9]55static size_t hash(sysarg_t[]);
56static bool compare(sysarg_t[], size_t, link_t *);
[da1bafb]57static void remove_callback(link_t *);
[c7ec94a4]58
[da1bafb]59static void ht_mapping_insert(as_t *, uintptr_t, uintptr_t, unsigned int);
60static void ht_mapping_remove(as_t *, uintptr_t);
[235e6c7]61static pte_t *ht_mapping_find(as_t *, uintptr_t, bool);
[c868e2d]62static void ht_mapping_make_global(uintptr_t, size_t);
[6d7ffa65]63
[a55ddc64]64slab_cache_t *pte_cache = NULL;
65
[2a003d5b]66/**
[2299914]67 * This lock protects the page hash table. It must be acquired
68 * after address space lock and after any address space area
69 * locks.
[da1bafb]70 *
[2a003d5b]71 */
[1068f6a]72mutex_t page_ht_lock;
[2a003d5b]73
[da1bafb]74/** Page hash table.
75 *
[2a003d5b]76 * The page hash table may be accessed only when page_ht_lock is held.
[da1bafb]77 *
[2a003d5b]78 */
[c7ec94a4]79hash_table_t page_ht;
[2a003d5b]80
[c7ec94a4]81/** Hash table operations for page hash table. */
82hash_table_operations_t ht_operations = {
83 .hash = hash,
84 .compare = compare,
85 .remove_callback = remove_callback
86};
[6d7ffa65]87
[f5935ed]88/** Page mapping operations for page hash table architectures. */
89page_mapping_operations_t ht_mapping_operations = {
[6d7ffa65]90 .mapping_insert = ht_mapping_insert,
[8f00329]91 .mapping_remove = ht_mapping_remove,
[c868e2d]92 .mapping_find = ht_mapping_find,
93 .mapping_make_global = ht_mapping_make_global
[6d7ffa65]94};
95
[c7ec94a4]96/** Compute page hash table index.
97 *
98 * @param key Array of two keys (i.e. page and address space).
99 *
100 * @return Index into page hash table.
[da1bafb]101 *
[c7ec94a4]102 */
[96b02eb9]103size_t hash(sysarg_t key[])
[c7ec94a4]104{
105 as_t *as = (as_t *) key[KEY_AS];
[7f1c620]106 uintptr_t page = (uintptr_t) key[KEY_PAGE];
[c7ec94a4]107
108 /*
109 * Virtual page addresses have roughly the same probability
110 * of occurring. Least significant bits of VPN compose the
111 * hash index.
[da1bafb]112 *
[c7ec94a4]113 */
[da1bafb]114 size_t index = ((page >> PAGE_WIDTH) & (PAGE_HT_ENTRIES - 1));
[c7ec94a4]115
116 /*
117 * Address space structures are likely to be allocated from
118 * similar addresses. Least significant bits compose the
119 * hash index.
[da1bafb]120 *
[c7ec94a4]121 */
[96b02eb9]122 index |= ((sysarg_t) as) & (PAGE_HT_ENTRIES - 1);
[c7ec94a4]123
124 return index;
125}
126
127/** Compare page hash table item with page and/or address space.
128 *
[da1bafb]129 * @param key Array of one or two keys (i.e. page and/or address space).
[c7ec94a4]130 * @param keys Number of keys passed.
131 * @param item Item to compare the keys with.
132 *
133 * @return true on match, false otherwise.
[da1bafb]134 *
[c7ec94a4]135 */
[96b02eb9]136bool compare(sysarg_t key[], size_t keys, link_t *item)
[c7ec94a4]137{
138 ASSERT(item);
[da1bafb]139 ASSERT(keys > 0);
140 ASSERT(keys <= PAGE_HT_KEYS);
141
[c7ec94a4]142 /*
143 * Convert item to PTE.
[da1bafb]144 *
[c7ec94a4]145 */
[da1bafb]146 pte_t *pte = hash_table_get_instance(item, pte_t, link);
147
148 if (keys == PAGE_HT_KEYS)
149 return (key[KEY_AS] == (uintptr_t) pte->as) &&
150 (key[KEY_PAGE] == pte->page);
151
152 return (key[KEY_AS] == (uintptr_t) pte->as);
[c7ec94a4]153}
154
155/** Callback on page hash table item removal.
156 *
157 * @param item Page hash table item being removed.
[da1bafb]158 *
[c7ec94a4]159 */
160void remove_callback(link_t *item)
161{
162 ASSERT(item);
[da1bafb]163
[c7ec94a4]164 /*
165 * Convert item to PTE.
[da1bafb]166 *
[c7ec94a4]167 */
[da1bafb]168 pte_t *pte = hash_table_get_instance(item, pte_t, link);
169
[a55ddc64]170 slab_free(pte_cache, pte);
[c7ec94a4]171}
172
[6d7ffa65]173/** Map page to frame using page hash table.
174 *
[9179d0a]175 * Map virtual address page to physical address frame
[da1bafb]176 * using flags.
[6d7ffa65]177 *
[da1bafb]178 * @param as Address space to which page belongs.
179 * @param page Virtual address of the page to be mapped.
[6d7ffa65]180 * @param frame Physical address of memory frame to which the mapping is done.
181 * @param flags Flags to be used for mapping.
[da1bafb]182 *
[6d7ffa65]183 */
[da1bafb]184void ht_mapping_insert(as_t *as, uintptr_t page, uintptr_t frame,
185 unsigned int flags)
[6d7ffa65]186{
[96b02eb9]187 sysarg_t key[2] = {
[2057572]188 (uintptr_t) as,
189 page = ALIGN_DOWN(page, PAGE_SIZE)
190 };
[1d432f9]191
192 ASSERT(page_table_locked(as));
[2a003d5b]193
[c7ec94a4]194 if (!hash_table_find(&page_ht, key)) {
[a55ddc64]195 pte_t *pte = slab_alloc(pte_cache, FRAME_LOWMEM | FRAME_ATOMIC);
[da1bafb]196 ASSERT(pte != NULL);
197
198 pte->g = (flags & PAGE_GLOBAL) != 0;
199 pte->x = (flags & PAGE_EXEC) != 0;
200 pte->w = (flags & PAGE_WRITE) != 0;
201 pte->k = !(flags & PAGE_USER);
202 pte->c = (flags & PAGE_CACHEABLE) != 0;
203 pte->p = !(flags & PAGE_NOT_PRESENT);
204 pte->a = false;
205 pte->d = false;
206
207 pte->as = as;
208 pte->page = ALIGN_DOWN(page, PAGE_SIZE);
209 pte->frame = ALIGN_DOWN(frame, FRAME_SIZE);
[7d68da80]210
[de73242]211 /*
212 * Make sure that a concurrent ht_mapping_find() will see the
213 * new entry only after it is fully initialized.
214 */
[7d68da80]215 write_barrier();
[da1bafb]216
217 hash_table_insert(&page_ht, key, &pte->link);
[0c0410b]218 }
[6d7ffa65]219}
220
[8f00329]221/** Remove mapping of page from page hash table.
222 *
[9179d0a]223 * Remove any mapping of page within address space as.
[8f00329]224 * TLB shootdown should follow in order to make effects of
225 * this call visible.
226 *
[235e6c7]227 * @param as Address space to which page belongs.
[8f00329]228 * @param page Virtual address of the page to be demapped.
[da1bafb]229 *
[8f00329]230 */
[7f1c620]231void ht_mapping_remove(as_t *as, uintptr_t page)
[8f00329]232{
[96b02eb9]233 sysarg_t key[2] = {
[2057572]234 (uintptr_t) as,
235 page = ALIGN_DOWN(page, PAGE_SIZE)
236 };
[1d432f9]237
238 ASSERT(page_table_locked(as));
[8f00329]239
240 /*
241 * Note that removed PTE's will be freed
242 * by remove_callback().
243 */
244 hash_table_remove(&page_ht, key, 2);
245}
246
247
[6d7ffa65]248/** Find mapping for virtual page in page hash table.
249 *
[235e6c7]250 * @param as Address space to which page belongs.
251 * @param page Virtual page.
252 * @param nolock True if the page tables need not be locked.
[6d7ffa65]253 *
[0c0410b]254 * @return NULL if there is no such mapping; requested mapping otherwise.
[da1bafb]255 *
[6d7ffa65]256 */
[235e6c7]257pte_t *ht_mapping_find(as_t *as, uintptr_t page, bool nolock)
[6d7ffa65]258{
[96b02eb9]259 sysarg_t key[2] = {
[2057572]260 (uintptr_t) as,
261 page = ALIGN_DOWN(page, PAGE_SIZE)
262 };
[1d432f9]263
[235e6c7]264 ASSERT(nolock || page_table_locked(as));
[0c0410b]265
[da1bafb]266 link_t *cur = hash_table_find(&page_ht, key);
267 if (cur)
268 return hash_table_get_instance(cur, pte_t, link);
269
270 return NULL;
[6d7ffa65]271}
[b45c443]272
[c868e2d]273void ht_mapping_make_global(uintptr_t base, size_t size)
274{
275 /* nothing to do */
276}
277
[f47fd19]278/** @}
[b45c443]279 */
Note: See TracBrowser for help on using the repository browser.