WebSVN – HelenOS-historic – Diff – /kernel/trunk/genarch/include/mm/page_ht.h


/*
 * 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.
 */
 
/*
 * This is the generic page hash table interface.
 * Architectures that use single page hash table for
 * storing page translations must implement it.
 */
 
#ifndef __PAGE_HT_H__
#define __PAGE_HT_H__
 
#include <mm/page.h>
#include <typedefs.h>
 
/** Number of slots in page hash table. */
#define HT_ENTRIES          HT_ENTRIES_ARCH
 
/** Hash function.
 *
 * @param page Virtual address. Only vpn bits will be used.
 * @param asid Address space identifier.
 *
 * @return Pointer to hash table typed pte_t *.
 */
#define HT_HASH(page, asid)     HT_HASH_ARCH(page, asid)
 
/** Compare PTE with page and asid.
 *
 * @param page Virtual address. Only vpn bits will be used.
 * @param asid Address space identifier.
 * @param t PTE.
 *
 * @return 1 on match, 0 otherwise.
 */
#define HT_COMPARE(page, asid, t)   HT_COMPARE_ARCH(page, asid, t)
 
/** Identify empty page hash table slots.
 *
 * @param t Pointer ro hash table typed pte_t *.
 *
 * @return 1 if the slot is empty, 0 otherwise.
 */
#define HT_SLOT_EMPTY(t)        HT_SLOT_EMPTY_ARCH(t)
 
/** Invalidate/empty page hash table slot.
 *
 * @param t Address of the slot to be invalidated.
 */
#define HT_INVALIDATE_SLOT(t)       HT_INVALIDATE_SLOT_ARCH(t)
 
/** Return next record in collision chain.
 *
 * @param t PTE.
 *
 * @return Successor of PTE or NULL.
 */
#define HT_GET_NEXT(t)          HT_GET_NEXT_ARCH(t)
 
/** Set successor in collision chain.
 *
 * @param t PTE.
 * @param s Successor or NULL.
 */
#define HT_SET_NEXT(t, s)       HT_SET_NEXT_ARCH(t, s)
 
/** Set page hash table record.
 *
 * @param t PTE.
 * @param page Virtual address. Only vpn bits will be used.
 * @param asid Address space identifier.
 * @param frame Physical address. Only pfn bits will be used.
 * @param flags Flags. See mm/page.h.
 */
#define HT_SET_RECORD(t, page, asid, frame, flags)  HT_SET_RECORD_ARCH(t, page, asid, frame, flags)
 
 
extern page_operations_t page_ht_operations;
extern spinlock_t page_ht_lock;
 
extern pte_t *page_ht;
 
extern void ht_invalidate_all(void);
 
#endif
 

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/genarch/include/mm/page_ht.h – Rev 699 → 746

Rev 699		Rev 746
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	/*	29	/*
30	* This is the generic page hash table interface.	30	* This is the generic page hash table interface.
31	* Architectures that use single page hash table for	31	* Architectures that use single page hash table for
32	* storing page translations must implement it.	32	* storing page translations must implement it.
33	*/	33	*/
34		34
35	#ifndef __PAGE_HT_H__	35	#ifndef __PAGE_HT_H__
36	#define __PAGE_HT_H__	36	#define __PAGE_HT_H__
37		37
38	#include <mm/page.h>	38	#include <mm/page.h>
-		39	#include <typedefs.h>
-		40
-		41	/** Number of slots in page hash table. */
-		42	#define HT_ENTRIES HT_ENTRIES_ARCH
39		43
40	/** Hash function.	44	/** Hash function.
41	*	45	*
42	* @param page Virtual address. Only vpn bits will be used.	46	* @param page Virtual address. Only vpn bits will be used.
43	* @param asid Address space identifier.	47	* @param asid Address space identifier.
44	*	48	*
45	* @return Pointer to hash table typed pte_t *.	49	* @return Pointer to hash table typed pte_t *.
46	*/	50	*/
47	#define HT_HASH(page, asid) HT_HASH_ARCH(page, asid)	51	#define HT_HASH(page, asid) HT_HASH_ARCH(page, asid)
48		52
49	/** Compare PTE with page and asid.	53	/** Compare PTE with page and asid.
50	*	54	*
51	* @param page Virtual address. Only vpn bits will be used.	55	* @param page Virtual address. Only vpn bits will be used.
52	* @param asid Address space identifier.	56	* @param asid Address space identifier.
53	* @param t PTE.	57	* @param t PTE.
54	*	58	*
55	* @return 1 on match, 0 otherwise.	59	* @return 1 on match, 0 otherwise.
56	*/	60	*/
57	#define HT_COMPARE(page, asid, t) HT_COMPARE_ARCH(page, asid, t)	61	#define HT_COMPARE(page, asid, t) HT_COMPARE_ARCH(page, asid, t)
58		62
59	/** Identify empty hash table slots.	63	/** Identify empty page hash table slots.
60	*	64	*
61	* @param t Pointer ro hash table typed pte_t *.	65	* @param t Pointer ro hash table typed pte_t *.
62	*	66	*
63	* @return 1 if the slot is empty, 0 otherwise.	67	* @return 1 if the slot is empty, 0 otherwise.
64	*/	68	*/
65	#define HT_SLOT_EMPTY(t) HT_SLOT_EMPTY_ARCH(t)	69	#define HT_SLOT_EMPTY(t) HT_SLOT_EMPTY_ARCH(t)
66		70
-		71	/** Invalidate/empty page hash table slot.
-		72	*
-		73	* @param t Address of the slot to be invalidated.
-		74	*/
-		75	#define HT_INVALIDATE_SLOT(t) HT_INVALIDATE_SLOT_ARCH(t)
-		76
67	/** Return next record in collision chain.	77	/** Return next record in collision chain.
68	*	78	*
69	* @param t PTE.	79	* @param t PTE.
70	*	80	*
71	* @return Successor of PTE or NULL.	81	* @return Successor of PTE or NULL.
72	*/	82	*/
73	#define HT_GET_NEXT(t) HT_GET_NEXT_ARCH(t)	83	#define HT_GET_NEXT(t) HT_GET_NEXT_ARCH(t)
74		84
75	/** Set successor in collision chain.	85	/** Set successor in collision chain.
76	*	86	*
77	* @param t PTE.	87	* @param t PTE.
78	* @param s Successor or NULL.	88	* @param s Successor or NULL.
79	*/	89	*/
80	#define HT_SET_NEXT(t, s) HT_SET_NEXT_ARCH(t, s)	90	#define HT_SET_NEXT(t, s) HT_SET_NEXT_ARCH(t, s)
81		91
82	/** Set page hash table record.	92	/** Set page hash table record.
83	*	93	*
84	* @param t PTE.	94	* @param t PTE.
85	* @param page Virtual address. Only vpn bits will be used.	95	* @param page Virtual address. Only vpn bits will be used.
86	* @param asid Address space identifier.	96	* @param asid Address space identifier.
87	* @param frame Physical address. Only pfn bits will be used.	97	* @param frame Physical address. Only pfn bits will be used.
88	* @param flags Flags. See mm/page.h.	98	* @param flags Flags. See mm/page.h.
89	*/	99	*/
90	#define HT_SET_RECORD(t, page, asid, frame, flags) HT_SET_RECORD_ARCH(t, page, asid, frame, flags)	100	#define HT_SET_RECORD(t, page, asid, frame, flags) HT_SET_RECORD_ARCH(t, page, asid, frame, flags)
91		101
-		102
92	extern page_operations_t page_ht_operations;	103	extern page_operations_t page_ht_operations;
-		104	extern spinlock_t page_ht_lock;
-		105
-		106	extern pte_t *page_ht;
-		107
-		108	extern void ht_invalidate_all(void);
93		109
94	#endif	110	#endif
95		111