1 | /*
|
---|
2 | * Copyright (c) 2001-2006 Jakub Jermar
|
---|
3 | * All rights reserved.
|
---|
4 | *
|
---|
5 | * Redistribution and use in source and binary forms, with or without
|
---|
6 | * modification, are permitted provided that the following conditions
|
---|
7 | * are met:
|
---|
8 | *
|
---|
9 | * - Redistributions of source code must retain the above copyright
|
---|
10 | * notice, this list of conditions and the following disclaimer.
|
---|
11 | * - Redistributions in binary form must reproduce the above copyright
|
---|
12 | * notice, this list of conditions and the following disclaimer in the
|
---|
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
|
---|
15 | * derived from this software without specific prior written permission.
|
---|
16 | *
|
---|
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
|
---|
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
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
|
---|
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
|
---|
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
27 | */
|
---|
28 |
|
---|
29 | /** @addtogroup genericmm
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 |
|
---|
33 | /**
|
---|
34 | * @file
|
---|
35 | * @brief Virtual Address Translation subsystem.
|
---|
36 | *
|
---|
37 | * This file contains code for creating, destroying and searching
|
---|
38 | * mappings between virtual addresses and physical addresses.
|
---|
39 | * Functions here are mere wrappers that call the real implementation.
|
---|
40 | * They however, define the single interface.
|
---|
41 | */
|
---|
42 |
|
---|
43 | #include <mm/page.h>
|
---|
44 | #include <arch/mm/page.h>
|
---|
45 | #include <arch/mm/asid.h>
|
---|
46 | #include <mm/as.h>
|
---|
47 | #include <mm/frame.h>
|
---|
48 | #include <arch/types.h>
|
---|
49 | #include <typedefs.h>
|
---|
50 | #include <arch/asm.h>
|
---|
51 | #include <memstr.h>
|
---|
52 | #include <debug.h>
|
---|
53 | #include <arch.h>
|
---|
54 |
|
---|
55 | /** Virtual operations for page subsystem. */
|
---|
56 | page_mapping_operations_t *page_mapping_operations = NULL;
|
---|
57 |
|
---|
58 | void page_init(void)
|
---|
59 | {
|
---|
60 | page_arch_init();
|
---|
61 | }
|
---|
62 |
|
---|
63 | /** Map memory structure
|
---|
64 | *
|
---|
65 | * Identity-map memory structure
|
---|
66 | * considering possible crossings
|
---|
67 | * of page boundaries.
|
---|
68 | *
|
---|
69 | * @param s Address of the structure.
|
---|
70 | * @param size Size of the structure.
|
---|
71 | */
|
---|
72 | void map_structure(uintptr_t s, size_t size)
|
---|
73 | {
|
---|
74 | int i, cnt, length;
|
---|
75 |
|
---|
76 | length = size + (s - (s & ~(PAGE_SIZE - 1)));
|
---|
77 | cnt = length / PAGE_SIZE + (length % PAGE_SIZE > 0);
|
---|
78 |
|
---|
79 | for (i = 0; i < cnt; i++)
|
---|
80 | page_mapping_insert(AS_KERNEL, s + i * PAGE_SIZE, s + i * PAGE_SIZE, PAGE_NOT_CACHEABLE);
|
---|
81 |
|
---|
82 | }
|
---|
83 |
|
---|
84 | /** Insert mapping of page to frame.
|
---|
85 | *
|
---|
86 | * Map virtual address page to physical address frame
|
---|
87 | * using flags. Allocate and setup any missing page tables.
|
---|
88 | *
|
---|
89 | * The page table must be locked and interrupts must be disabled.
|
---|
90 | *
|
---|
91 | * @param as Address space to wich page belongs.
|
---|
92 | * @param page Virtual address of the page to be mapped.
|
---|
93 | * @param frame Physical address of memory frame to which the mapping is done.
|
---|
94 | * @param flags Flags to be used for mapping.
|
---|
95 | */
|
---|
96 | void page_mapping_insert(as_t *as, uintptr_t page, uintptr_t frame, int flags)
|
---|
97 | {
|
---|
98 | ASSERT(page_mapping_operations);
|
---|
99 | ASSERT(page_mapping_operations->mapping_insert);
|
---|
100 |
|
---|
101 | page_mapping_operations->mapping_insert(as, page, frame, flags);
|
---|
102 | }
|
---|
103 |
|
---|
104 | /** Remove mapping of page.
|
---|
105 | *
|
---|
106 | * Remove any mapping of page within address space as.
|
---|
107 | * TLB shootdown should follow in order to make effects of
|
---|
108 | * this call visible.
|
---|
109 | *
|
---|
110 | * The page table must be locked and interrupts must be disabled.
|
---|
111 | *
|
---|
112 | * @param as Address space to wich page belongs.
|
---|
113 | * @param page Virtual address of the page to be demapped.
|
---|
114 | */
|
---|
115 | void page_mapping_remove(as_t *as, uintptr_t page)
|
---|
116 | {
|
---|
117 | ASSERT(page_mapping_operations);
|
---|
118 | ASSERT(page_mapping_operations->mapping_remove);
|
---|
119 |
|
---|
120 | page_mapping_operations->mapping_remove(as, page);
|
---|
121 | }
|
---|
122 |
|
---|
123 | /** Find mapping for virtual page
|
---|
124 | *
|
---|
125 | * Find mapping for virtual page.
|
---|
126 | *
|
---|
127 | * The page table must be locked and interrupts must be disabled.
|
---|
128 | *
|
---|
129 | * @param as Address space to wich page belongs.
|
---|
130 | * @param page Virtual page.
|
---|
131 | *
|
---|
132 | * @return NULL if there is no such mapping; requested mapping otherwise.
|
---|
133 | */
|
---|
134 | pte_t *page_mapping_find(as_t *as, uintptr_t page)
|
---|
135 | {
|
---|
136 | ASSERT(page_mapping_operations);
|
---|
137 | ASSERT(page_mapping_operations->mapping_find);
|
---|
138 |
|
---|
139 | return page_mapping_operations->mapping_find(as, page);
|
---|
140 | }
|
---|
141 |
|
---|
142 | /** @}
|
---|
143 | */
|
---|