Rev 1702 | Rev 1770 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1702 | Rev 1760 | ||
---|---|---|---|
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 <bitops.h> |
39 | #include <bitops.h> |
40 | #include <debug.h> |
40 | #include <debug.h> |
41 | 41 | ||
42 | void page_arch_init(void) |
42 | void page_arch_init(void) |
43 | { |
43 | { |
44 | page_mapping_operations = &ht_mapping_operations; |
44 | page_mapping_operations = &ht_mapping_operations; |
45 | } |
45 | } |
46 | 46 | ||
47 | __address hw_map(__address physaddr, size_t size) |
47 | __address hw_map(__address physaddr, size_t size) |
48 | { |
48 | { |
49 | unsigned int order; |
49 | unsigned int order; |
50 | int i; |
50 | int i; |
51 | 51 | ||
52 | struct { |
52 | struct { |
53 | int pagesize; |
53 | int pagesize; |
54 | size_t increment; |
54 | size_t increment; |
55 | count_t count; |
55 | count_t count; |
56 | } sizemap[] = { |
56 | } sizemap[] = { |
57 | { PAGESIZE_8K, 0, 1 }, /* 8K */ |
57 | { PAGESIZE_8K, 0, 1 }, /* 8K */ |
58 | { PAGESIZE_8K, PAGE_SIZE, 2 }, /* 16K */ |
58 | { PAGESIZE_8K, PAGE_SIZE, 2 }, /* 16K */ |
59 | { PAGESIZE_8K, PAGE_SIZE, 4 }, /* 32K */ |
59 | { PAGESIZE_8K, PAGE_SIZE, 4 }, /* 32K */ |
60 | { PAGESIZE_64K, 0, 1}, /* 64K */ |
60 | { PAGESIZE_64K, 0, 1}, /* 64K */ |
61 | { PAGESIZE_64K, 8*PAGE_SIZE, 2 }, /* 128K */ |
61 | { PAGESIZE_64K, 8*PAGE_SIZE, 2 }, /* 128K */ |
62 | { PAGESIZE_64K, 8*PAGE_SIZE, 4 }, /* 256K */ |
62 | { PAGESIZE_64K, 8*PAGE_SIZE, 4 }, /* 256K */ |
63 | { PAGESIZE_512K, 0, 1 }, /* 512K */ |
63 | { PAGESIZE_512K, 0, 1 }, /* 512K */ |
64 | { PAGESIZE_512K, 64*PAGE_SIZE, 2 }, /* 1M */ |
64 | { PAGESIZE_512K, 64*PAGE_SIZE, 2 }, /* 1M */ |
65 | { PAGESIZE_512K, 64*PAGE_SIZE, 4 }, /* 2M */ |
65 | { PAGESIZE_512K, 64*PAGE_SIZE, 4 }, /* 2M */ |
66 | { PAGESIZE_4M, 0, 1 } /* 4M */ |
66 | { PAGESIZE_4M, 0, 1 } /* 4M */ |
67 | }; |
67 | }; |
68 | 68 | ||
69 | ASSERT(size <= 4*1024*1024); |
69 | ASSERT(size <= 4*1024*1024); |
70 | 70 | ||
71 | if (size <= FRAME_SIZE) |
71 | if (size <= FRAME_SIZE) |
72 | order = 0; |
72 | order = 0; |
73 | else |
73 | else |
74 | order = (fnzb32(size - 1) + 1) - FRAME_WIDTH; |
74 | order = (fnzb32(size - 1) + 1) - FRAME_WIDTH; |
75 | 75 | ||
76 | __address virtaddr = PA2KA(PFN2ADDR(frame_alloc(order, FRAME_KA))); |
76 | __address virtaddr = frame_alloc(order, FRAME_KA); |
77 | 77 | ||
78 | for (i = 0; i < sizemap[order].count; i++) |
78 | for (i = 0; i < sizemap[order].count; i++) |
79 | dtlb_insert_mapping(virtaddr + i*sizemap[order].increment, |
79 | dtlb_insert_mapping(virtaddr + i*sizemap[order].increment, |
80 | physaddr + i*sizemap[order].increment, |
80 | physaddr + i*sizemap[order].increment, |
81 | sizemap[order].pagesize, true, false); |
81 | sizemap[order].pagesize, true, false); |
82 | 82 | ||
83 | return virtaddr; |
83 | return virtaddr; |
84 | } |
84 | } |
85 | 85 | ||
86 | /** @} |
86 | /** @} |
87 | */ |
87 | */ |
88 | 88 | ||
89 | 89 |