WebSVN – HelenOS-historic – Diff – /SPARTAN/trunk/generic/src/mm/page.c


/*
 * Copyright (C) 2001-2004 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 <mm/page.h>
#include <mm/frame.h>
#include <arch/mm/page.h>
#include <arch/types.h>
#include <typedefs.h>
#include <arch/asm.h>
#include <memstr.h>
 
void page_init(void)
{
    page_arch_init();
    page_mapping_insert(0x0, 0x0, PAGE_NOT_PRESENT, 0);
}
 
/** Map memory structure
 *
 * Identity-map memory structure
 * considering possible crossings
 * of page boundaries.
 *
 * @param s Address of the structure.
 * @param size Size of the structure.
 */
void map_structure(__address s, size_t size)
{
    int i, cnt, length;
 
    length = size + (s - (s & ~(PAGE_SIZE-1)));
    cnt = length/PAGE_SIZE + (length%PAGE_SIZE>0);
 
    for (i = 0; i < cnt; i++)
        page_mapping_insert(s + i*PAGE_SIZE, s + i*PAGE_SIZE, PAGE_NOT_CACHEABLE, 0);
 
}
 
/** Map page to frame
 *
 * Map virtual address 'page' to physical address 'frame'
 * using 'flags'. Allocate and setup any missing page tables.
 *
 * @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.
 * @param root Explicit PTL0 address.
 */
void page_mapping_insert(__address page, __address frame, int flags, __address root)
{
    pte_t *ptl0, *ptl1, *ptl2, *ptl3;
    __address newpt;
 
    ptl0 = (pte_t *) PA2KA(root ? root : (__address) GET_PTL0_ADDRESS());
 
    if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT) {
        newpt = frame_alloc(FRAME_KA);
        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);
    }
 
    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);
        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);
    }
 
    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);
        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);
    }
 
    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
 *
 * Find mapping for virtual page.
 *
 * @param page Virtual page.
 * @param root PTL0 address if non-zero.
 *
 * @return NULL if there is no such mapping; entry from PTL3 describing the mapping otherwise.
 */
pte_t *page_mapping_find(__address page, __address root)
{
    pte_t *ptl0, *ptl1, *ptl2, *ptl3;
 
    ptl0 = (pte_t *) PA2KA(root ? root : (__address) GET_PTL0_ADDRESS());
 
    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)/SPARTAN/trunk/generic/src/mm/page.c – Rev 430 → 492

Rev 430		Rev 492
1	/*	1	/*
2	* Copyright (C) 2001-2004 Jakub Jermar	2	* Copyright (C) 2001-2004 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 <mm/page.h>	29	#include <mm/page.h>
30	#include <mm/frame.h>	30	#include <mm/frame.h>
31	#include <arch/mm/page.h>	31	#include <arch/mm/page.h>
32	#include <arch/types.h>	32	#include <arch/types.h>
33	#include <typedefs.h>	33	#include <typedefs.h>
34	#include <arch/asm.h>	34	#include <arch/asm.h>
35	#include <memstr.h>	35	#include <memstr.h>
36		36
37	void page_init(void)	37	void page_init(void)
38	{	38	{
39	page_arch_init();	39	page_arch_init();
40	map_page_to_frame(0x0, 0x0, PAGE_NOT_PRESENT, 0);	40	page_mapping_insert(0x0, 0x0, PAGE_NOT_PRESENT, 0);
41	}	41	}
42		42
43	/** Map memory structure	43	/** Map memory structure
44	*	44	*
45	* Identity-map memory structure	45	* Identity-map memory structure
46	* considering possible crossings	46	* considering possible crossings
47	* of page boundaries.	47	* of page boundaries.
48	*	48	*
49	* @param s Address of the structure.	49	* @param s Address of the structure.
50	* @param size Size of the structure.	50	* @param size Size of the structure.
51	*/	51	*/
52	void map_structure(__address s, size_t size)	52	void map_structure(__address s, size_t size)
53	{	53	{
54	int i, cnt, length;	54	int i, cnt, length;
55		55
56	length = size + (s - (s & ~(PAGE_SIZE-1)));	56	length = size + (s - (s & ~(PAGE_SIZE-1)));
57	cnt = length/PAGE_SIZE + (length%PAGE_SIZE>0);	57	cnt = length/PAGE_SIZE + (length%PAGE_SIZE>0);
58		58
59	for (i = 0; i < cnt; i++)	59	for (i = 0; i < cnt; i++)
60	map_page_to_frame(s + iPAGE_SIZE, s + iPAGE_SIZE, PAGE_NOT_CACHEABLE, 0);	60	page_mapping_insert(s + iPAGE_SIZE, s + iPAGE_SIZE, PAGE_NOT_CACHEABLE, 0);
61		61
62	}	62	}
63		63
64	/** Map page to frame	64	/** Map page to frame
65	*	65	*
66	* Map virtual address 'page' to physical address 'frame'	66	* Map virtual address 'page' to physical address 'frame'
67	* using 'flags'. Allocate and setup any missing page tables.	67	* using 'flags'. Allocate and setup any missing page tables.
68	*	68	*
69	* @param page Virtual address of the page to be mapped.	69	* @param page Virtual address of the page to be mapped.
70	* @param frame Physical address of memory frame to which the mapping is done.	70	* @param frame Physical address of memory frame to which the mapping is done.
71	* @param flags Flags to be used for mapping.	71	* @param flags Flags to be used for mapping.
72	* @param root Explicit PTL0 address.	72	* @param root Explicit PTL0 address.
73	*/	73	*/
74	void map_page_to_frame(__address page, __address frame, int flags, __address root)	74	void page_mapping_insert(__address page, __address frame, int flags, __address root)
75	{	75	{
76	pte_t ptl0, ptl1, ptl2, ptl3;	76	pte_t ptl0, ptl1, ptl2, ptl3;
77	__address newpt;	77	__address newpt;
78		78
79	ptl0 = (pte_t *) PA2KA(root ? root : (__address) GET_PTL0_ADDRESS());	79	ptl0 = (pte_t *) PA2KA(root ? root : (__address) GET_PTL0_ADDRESS());
80		80
81	if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT) {	81	if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT) {
82	newpt = frame_alloc(FRAME_KA);	82	newpt = frame_alloc(FRAME_KA);
83	memsetb(newpt, PAGE_SIZE, 0);	83	memsetb(newpt, PAGE_SIZE, 0);
84	SET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page), KA2PA(newpt));	84	SET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page), KA2PA(newpt));
85	SET_PTL1_FLAGS(ptl0, PTL0_INDEX(page), PAGE_PRESENT \| PAGE_USER \| PAGE_EXEC);	85	SET_PTL1_FLAGS(ptl0, PTL0_INDEX(page), PAGE_PRESENT \| PAGE_USER \| PAGE_EXEC);
86	}	86	}
87		87
88	ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page)));	88	ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page)));
89		89
90	if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT) {	90	if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT) {
91	newpt = frame_alloc(FRAME_KA);	91	newpt = frame_alloc(FRAME_KA);
92	memsetb(newpt, PAGE_SIZE, 0);	92	memsetb(newpt, PAGE_SIZE, 0);
93	SET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page), KA2PA(newpt));	93	SET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page), KA2PA(newpt));
94	SET_PTL2_FLAGS(ptl1, PTL1_INDEX(page), PAGE_PRESENT \| PAGE_USER \| PAGE_EXEC);	94	SET_PTL2_FLAGS(ptl1, PTL1_INDEX(page), PAGE_PRESENT \| PAGE_USER \| PAGE_EXEC);
95	}	95	}
96		96
97	ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page)));	97	ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page)));
98		98
99	if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT) {	99	if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT) {
100	newpt = frame_alloc(FRAME_KA);	100	newpt = frame_alloc(FRAME_KA);
101	memsetb(newpt, PAGE_SIZE, 0);	101	memsetb(newpt, PAGE_SIZE, 0);
102	SET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page), KA2PA(newpt));	102	SET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page), KA2PA(newpt));
103	SET_PTL3_FLAGS(ptl2, PTL2_INDEX(page), PAGE_PRESENT \| PAGE_USER \| PAGE_EXEC);	103	SET_PTL3_FLAGS(ptl2, PTL2_INDEX(page), PAGE_PRESENT \| PAGE_USER \| PAGE_EXEC);
104	}	104	}
105		105
106	ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page)));	106	ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page)));
107		107
108	SET_FRAME_ADDRESS(ptl3, PTL3_INDEX(page), frame);	108	SET_FRAME_ADDRESS(ptl3, PTL3_INDEX(page), frame);
109	SET_FRAME_FLAGS(ptl3, PTL3_INDEX(page), flags);	109	SET_FRAME_FLAGS(ptl3, PTL3_INDEX(page), flags);
110	}	110	}
111		111
112	/** Find mapping for virtual page	112	/** Find mapping for virtual page
113	*	113	*
114	* Find mapping for virtual page.	114	* Find mapping for virtual page.
115	*	115	*
116	* @param page Virtual page.	116	* @param page Virtual page.
117	* @param root PTL0 address if non-zero.	117	* @param root PTL0 address if non-zero.
118	*	118	*
119	* @return NULL if there is no such mapping; entry from PTL3 describing the mapping otherwise.	119	* @return NULL if there is no such mapping; entry from PTL3 describing the mapping otherwise.
120	*/	120	*/
121	pte_t *find_mapping(__address page, __address root)	121	pte_t *page_mapping_find(__address page, __address root)
122	{	122	{
123	pte_t ptl0, ptl1, ptl2, ptl3;	123	pte_t ptl0, ptl1, ptl2, ptl3;
124		124
125	ptl0 = (pte_t *) PA2KA(root ? root : (__address) GET_PTL0_ADDRESS());	125	ptl0 = (pte_t *) PA2KA(root ? root : (__address) GET_PTL0_ADDRESS());
126		126
127	if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT)	127	if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT)
128	return NULL;	128	return NULL;
129		129
130	ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page)));	130	ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page)));
131		131
132	if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT)	132	if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT)
133	return NULL;	133	return NULL;
134		134
135	ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page)));	135	ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page)));
136		136
137	if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT)	137	if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT)
138	return NULL;	138	return NULL;
139		139
140	ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page)));	140	ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page)));
141		141
142	return &ptl3[PTL3_INDEX(page)];	142	return &ptl3[PTL3_INDEX(page)];
143	}	143	}
144		144