WebSVN – HelenOS – Diff – /branches/sparc/kernel/arch/sparc64/src/mm/page.c


/*
 * Copyright (C) 2005 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.
 */
 
/** @addtogroup sparc64mm  
 * @{
 */
/** @file
 */
 
#include <arch/mm/page.h>
#include <arch/mm/tlb.h>
#include <genarch/mm/page_ht.h>
#include <mm/frame.h>
#include <arch/mm/frame.h>
#include <bitops.h>
#include <debug.h>
#include <align.h>
 
void page_arch_init(void)
{
    page_mapping_operations = &ht_mapping_operations;
}
 
uintptr_t hw_map(uintptr_t physaddr, size_t size)
{
    unsigned int order;
    int i;
 
    struct {
        int pagesize;
        size_t increment;
        count_t count;
    } sizemap[] = {
        { PAGESIZE_8K, 0, 1 },          /* 8K */
        { PAGESIZE_8K, PAGE_SIZE, 2 },      /* 16K */
        { PAGESIZE_8K, PAGE_SIZE, 4 },      /* 32K */
        { PAGESIZE_64K, 0, 1},          /* 64K */
        { PAGESIZE_64K, 8*PAGE_SIZE, 2 },   /* 128K */
        { PAGESIZE_64K, 8*PAGE_SIZE, 4 },   /* 256K */
        { PAGESIZE_512K, 0, 1 },        /* 512K */
        { PAGESIZE_512K, 64*PAGE_SIZE, 2 }, /* 1M */
        { PAGESIZE_512K, 64*PAGE_SIZE, 4 }, /* 2M */
        { PAGESIZE_4M, 0, 1 }           /* 4M */
    };
   
    ASSERT(size <= 4*1024*1024);
   
    if (size <= FRAME_SIZE)
        order = 0;
    else
        order = (fnzb32(size - 1) + 1) - FRAME_WIDTH;
 
 
 
    /*
     * Use virtual addresses that are beyond the limit of physical memory.
     * Thus, the physical address space will not be wasted by holes created
     * by frame_alloc().
     */
    ASSERT(last_frame);
    uintptr_t virtaddr = ALIGN_UP(last_frame, 1<<(order + FRAME_WIDTH));
    last_frame = ALIGN_UP(virtaddr + size, 1<<(order + FRAME_WIDTH));
   
    for (i = 0; i < sizemap[order].count; i++)
        dtlb_insert_mapping(virtaddr + i*sizemap[order].increment,
                    physaddr + i*sizemap[order].increment,
                    sizemap[order].pagesize, true, false);
   
    return virtaddr;
}
 
/** @}
 */
 
 

Rev 1787	Rev 1793
1	/*	1	/*
2	* Copyright (C) 2005 Jakub Jermar	2	* Copyright (C) 2005 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	/** @addtogroup sparc64mm	29	/** @addtogroup sparc64mm
30	* @{	30	* @{
31	*/	31	*/
32	/** @file	32	/** @file
33	*/	33	*/
34		34
35	#include <arch/mm/page.h>	35	#include <arch/mm/page.h>
36	#include <arch/mm/tlb.h>	36	#include <arch/mm/tlb.h>
37	#include <genarch/mm/page_ht.h>	37	#include <genarch/mm/page_ht.h>
38	#include <mm/frame.h>	38	#include <mm/frame.h>
-		39	#include <arch/mm/frame.h>
39	#include <bitops.h>	40	#include <bitops.h>
40	#include <debug.h>	41	#include <debug.h>
-		42	#include <align.h>
41		43
42	void page_arch_init(void)	44	void page_arch_init(void)
43	{	45	{
44	page_mapping_operations = &ht_mapping_operations;	46	page_mapping_operations = &ht_mapping_operations;
45	}	47	}
46		48
47	uintptr_t hw_map(uintptr_t physaddr, size_t size)	49	uintptr_t hw_map(uintptr_t physaddr, size_t size)
48	{	50	{
49	unsigned int order;	51	unsigned int order;
50	int i;	52	int i;
51		53
52	struct {	54	struct {
53	int pagesize;	55	int pagesize;
54	size_t increment;	56	size_t increment;
55	count_t count;	57	count_t count;
56	} sizemap[] = {	58	} sizemap[] = {
57	{ PAGESIZE_8K, 0, 1 }, /* 8K */	59	{ PAGESIZE_8K, 0, 1 }, /* 8K */
58	{ PAGESIZE_8K, PAGE_SIZE, 2 }, /* 16K */	60	{ PAGESIZE_8K, PAGE_SIZE, 2 }, /* 16K */
59	{ PAGESIZE_8K, PAGE_SIZE, 4 }, /* 32K */	61	{ PAGESIZE_8K, PAGE_SIZE, 4 }, /* 32K */
60	{ PAGESIZE_64K, 0, 1}, /* 64K */	62	{ PAGESIZE_64K, 0, 1}, /* 64K */
61	{ PAGESIZE_64K, 8PAGE_SIZE, 2 }, / 128K */	63	{ PAGESIZE_64K, 8PAGE_SIZE, 2 }, / 128K */
62	{ PAGESIZE_64K, 8PAGE_SIZE, 4 }, / 256K */	64	{ PAGESIZE_64K, 8PAGE_SIZE, 4 }, / 256K */
63	{ PAGESIZE_512K, 0, 1 }, /* 512K */	65	{ PAGESIZE_512K, 0, 1 }, /* 512K */
64	{ PAGESIZE_512K, 64PAGE_SIZE, 2 }, / 1M */	66	{ PAGESIZE_512K, 64PAGE_SIZE, 2 }, / 1M */
65	{ PAGESIZE_512K, 64PAGE_SIZE, 4 }, / 2M */	67	{ PAGESIZE_512K, 64PAGE_SIZE, 4 }, / 2M */
66	{ PAGESIZE_4M, 0, 1 } /* 4M */	68	{ PAGESIZE_4M, 0, 1 } /* 4M */
67	};	69	};
68		70
69	ASSERT(size <= 410241024);	71	ASSERT(size <= 410241024);
70		72
71	if (size <= FRAME_SIZE)	73	if (size <= FRAME_SIZE)
72	order = 0;	74	order = 0;
73	else	75	else
74	order = (fnzb32(size - 1) + 1) - FRAME_WIDTH;	76	order = (fnzb32(size - 1) + 1) - FRAME_WIDTH;
75		-
76	uintptr_t virtaddr = (uintptr_t) frame_alloc(order, FRAME_KA);	-
77		77
-		78	/*
-		79	* Use virtual addresses that are beyond the limit of physical memory.
-		80	* Thus, the physical address space will not be wasted by holes created
-		81	* by frame_alloc().
-		82	*/
-		83	ASSERT(last_frame);
-		84	uintptr_t virtaddr = ALIGN_UP(last_frame, 1<<(order + FRAME_WIDTH));
-		85	last_frame = ALIGN_UP(virtaddr + size, 1<<(order + FRAME_WIDTH));
-		86
78	for (i = 0; i < sizemap[order].count; i++)	87	for (i = 0; i < sizemap[order].count; i++)
79	dtlb_insert_mapping(virtaddr + i*sizemap[order].increment,	88	dtlb_insert_mapping(virtaddr + i*sizemap[order].increment,
80	physaddr + i*sizemap[order].increment,	89	physaddr + i*sizemap[order].increment,
81	sizemap[order].pagesize, true, false);	90	sizemap[order].pagesize, true, false);
82		91
83	return virtaddr;	92	return virtaddr;
84	}	93	}
85		94
86	/** @}	95	/** @}
87	*/	96	*/
88		-
89		97

Subversion Repositories HelenOS

(root)/branches/sparc/kernel/arch/sparc64/src/mm/page.c @ 3862 – Rev 1787 → 1793