WebSVN – HelenOS-historic – Diff – /kernel/trunk/genarch/src/mm/page_ht.c


/*
 * Copyright (C) 2006 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#include <genarch/mm/page_ht.h>
#include <mm/page.h>
#include <arch/mm/page.h>
#include <mm/frame.h>
#include <mm/slab.h>
#include <mm/as.h>
#include <arch/mm/asid.h>
#include <arch/types.h>
#include <typedefs.h>
#include <arch/asm.h>
#include <synch/spinlock.h>
#include <arch.h>
#include <debug.h>
#include <memstr.h>
#include <adt/hash_table.h>
 
static index_t hash(__native key[]);
static bool compare(__native key[], count_t keys, link_t *item);
static void remove_callback(link_t *item);
 
static void ht_mapping_insert(as_t *as, __address page, __address frame, int flags);
static void ht_mapping_remove(as_t *as, __address page);
static pte_t *ht_mapping_find(as_t *as, __address page);
 
/**
 * This lock protects the page hash table.
 */
SPINLOCK_INITIALIZE(page_ht_lock);
 
/**
 * Page hash table.
 * The page hash table may be accessed only when page_ht_lock is held.
 */
hash_table_t page_ht;
 
/** Hash table operations for page hash table. */
hash_table_operations_t ht_operations = {
    .hash = hash,
    .compare = compare,
    .remove_callback = remove_callback
};
 
/** Page mapping operations for page hash table architectures. */
page_mapping_operations_t ht_mapping_operations = {
    .mapping_insert = ht_mapping_insert,
    .mapping_remove = ht_mapping_remove,
    .mapping_find = ht_mapping_find
};
 
/** Compute page hash table index.
 *
 * @param key Array of two keys (i.e. page and address space).
 *
 * @return Index into page hash table.
 */
index_t hash(__native key[])
{
    as_t *as = (as_t *) key[KEY_AS];
    __address page = (__address) key[KEY_PAGE];
    index_t index;
   
    /*
     * Virtual page addresses have roughly the same probability
     * of occurring. Least significant bits of VPN compose the
     * hash index.
     */
    index = ((page >> PAGE_WIDTH) & (PAGE_HT_ENTRIES-1));
   
    /*
     * Address space structures are likely to be allocated from
     * similar addresses. Least significant bits compose the
     * hash index.
     */
    index |= ((__native) as) & (PAGE_HT_ENTRIES-1);
   
    return index;
}
 
/** Compare page hash table item with page and/or address space.
 *
 * @param key Array of one or two keys (i.e. page and/or address space).
 * @param keys Number of keys passed.
 * @param item Item to compare the keys with.
 *
 * @return true on match, false otherwise.
 */
bool compare(__native key[], count_t keys, link_t *item)
{
    pte_t *t;
 
    ASSERT(item);
    ASSERT((keys > 0) && (keys <= PAGE_HT_KEYS));
 
    /*
     * Convert item to PTE.
     */
    t = hash_table_get_instance(item, pte_t, link);
 
    if (keys == PAGE_HT_KEYS) {
        return (key[KEY_AS] == (__address) t->as) && (key[KEY_PAGE] == t->page);
    } else {
        return (key[KEY_AS] == (__address) t->as);
    }
}
 
/** Callback on page hash table item removal.
 *
 * @param item Page hash table item being removed.
 */
void remove_callback(link_t *item)
{
    pte_t *t;
 
    ASSERT(item);
 
    /*
     * Convert item to PTE.
     */
    t = hash_table_get_instance(item, pte_t, link);
 
    free(t);
}
 
/** Map page to frame using page hash table.
 *
 * Map virtual address 'page' to physical address 'frame'
 * using 'flags'.
 *
 * The address space must be locked and interruptsmust be disabled.
 *
 * @param as Address space to which page belongs.
 * @param page Virtual address of the page to be mapped.
 * @param frame Physical address of memory frame to which the mapping is done.
 * @param flags Flags to be used for mapping.
 */
void ht_mapping_insert(as_t *as, __address page, __address frame, int flags)
{
    pte_t *t;
    __native key[2] = { (__address) as, page };
   
    spinlock_lock(&page_ht_lock);
 
    if (!hash_table_find(&page_ht, key)) {
        t = (pte_t *) malloc(sizeof(pte_t), FRAME_ATOMIC);
        ASSERT(t != NULL);
 
        t->g = (flags & PAGE_GLOBAL) != 0;
        t->x = (flags & PAGE_EXEC) != 0;
        t->w = (flags & PAGE_WRITE) != 0;
        t->k = !(flags & PAGE_USER);
        t->c = (flags & PAGE_CACHEABLE) != 0;
        t->p = !(flags & PAGE_NOT_PRESENT);
 
        t->as = as;
        t->page = page;
        t->frame = frame;
 
        hash_table_insert(&page_ht, key, &t->link);
    }
   
    spinlock_unlock(&page_ht_lock);
}
 
/** Remove mapping of page from page hash table.
 *
 * Remove any mapping of 'page' within address space 'as'.
 * TLB shootdown should follow in order to make effects of
 * this call visible.
 *
 * The address space must be locked and interrupts must be disabled.
 *
 * @param as Address space to wich page belongs.
 * @param page Virtual address of the page to be demapped.
 */
void ht_mapping_remove(as_t *as, __address page)
{
    __native key[2] = { (__address) as, page };
   
    spinlock_lock(&page_ht_lock);
 
    /*
     * Note that removed PTE's will be freed
     * by remove_callback().
     */
    hash_table_remove(&page_ht, key, 2);
 
    spinlock_unlock(&page_ht_lock);
}
 
 
/** Find mapping for virtual page in page hash table.
 *
 * Find mapping for virtual page.
 *
 * The address space must be locked and interrupts must be disabled.
 *
 * @param as Address space to wich page belongs.
 * @param page Virtual page.
 *
 * @return NULL if there is no such mapping; requested mapping otherwise.
 */
pte_t *ht_mapping_find(as_t *as, __address page)
{
    link_t *hlp;
    pte_t *t = NULL;
    __native key[2] = { (__address) as, page };
   
    spinlock_lock(&page_ht_lock);
 
    hlp = hash_table_find(&page_ht, key);
    if (hlp)
        t = hash_table_get_instance(hlp, pte_t, link);
 
    spinlock_unlock(&page_ht_lock);
    return t;
}
 

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/genarch/src/mm/page_ht.c – Rev 826 → 902

Rev 826		Rev 902
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 <arch/mm/page.h>	31	#include <arch/mm/page.h>
32	#include <mm/frame.h>	32	#include <mm/frame.h>
33	#include <mm/slab.h>	33	#include <mm/slab.h>
34	#include <mm/as.h>	34	#include <mm/as.h>
35	#include <arch/mm/asid.h>	35	#include <arch/mm/asid.h>
36	#include <arch/types.h>	36	#include <arch/types.h>
37	#include <typedefs.h>	37	#include <typedefs.h>
38	#include <arch/asm.h>	38	#include <arch/asm.h>
39	#include <synch/spinlock.h>	39	#include <synch/spinlock.h>
40	#include <arch.h>	40	#include <arch.h>
41	#include <debug.h>	41	#include <debug.h>
42	#include <memstr.h>	42	#include <memstr.h>
43	#include <adt/hash_table.h>	43	#include <adt/hash_table.h>
44		44
45	static index_t hash(__native key[]);	45	static index_t hash(__native key[]);
46	static bool compare(__native key[], count_t keys, link_t *item);	46	static bool compare(__native key[], count_t keys, link_t *item);
47	static void remove_callback(link_t *item);	47	static void remove_callback(link_t *item);
48		48
49	static void ht_mapping_insert(as_t *as, __address page, __address frame, int flags);	49	static void ht_mapping_insert(as_t *as, __address page, __address frame, int flags);
50	static void ht_mapping_remove(as_t *as, __address page);	50	static void ht_mapping_remove(as_t *as, __address page);
51	static pte_t ht_mapping_find(as_t as, __address page);	51	static pte_t ht_mapping_find(as_t as, __address page);
52		52
53	/**	53	/**
54	* This lock protects the page hash table.	54	* This lock protects the page hash table.
55	*/	55	*/
56	SPINLOCK_INITIALIZE(page_ht_lock);	56	SPINLOCK_INITIALIZE(page_ht_lock);
57		57
58	/**	58	/**
59	* Page hash table.	59	* Page hash table.
60	* The page hash table may be accessed only when page_ht_lock is held.	60	* The page hash table may be accessed only when page_ht_lock is held.
61	*/	61	*/
62	hash_table_t page_ht;	62	hash_table_t page_ht;
63		63
64	/** Hash table operations for page hash table. */	64	/** Hash table operations for page hash table. */
65	hash_table_operations_t ht_operations = {	65	hash_table_operations_t ht_operations = {
66	.hash = hash,	66	.hash = hash,
67	.compare = compare,	67	.compare = compare,
68	.remove_callback = remove_callback	68	.remove_callback = remove_callback
69	};	69	};
70		70
71	/** Page mapping operations for page hash table architectures. */	71	/** Page mapping operations for page hash table architectures. */
72	page_mapping_operations_t ht_mapping_operations = {	72	page_mapping_operations_t ht_mapping_operations = {
73	.mapping_insert = ht_mapping_insert,	73	.mapping_insert = ht_mapping_insert,
74	.mapping_remove = ht_mapping_remove,	74	.mapping_remove = ht_mapping_remove,
75	.mapping_find = ht_mapping_find	75	.mapping_find = ht_mapping_find
76	};	76	};
77		77
78	/** Compute page hash table index.	78	/** Compute page hash table index.
79	*	79	*
80	* @param key Array of two keys (i.e. page and address space).	80	* @param key Array of two keys (i.e. page and address space).
81	*	81	*
82	* @return Index into page hash table.	82	* @return Index into page hash table.
83	*/	83	*/
84	index_t hash(__native key[])	84	index_t hash(__native key[])
85	{	85	{
86	as_t as = (as_t ) key[KEY_AS];	86	as_t as = (as_t ) key[KEY_AS];
87	__address page = (__address) key[KEY_PAGE];	87	__address page = (__address) key[KEY_PAGE];
88	index_t index;	88	index_t index;
89		89
90	/*	90	/*
91	* Virtual page addresses have roughly the same probability	91	* Virtual page addresses have roughly the same probability
92	* of occurring. Least significant bits of VPN compose the	92	* of occurring. Least significant bits of VPN compose the
93	* hash index.	93	* hash index.
94	*/	94	*/
95	index = ((page >> PAGE_WIDTH) & (PAGE_HT_ENTRIES-1));	95	index = ((page >> PAGE_WIDTH) & (PAGE_HT_ENTRIES-1));
96		96
97	/*	97	/*
98	* Address space structures are likely to be allocated from	98	* Address space structures are likely to be allocated from
99	* similar addresses. Least significant bits compose the	99	* similar addresses. Least significant bits compose the
100	* hash index.	100	* hash index.
101	*/	101	*/
102	index \|= ((__native) as) & (PAGE_HT_ENTRIES-1);	102	index \|= ((__native) as) & (PAGE_HT_ENTRIES-1);
103		103
104	return index;	104	return index;
105	}	105	}
106		106
107	/** Compare page hash table item with page and/or address space.	107	/** Compare page hash table item with page and/or address space.
108	*	108	*
109	* @param key Array of one or two keys (i.e. page and/or address space).	109	* @param key Array of one or two keys (i.e. page and/or address space).
110	* @param keys Number of keys passed.	110	* @param keys Number of keys passed.
111	* @param item Item to compare the keys with.	111	* @param item Item to compare the keys with.
112	*	112	*
113	* @return true on match, false otherwise.	113	* @return true on match, false otherwise.
114	*/	114	*/
115	bool compare(__native key[], count_t keys, link_t *item)	115	bool compare(__native key[], count_t keys, link_t *item)
116	{	116	{
117	pte_t *t;	117	pte_t *t;
118		118
119	ASSERT(item);	119	ASSERT(item);
120	ASSERT((keys > 0) && (keys <= PAGE_HT_KEYS));	120	ASSERT((keys > 0) && (keys <= PAGE_HT_KEYS));
121		121
122	/*	122	/*
123	* Convert item to PTE.	123	* Convert item to PTE.
124	*/	124	*/
125	t = hash_table_get_instance(item, pte_t, link);	125	t = hash_table_get_instance(item, pte_t, link);
126		126
127	if (keys == PAGE_HT_KEYS) {	127	if (keys == PAGE_HT_KEYS) {
128	return (key[KEY_AS] == (__address) t->as) && (key[KEY_PAGE] == t->page);	128	return (key[KEY_AS] == (__address) t->as) && (key[KEY_PAGE] == t->page);
129	} else {	129	} else {
130	return (key[KEY_AS] == (__address) t->as);	130	return (key[KEY_AS] == (__address) t->as);
131	}	131	}
132	}	132	}
133		133
134	/** Callback on page hash table item removal.	134	/** Callback on page hash table item removal.
135	*	135	*
136	* @param item Page hash table item being removed.	136	* @param item Page hash table item being removed.
137	*/	137	*/
138	void remove_callback(link_t *item)	138	void remove_callback(link_t *item)
139	{	139	{
140	pte_t *t;	140	pte_t *t;
141		141
142	ASSERT(item);	142	ASSERT(item);
143		143
144	/*	144	/*
145	* Convert item to PTE.	145	* Convert item to PTE.
146	*/	146	*/
147	t = hash_table_get_instance(item, pte_t, link);	147	t = hash_table_get_instance(item, pte_t, link);
148		148
149	free(t);	149	free(t);
150	}	150	}
151		151
152	/** Map page to frame using page hash table.	152	/** Map page to frame using page hash table.
153	*	153	*
154	* Map virtual address 'page' to physical address 'frame'	154	* Map virtual address 'page' to physical address 'frame'
155	* using 'flags'.	155	* using 'flags'.
156	*	156	*
157	* The address space must be locked and interruptsmust be disabled.	157	* The address space must be locked and interruptsmust be disabled.
158	*	158	*
159	* @param as Address space to which page belongs.	159	* @param as Address space to which page belongs.
160	* @param page Virtual address of the page to be mapped.	160	* @param page Virtual address of the page to be mapped.
161	* @param frame Physical address of memory frame to which the mapping is done.	161	* @param frame Physical address of memory frame to which the mapping is done.
162	* @param flags Flags to be used for mapping.	162	* @param flags Flags to be used for mapping.
163	*/	163	*/
164	void ht_mapping_insert(as_t *as, __address page, __address frame, int flags)	164	void ht_mapping_insert(as_t *as, __address page, __address frame, int flags)
165	{	165	{
166	pte_t *t;	166	pte_t *t;
167	__native key[2] = { (__address) as, page };	167	__native key[2] = { (__address) as, page };
168		168
169	spinlock_lock(&page_ht_lock);	169	spinlock_lock(&page_ht_lock);
170		170
171	if (!hash_table_find(&page_ht, key)) {	171	if (!hash_table_find(&page_ht, key)) {
172	t = (pte_t *) malloc(sizeof(pte_t), FRAME_ATOMIC);	172	t = (pte_t *) malloc(sizeof(pte_t), FRAME_ATOMIC);
173	ASSERT(t != NULL);	173	ASSERT(t != NULL);
174		174
-		175	t->g = (flags & PAGE_GLOBAL) != 0;
-		176	t->x = (flags & PAGE_EXEC) != 0;
-		177	t->w = (flags & PAGE_WRITE) != 0;
-		178	t->k = !(flags & PAGE_USER);
-		179	t->c = (flags & PAGE_CACHEABLE) != 0;
-		180	t->p = !(flags & PAGE_NOT_PRESENT);
-		181
-		182	t->as = as;
-		183	t->page = page;
-		184	t->frame = frame;
-		185
175	hash_table_insert(&page_ht, key, &t->link);	186	hash_table_insert(&page_ht, key, &t->link);
176	}	187	}
177		188
178	spinlock_unlock(&page_ht_lock);	189	spinlock_unlock(&page_ht_lock);
179	}	190	}
180		191
181	/** Remove mapping of page from page hash table.	192	/** Remove mapping of page from page hash table.
182	*	193	*
183	* Remove any mapping of 'page' within address space 'as'.	194	* Remove any mapping of 'page' within address space 'as'.
184	* TLB shootdown should follow in order to make effects of	195	* TLB shootdown should follow in order to make effects of
185	* this call visible.	196	* this call visible.
186	*	197	*
187	* The address space must be locked and interrupts must be disabled.	198	* The address space must be locked and interrupts must be disabled.
188	*	199	*
189	* @param as Address space to wich page belongs.	200	* @param as Address space to wich page belongs.
190	* @param page Virtual address of the page to be demapped.	201	* @param page Virtual address of the page to be demapped.
191	*/	202	*/
192	void ht_mapping_remove(as_t *as, __address page)	203	void ht_mapping_remove(as_t *as, __address page)
193	{	204	{
194	__native key[2] = { (__address) as, page };	205	__native key[2] = { (__address) as, page };
195		206
196	spinlock_lock(&page_ht_lock);	207	spinlock_lock(&page_ht_lock);
197		208
198	/*	209	/*
199	* Note that removed PTE's will be freed	210	* Note that removed PTE's will be freed
200	* by remove_callback().	211	* by remove_callback().
201	*/	212	*/
202	hash_table_remove(&page_ht, key, 2);	213	hash_table_remove(&page_ht, key, 2);
203		214
204	spinlock_unlock(&page_ht_lock);	215	spinlock_unlock(&page_ht_lock);
205	}	216	}
206		217
207		218
208	/** Find mapping for virtual page in page hash table.	219	/** Find mapping for virtual page in page hash table.
209	*	220	*
210	* Find mapping for virtual page.	221	* Find mapping for virtual page.
211	*	222	*
212	* The address space must be locked and interrupts must be disabled.	223	* The address space must be locked and interrupts must be disabled.
213	*	224	*
214	* @param as Address space to wich page belongs.	225	* @param as Address space to wich page belongs.
215	* @param page Virtual page.	226	* @param page Virtual page.
216	*	227	*
217	* @return NULL if there is no such mapping; requested mapping otherwise.	228	* @return NULL if there is no such mapping; requested mapping otherwise.
218	*/	229	*/
219	pte_t ht_mapping_find(as_t as, __address page)	230	pte_t ht_mapping_find(as_t as, __address page)
220	{	231	{
221	link_t *hlp;	232	link_t *hlp;
222	pte_t *t = NULL;	233	pte_t *t = NULL;
223	__native key[2] = { (__address) as, page };	234	__native key[2] = { (__address) as, page };
224		235
225	spinlock_lock(&page_ht_lock);	236	spinlock_lock(&page_ht_lock);
226		237
227	hlp = hash_table_find(&page_ht, key);	238	hlp = hash_table_find(&page_ht, key);
228	if (hlp)	239	if (hlp)
229	t = hash_table_get_instance(hlp, pte_t, link);	240	t = hash_table_get_instance(hlp, pte_t, link);
230		241
231	spinlock_unlock(&page_ht_lock);	242	spinlock_unlock(&page_ht_lock);
232	return t;	243	return t;
233	}	244	}
234		245