WebSVN – HelenOS-historic – Diff – /kernel/trunk/genarch/src/mm/page_pt.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_pt.h>
#include <mm/page.h>
#include <mm/frame.h>
#include <mm/as.h>
#include <arch/mm/page.h>
#include <arch/mm/as.h>
#include <arch/types.h>
#include <typedefs.h>
#include <arch/asm.h>
#include <memstr.h>
 
static void pt_mapping_insert(as_t *as, __address page, __address frame, int flags);
static pte_t *pt_mapping_find(as_t *as, __address page);
 
page_operations_t page_pt_operations = {
    .mapping_insert = pt_mapping_insert,
    .mapping_find = pt_mapping_find
};
 
/** Map page to frame using hierarchical page tables.
 *
 * Map virtual address 'page' to physical address 'frame'
 * using 'flags'.
 *
 * 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 mapped.
 * @param frame Physical address of memory frame to which the mapping is done.
 * @param flags Flags to be used for mapping.
 
 */
void pt_mapping_insert(as_t *as, __address page, __address frame, int flags)
{
    pte_t *ptl0, *ptl1, *ptl2, *ptl3;
    __address newpt;
 
    ptl0 = (pte_t *) PA2KA((__address) as->page_table);
 
    if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT) {
        newpt = frame_alloc(FRAME_KA, ONE_FRAME, NULL);
        memsetb(newpt, PAGE_SIZE, 0);
        SET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page), KA2PA(newpt));
        SET_PTL1_FLAGS(ptl0, PTL0_INDEX(page), PAGE_PRESENT | PAGE_USER | PAGE_EXEC | PAGE_CACHEABLE | PAGE_WRITE);
    }
 
    ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page)));
 
    if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT) {
        newpt = frame_alloc(FRAME_KA, ONE_FRAME, NULL);
        memsetb(newpt, PAGE_SIZE, 0);
        SET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page), KA2PA(newpt));
        SET_PTL2_FLAGS(ptl1, PTL1_INDEX(page), PAGE_PRESENT | PAGE_USER | PAGE_EXEC | PAGE_CACHEABLE | PAGE_WRITE);
    }
 
    ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page)));
 
    if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT) {
        newpt = frame_alloc(FRAME_KA, ONE_FRAME, NULL);
        memsetb(newpt, PAGE_SIZE, 0);
        SET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page), KA2PA(newpt));
        SET_PTL3_FLAGS(ptl2, PTL2_INDEX(page), PAGE_PRESENT | PAGE_USER | PAGE_EXEC | PAGE_CACHEABLE | PAGE_WRITE);
    }
 
    ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page)));
 
    SET_FRAME_ADDRESS(ptl3, PTL3_INDEX(page), frame);
    SET_FRAME_FLAGS(ptl3, PTL3_INDEX(page), flags);
}
 
/** Find mapping for virtual page in hierarchical page tables.
 *
 * Find mapping for virtual page.
 *
 * The address space must be locked and interrupts must be disabled.
 *
 * @param as Address space to which page belongs.
 * @param page Virtual page.
 
 *
 * @return NULL if there is no such mapping; entry from PTL3 describing the mapping otherwise.
 */
pte_t *pt_mapping_find(as_t *as, __address page)
{
    pte_t *ptl0, *ptl1, *ptl2, *ptl3;
 
    ptl0 = (pte_t *) PA2KA((__address) as->page_table);
 
    if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT)
        return NULL;
 
    ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page)));
 
    if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT)
        return NULL;
 
    ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page)));
 
    if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT)
        return NULL;
 
    ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page)));
 
    return &ptl3[PTL3_INDEX(page)];
}
 

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/genarch/src/mm/page_pt.c – Rev 755 → 756

Rev 755		Rev 756
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_pt.h>	29	#include <genarch/mm/page_pt.h>
30	#include <mm/page.h>	30	#include <mm/page.h>
31	#include <mm/frame.h>	31	#include <mm/frame.h>
-		32	#include <mm/as.h>
32	#include <arch/mm/page.h>	33	#include <arch/mm/page.h>
33	#include <arch/mm/as.h>	34	#include <arch/mm/as.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 <memstr.h>	38	#include <memstr.h>
38		39
39	static void pt_mapping_insert(as_t *as, __address page, __address frame, int flags, __address root);	40	static void pt_mapping_insert(as_t *as, __address page, __address frame, int flags);
40	static pte_t pt_mapping_find(as_t as, __address page, __address root);	41	static pte_t pt_mapping_find(as_t as, __address page);
41		42
42	page_operations_t page_pt_operations = {	43	page_operations_t page_pt_operations = {
43	.mapping_insert = pt_mapping_insert,	44	.mapping_insert = pt_mapping_insert,
44	.mapping_find = pt_mapping_find	45	.mapping_find = pt_mapping_find
45	};	46	};
46		47
47	/** Map page to frame using hierarchical page tables.	48	/** Map page to frame using hierarchical page tables.
48	*	49	*
49	* Map virtual address 'page' to physical address 'frame'	50	* Map virtual address 'page' to physical address 'frame'
50	* using 'flags'.	51	* using 'flags'.
51	*	52	*
-		53	* The address space must be locked and interrupts must be disabled.
-		54	*
52	* @param as Ignored.	55	* @param as Address space to wich page belongs.
53	* @param page Virtual address of the page to be mapped.	56	* @param page Virtual address of the page to be mapped.
54	* @param frame Physical address of memory frame to which the mapping is done.	57	* @param frame Physical address of memory frame to which the mapping is done.
55	* @param flags Flags to be used for mapping.	58	* @param flags Flags to be used for mapping.
56	* @param root Explicit PTL0 address.	-
57	*/	59	*/
58	void pt_mapping_insert(as_t *as, __address page, __address frame, int flags, __address root)	60	void pt_mapping_insert(as_t *as, __address page, __address frame, int flags)
59	{	61	{
60	pte_t ptl0, ptl1, ptl2, ptl3;	62	pte_t ptl0, ptl1, ptl2, ptl3;
61	__address newpt;	63	__address newpt;
62		64
63	ptl0 = (pte_t *) PA2KA(root ? root : (__address) GET_PTL0_ADDRESS());	65	ptl0 = (pte_t *) PA2KA((__address) as->page_table);
64		66
65	if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT) {	67	if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT) {
66	newpt = frame_alloc(FRAME_KA, ONE_FRAME, NULL);	68	newpt = frame_alloc(FRAME_KA, ONE_FRAME, NULL);
67	memsetb(newpt, PAGE_SIZE, 0);	69	memsetb(newpt, PAGE_SIZE, 0);
68	SET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page), KA2PA(newpt));	70	SET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page), KA2PA(newpt));
69	SET_PTL1_FLAGS(ptl0, PTL0_INDEX(page), PAGE_PRESENT \| PAGE_USER \| PAGE_EXEC \| PAGE_CACHEABLE \| PAGE_WRITE);	71	SET_PTL1_FLAGS(ptl0, PTL0_INDEX(page), PAGE_PRESENT \| PAGE_USER \| PAGE_EXEC \| PAGE_CACHEABLE \| PAGE_WRITE);
70	}	72	}
71		73
72	ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page)));	74	ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page)));
73		75
74	if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT) {	76	if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT) {
75	newpt = frame_alloc(FRAME_KA, ONE_FRAME, NULL);	77	newpt = frame_alloc(FRAME_KA, ONE_FRAME, NULL);
76	memsetb(newpt, PAGE_SIZE, 0);	78	memsetb(newpt, PAGE_SIZE, 0);
77	SET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page), KA2PA(newpt));	79	SET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page), KA2PA(newpt));
78	SET_PTL2_FLAGS(ptl1, PTL1_INDEX(page), PAGE_PRESENT \| PAGE_USER \| PAGE_EXEC \| PAGE_CACHEABLE \| PAGE_WRITE);	80	SET_PTL2_FLAGS(ptl1, PTL1_INDEX(page), PAGE_PRESENT \| PAGE_USER \| PAGE_EXEC \| PAGE_CACHEABLE \| PAGE_WRITE);
79	}	81	}
80		82
81	ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page)));	83	ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page)));
82		84
83	if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT) {	85	if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT) {
84	newpt = frame_alloc(FRAME_KA, ONE_FRAME, NULL);	86	newpt = frame_alloc(FRAME_KA, ONE_FRAME, NULL);
85	memsetb(newpt, PAGE_SIZE, 0);	87	memsetb(newpt, PAGE_SIZE, 0);
86	SET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page), KA2PA(newpt));	88	SET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page), KA2PA(newpt));
87	SET_PTL3_FLAGS(ptl2, PTL2_INDEX(page), PAGE_PRESENT \| PAGE_USER \| PAGE_EXEC \| PAGE_CACHEABLE \| PAGE_WRITE);	89	SET_PTL3_FLAGS(ptl2, PTL2_INDEX(page), PAGE_PRESENT \| PAGE_USER \| PAGE_EXEC \| PAGE_CACHEABLE \| PAGE_WRITE);
88	}	90	}
89		91
90	ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page)));	92	ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page)));
91		93
92	SET_FRAME_ADDRESS(ptl3, PTL3_INDEX(page), frame);	94	SET_FRAME_ADDRESS(ptl3, PTL3_INDEX(page), frame);
93	SET_FRAME_FLAGS(ptl3, PTL3_INDEX(page), flags);	95	SET_FRAME_FLAGS(ptl3, PTL3_INDEX(page), flags);
94	}	96	}
95		97
96	/** Find mapping for virtual page in hierarchical page tables.	98	/** Find mapping for virtual page in hierarchical page tables.
97	*	99	*
98	* Find mapping for virtual page.	100	* Find mapping for virtual page.
99	*	101	*
-		102	* The address space must be locked and interrupts must be disabled.
-		103	*
100	* @param as Ignored.	104	* @param as Address space to which page belongs.
101	* @param page Virtual page.	105	* @param page Virtual page.
102	* @param root PTL0 address if non-zero.	-
103	*	106	*
104	* @return NULL if there is no such mapping; entry from PTL3 describing the mapping otherwise.	107	* @return NULL if there is no such mapping; entry from PTL3 describing the mapping otherwise.
105	*/	108	*/
106	pte_t pt_mapping_find(as_t as, __address page, __address root)	109	pte_t pt_mapping_find(as_t as, __address page)
107	{	110	{
108	pte_t ptl0, ptl1, ptl2, ptl3;	111	pte_t ptl0, ptl1, ptl2, ptl3;
109		112
110	ptl0 = (pte_t *) PA2KA(root ? root : (__address) GET_PTL0_ADDRESS());	113	ptl0 = (pte_t *) PA2KA((__address) as->page_table);
111		114
112	if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT)	115	if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT)
113	return NULL;	116	return NULL;
114		117
115	ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page)));	118	ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page)));
116		119
117	if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT)	120	if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT)
118	return NULL;	121	return NULL;
119		122
120	ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page)));	123	ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page)));
121		124
122	if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT)	125	if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT)
123	return NULL;	126	return NULL;
124		127
125	ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page)));	128	ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page)));
126		129
127	return &ptl3[PTL3_INDEX(page)];	130	return &ptl3[PTL3_INDEX(page)];
128	}	131	}
129		132