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/heap.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 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_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;
    ipl_t ipl;
    __native key[2] = { (__address) as, page };
   
    ipl = interrupts_disable();
    spinlock_lock(&page_ht_lock);
 
    if (!hash_table_find(&page_ht, key)) {
        t = (pte_t *) malloc(sizeof(pte_t));
        ASSERT(t != NULL);
   
        hash_table_insert(&page_ht, key, &t->link);
    }
   
    spinlock_unlock(&page_ht_lock);
    interrupts_restore(ipl);
}
 
/** 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 792 → 793

Rev 792		Rev 793
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/heap.h>	33	#include <mm/heap.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 pte_t ht_mapping_find(as_t as, __address page);	50	static pte_t ht_mapping_find(as_t as, __address page);
51		51
52	/**	52	/**
53	* This lock protects the page hash table.	53	* This lock protects the page hash table.
54	*/	54	*/
55	SPINLOCK_INITIALIZE(page_ht_lock);	55	SPINLOCK_INITIALIZE(page_ht_lock);
56		56
57	/**	57	/**
58	* Page hash table.	58	* Page hash table.
59	* The page hash table may be accessed only when page_ht_lock is held.	59	* The page hash table may be accessed only when page_ht_lock is held.
60	*/	60	*/
61	hash_table_t page_ht;	61	hash_table_t page_ht;
62		62
63	/** Hash table operations for page hash table. */	63	/** Hash table operations for page hash table. */
64	hash_table_operations_t ht_operations = {	64	hash_table_operations_t ht_operations = {
65	.hash = hash,	65	.hash = hash,
66	.compare = compare,	66	.compare = compare,
67	.remove_callback = remove_callback	67	.remove_callback = remove_callback
68	};	68	};
69		69
-		70	/** Page mapping operations for page hash table architectures. */
70	page_operations_t page_ht_operations = {	71	page_mapping_operations_t ht_mapping_operations = {
71	.mapping_insert = ht_mapping_insert,	72	.mapping_insert = ht_mapping_insert,
72	.mapping_find = ht_mapping_find	73	.mapping_find = ht_mapping_find
73	};	74	};
74		75
75	/** Compute page hash table index.	76	/** Compute page hash table index.
76	*	77	*
77	* @param key Array of two keys (i.e. page and address space).	78	* @param key Array of two keys (i.e. page and address space).
78	*	79	*
79	* @return Index into page hash table.	80	* @return Index into page hash table.
80	*/	81	*/
81	index_t hash(__native key[])	82	index_t hash(__native key[])
82	{	83	{
83	as_t as = (as_t ) key[KEY_AS];	84	as_t as = (as_t ) key[KEY_AS];
84	__address page = (__address) key[KEY_PAGE];	85	__address page = (__address) key[KEY_PAGE];
85	index_t index;	86	index_t index;
86		87
87	/*	88	/*
88	* Virtual page addresses have roughly the same probability	89	* Virtual page addresses have roughly the same probability
89	* of occurring. Least significant bits of VPN compose the	90	* of occurring. Least significant bits of VPN compose the
90	* hash index.	91	* hash index.
91	*/	92	*/
92	index = ((page >> PAGE_WIDTH) & (PAGE_HT_ENTRIES-1));	93	index = ((page >> PAGE_WIDTH) & (PAGE_HT_ENTRIES-1));
93		94
94	/*	95	/*
95	* Address space structures are likely to be allocated from	96	* Address space structures are likely to be allocated from
96	* similar addresses. Least significant bits compose the	97	* similar addresses. Least significant bits compose the
97	* hash index.	98	* hash index.
98	*/	99	*/
99	index \|= ((__native) as) & (PAGE_HT_ENTRIES-1);	100	index \|= ((__native) as) & (PAGE_HT_ENTRIES-1);
100		101
101	return index;	102	return index;
102	}	103	}
103		104
104	/** Compare page hash table item with page and/or address space.	105	/** Compare page hash table item with page and/or address space.
105	*	106	*
106	* @param key Array of one or two keys (i.e. page and/or address space).	107	* @param key Array of one or two keys (i.e. page and/or address space).
107	* @param keys Number of keys passed.	108	* @param keys Number of keys passed.
108	* @param item Item to compare the keys with.	109	* @param item Item to compare the keys with.
109	*	110	*
110	* @return true on match, false otherwise.	111	* @return true on match, false otherwise.
111	*/	112	*/
112	bool compare(__native key[], count_t keys, link_t *item)	113	bool compare(__native key[], count_t keys, link_t *item)
113	{	114	{
114	pte_t *t;	115	pte_t *t;
115		116
116	ASSERT(item);	117	ASSERT(item);
117	ASSERT((keys > 0) && (keys <= PAGE_HT_KEYS));	118	ASSERT((keys > 0) && (keys <= PAGE_HT_KEYS));
118		119
119	/*	120	/*
120	* Convert item to PTE.	121	* Convert item to PTE.
121	*/	122	*/
122	t = list_get_instance(item, pte_t, link);	123	t = hash_table_get_instance(item, pte_t, link);
123		124
124	if (keys == PAGE_HT_KEYS) {	125	if (keys == PAGE_HT_KEYS) {
125	return (key[KEY_AS] == (__address) t->as) && (key[KEY_PAGE] == t->page);	126	return (key[KEY_AS] == (__address) t->as) && (key[KEY_PAGE] == t->page);
126	} else {	127	} else {
127	return (key[KEY_AS] == (__address) t->as);	128	return (key[KEY_AS] == (__address) t->as);
128	}	129	}
129	}	130	}
130		131
131	/** Callback on page hash table item removal.	132	/** Callback on page hash table item removal.
132	*	133	*
133	* @param item Page hash table item being removed.	134	* @param item Page hash table item being removed.
134	*/	135	*/
135	void remove_callback(link_t *item)	136	void remove_callback(link_t *item)
136	{	137	{
137	pte_t *t;	138	pte_t *t;
138		139
139	ASSERT(item);	140	ASSERT(item);
140		141
141	/*	142	/*
142	* Convert item to PTE.	143	* Convert item to PTE.
143	*/	144	*/
144	t = list_get_instance(item, pte_t, link);	145	t = hash_table_get_instance(item, pte_t, link);
145		146
146	free(t);	147	free(t);
147	}	148	}
148		149
149	/** Map page to frame using page hash table.	150	/** Map page to frame using page hash table.
150	*	151	*
151	* Map virtual address 'page' to physical address 'frame'	152	* Map virtual address 'page' to physical address 'frame'
152	* using 'flags'.	153	* using 'flags'.
153	*	154	*
154	* The address space must be locked and interruptsmust be disabled.	155	* The address space must be locked and interruptsmust be disabled.
155	*	156	*
156	* @param as Address space to which page belongs.	157	* @param as Address space to which page belongs.
157	* @param page Virtual address of the page to be mapped.	158	* @param page Virtual address of the page to be mapped.
158	* @param frame Physical address of memory frame to which the mapping is done.	159	* @param frame Physical address of memory frame to which the mapping is done.
159	* @param flags Flags to be used for mapping.	160	* @param flags Flags to be used for mapping.
160	*/	161	*/
161	void ht_mapping_insert(as_t *as, __address page, __address frame, int flags)	162	void ht_mapping_insert(as_t *as, __address page, __address frame, int flags)
162	{	163	{
163	pte_t *t;	164	pte_t *t;
164	ipl_t ipl;	165	ipl_t ipl;
165	__native key[2] = { (__address) as, page };	166	__native key[2] = { (__address) as, page };
166		167
167	ipl = interrupts_disable();	168	ipl = interrupts_disable();
168	spinlock_lock(&page_ht_lock);	169	spinlock_lock(&page_ht_lock);
169		170
170	if (!hash_table_find(&page_ht, key)) {	171	if (!hash_table_find(&page_ht, key)) {
171	t = (pte_t *) malloc(sizeof(pte_t));	172	t = (pte_t *) malloc(sizeof(pte_t));
172	ASSERT(t != NULL);	173	ASSERT(t != NULL);
173		174
174	hash_table_insert(&page_ht, key, &t->link);	175	hash_table_insert(&page_ht, key, &t->link);
175	}	176	}
176		177
177	spinlock_unlock(&page_ht_lock);	178	spinlock_unlock(&page_ht_lock);
178	interrupts_restore(ipl);	179	interrupts_restore(ipl);
179	}	180	}
180		181
181	/** Find mapping for virtual page in page hash table.	182	/** Find mapping for virtual page in page hash table.
182	*	183	*
183	* Find mapping for virtual page.	184	* Find mapping for virtual page.
184	*	185	*
185	* The address space must be locked and interrupts must be disabled.	186	* The address space must be locked and interrupts must be disabled.
186	*	187	*
187	* @param as Address space to wich page belongs.	188	* @param as Address space to wich page belongs.
188	* @param page Virtual page.	189	* @param page Virtual page.
189	*	190	*
190	* @return NULL if there is no such mapping; requested mapping otherwise.	191	* @return NULL if there is no such mapping; requested mapping otherwise.
191	*/	192	*/
192	pte_t ht_mapping_find(as_t as, __address page)	193	pte_t ht_mapping_find(as_t as, __address page)
193	{	194	{
194	link_t *hlp;	195	link_t *hlp;
195	pte_t *t = NULL;	196	pte_t *t = NULL;
196	__native key[2] = { (__address) as, page };	197	__native key[2] = { (__address) as, page };
197		198
198	spinlock_lock(&page_ht_lock);	199	spinlock_lock(&page_ht_lock);
199		200
200	hlp = hash_table_find(&page_ht, key);	201	hlp = hash_table_find(&page_ht, key);
201	if (hlp)	202	if (hlp)
202	t = list_get_instance(hlp, pte_t, link);	203	t = hash_table_get_instance(hlp, pte_t, link);
203		204
204	spinlock_unlock(&page_ht_lock);	205	spinlock_unlock(&page_ht_lock);
205	return t;	206	return t;
206	}	207	}
207		208