WebSVN – HelenOS-historic – Diff – /kernel/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 <arch/mm/page.h>
#include <arch/mm/asid.h>
#include <mm/asid.h>
#include <mm/frame.h>
#include <arch/types.h>
#include <typedefs.h>
#include <arch/asm.h>
#include <memstr.h>
#include <debug.h>
#include <arch.h>
 
/** Virtual operations for page subsystem. */
page_operations_t *page_operations = NULL;
 
void page_init(void)
{
    page_arch_init();
    page_mapping_insert(0x0, 0, 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, ASID_KERNEL, 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 asid Address space to wich page belongs.
 * @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, asid_t asid, __address frame, int flags, __address root)
{
    ASSERT(page_operations);
    ASSERT(page_operations->mapping_insert);
   
    page_operations->mapping_insert(page, asid, frame, flags, root);
}
 
/** Find mapping for virtual page
 *
 * Find mapping for virtual page.
 *
 * @param page Virtual page.
 * @param asid Address space to wich page belongs.
 * @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,  asid_t asid, __address root)
{
    ASSERT(page_operations);
    ASSERT(page_operations->mapping_find);
 
    return page_operations->mapping_find(page, asid, root);
}
 

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/mm/page.c @ 1222 – Rev 684 → 687

Rev 684		Rev 687
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>	-
31	#include <arch/mm/page.h>	30	#include <arch/mm/page.h>
-		31	#include <arch/mm/asid.h>
-		32	#include <mm/asid.h>
-		33	#include <mm/frame.h>
32	#include <arch/types.h>	34	#include <arch/types.h>
33	#include <typedefs.h>	35	#include <typedefs.h>
34	#include <arch/asm.h>	36	#include <arch/asm.h>
35	#include <memstr.h>	37	#include <memstr.h>
36	#include <debug.h>	38	#include <debug.h>
-		39	#include <arch.h>
37		40
38	/** Virtual operations for page subsystem. */	41	/** Virtual operations for page subsystem. */
39	page_operations_t *page_operations = NULL;	42	page_operations_t *page_operations = NULL;
40		43
41	void page_init(void)	44	void page_init(void)
42	{	45	{
43	page_arch_init();	46	page_arch_init();
44	page_mapping_insert(0x0, 0x0, PAGE_NOT_PRESENT, 0);	47	page_mapping_insert(0x0, 0, 0x0, PAGE_NOT_PRESENT, 0);
45	}	48	}
46		49
47	/** Map memory structure	50	/** Map memory structure
48	*	51	*
49	* Identity-map memory structure	52	* Identity-map memory structure
50	* considering possible crossings	53	* considering possible crossings
51	* of page boundaries.	54	* of page boundaries.
52	*	55	*
53	* @param s Address of the structure.	56	* @param s Address of the structure.
54	* @param size Size of the structure.	57	* @param size Size of the structure.
55	*/	58	*/
56	void map_structure(__address s, size_t size)	59	void map_structure(__address s, size_t size)
57	{	60	{
58	int i, cnt, length;	61	int i, cnt, length;
59		62
60	length = size + (s - (s & ~(PAGE_SIZE-1)));	63	length = size + (s - (s & ~(PAGE_SIZE-1)));
61	cnt = length/PAGE_SIZE + (length%PAGE_SIZE>0);	64	cnt = length/PAGE_SIZE + (length%PAGE_SIZE>0);
62		65
63	for (i = 0; i < cnt; i++)	66	for (i = 0; i < cnt; i++)
64	page_mapping_insert(s + iPAGE_SIZE, s + iPAGE_SIZE, PAGE_NOT_CACHEABLE, 0);	67	page_mapping_insert(s + iPAGE_SIZE, ASID_KERNEL, s + iPAGE_SIZE, PAGE_NOT_CACHEABLE, 0);
65		68
66	}	69	}
67		70
68	/** Map page to frame	71	/** Map page to frame
69	*	72	*
70	* Map virtual address 'page' to physical address 'frame'	73	* Map virtual address 'page' to physical address 'frame'
71	* using 'flags'. Allocate and setup any missing page tables.	74	* using 'flags'. Allocate and setup any missing page tables.
72	*	75	*
73	* @param page Virtual address of the page to be mapped.	76	* @param page Virtual address of the page to be mapped.
-		77	* @param asid Address space to wich page belongs.
74	* @param frame Physical address of memory frame to which the mapping is done.	78	* @param frame Physical address of memory frame to which the mapping is done.
75	* @param flags Flags to be used for mapping.	79	* @param flags Flags to be used for mapping.
76	* @param root Explicit PTL0 address.	80	* @param root Explicit PTL0 address.
77	*/	81	*/
78	void page_mapping_insert(__address page, __address frame, int flags, __address root)	82	void page_mapping_insert(__address page, asid_t asid, __address frame, int flags, __address root)
79	{	83	{
80	ASSERT(page_operations);	84	ASSERT(page_operations);
81	ASSERT(page_operations->mapping_insert);	85	ASSERT(page_operations->mapping_insert);
82		86
83	page_operations->mapping_insert(page, frame, flags, root);	87	page_operations->mapping_insert(page, asid, frame, flags, root);
84	}	88	}
85		89
86	/** Find mapping for virtual page	90	/** Find mapping for virtual page
87	*	91	*
88	* Find mapping for virtual page.	92	* Find mapping for virtual page.
89	*	93	*
90	* @param page Virtual page.	94	* @param page Virtual page.
-		95	* @param asid Address space to wich page belongs.
91	* @param root PTL0 address if non-zero.	96	* @param root PTL0 address if non-zero.
92	*	97	*
93	* @return NULL if there is no such mapping; entry from PTL3 describing the mapping otherwise.	98	* @return NULL if there is no such mapping; entry from PTL3 describing the mapping otherwise.
94	*/	99	*/
95	pte_t *page_mapping_find(__address page, __address root)	100	pte_t *page_mapping_find(__address page, asid_t asid, __address root)
96	{	101	{
97	ASSERT(page_operations);	102	ASSERT(page_operations);
98	ASSERT(page_operations->mapping_find);	103	ASSERT(page_operations->mapping_find);
99		104
100	return page_operations->mapping_find(page, root);	105	return page_operations->mapping_find(page, asid, root);
101	}	106	}
102		107