pmap_devmap.c revision 1.2 1 1.2 skrll /* $NetBSD: pmap_devmap.c,v 1.2 2023/04/27 06:23:31 skrll Exp $ */
2 1.1 skrll
3 1.1 skrll /*-
4 1.1 skrll * Copyright (c) 2022 The NetBSD Foundation, Inc.
5 1.1 skrll * All rights reserved.
6 1.1 skrll *
7 1.1 skrll * This code is derived from software contributed to The NetBSD Foundation
8 1.1 skrll * by Nick Hudson
9 1.1 skrll *
10 1.1 skrll * Redistribution and use in source and binary forms, with or without
11 1.1 skrll * modification, are permitted provided that the following conditions
12 1.1 skrll * are met:
13 1.1 skrll * 1. Redistributions of source code must retain the above copyright
14 1.1 skrll * notice, this list of conditions and the following disclaimer.
15 1.1 skrll * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 skrll * notice, this list of conditions and the following disclaimer in the
17 1.1 skrll * documentation and/or other materials provided with the distribution.
18 1.1 skrll *
19 1.1 skrll * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 skrll * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 skrll * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 skrll * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 skrll * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 skrll * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 skrll * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 skrll * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 skrll * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 skrll * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 skrll * POSSIBILITY OF SUCH DAMAGE.
30 1.1 skrll */
31 1.1 skrll
32 1.1 skrll #include <sys/cdefs.h>
33 1.2 skrll __RCSID("$NetBSD: pmap_devmap.c,v 1.2 2023/04/27 06:23:31 skrll Exp $");
34 1.1 skrll
35 1.1 skrll
36 1.1 skrll #include <sys/param.h>
37 1.1 skrll #include <sys/types.h>
38 1.1 skrll
39 1.1 skrll #include <uvm/uvm.h>
40 1.1 skrll #include <uvm/uvm_extern.h>
41 1.1 skrll #include <uvm/pmap/pmap_devmap.h>
42 1.1 skrll
43 1.1 skrll
44 1.1 skrll static const struct pmap_devmap *pd_table;
45 1.1 skrll static vaddr_t pd_root;
46 1.1 skrll
47 1.1 skrll bool pmap_devmap_bootstrap_done = false;
48 1.1 skrll
49 1.1 skrll bool
50 1.1 skrll pmap_devmap_bootstrapped_p(void)
51 1.1 skrll {
52 1.1 skrll return pmap_devmap_bootstrap_done;
53 1.1 skrll }
54 1.1 skrll
55 1.1 skrll
56 1.1 skrll vaddr_t
57 1.1 skrll pmap_devmap_root(void)
58 1.1 skrll {
59 1.1 skrll return pd_root;
60 1.1 skrll }
61 1.1 skrll
62 1.1 skrll /*
63 1.1 skrll * Register the devmap table. This is provided in case early console
64 1.1 skrll * initialization needs to register mappings created by bootstrap code
65 1.1 skrll * before pmap_devmap_bootstrap() is called.
66 1.1 skrll */
67 1.1 skrll void
68 1.1 skrll pmap_devmap_register(const struct pmap_devmap *table)
69 1.1 skrll {
70 1.1 skrll
71 1.1 skrll pd_table = table;
72 1.1 skrll }
73 1.1 skrll
74 1.1 skrll /*
75 1.1 skrll * Map all of the static regions in the devmap table, and remember
76 1.1 skrll * the devmap table so other parts of the kernel can look up entries
77 1.1 skrll * later.
78 1.1 skrll */
79 1.1 skrll void
80 1.1 skrll pmap_devmap_bootstrap(vaddr_t root, const struct pmap_devmap *table)
81 1.1 skrll {
82 1.1 skrll UVMHIST_FUNC(__func__);
83 1.1 skrll UVMHIST_CALLARGS(maphist, "(root=%#jx, table=%p)", root,
84 1.1 skrll (uintptr_t)table, 0, 0);
85 1.1 skrll
86 1.1 skrll bool done = false;
87 1.1 skrll
88 1.1 skrll pd_root = root;
89 1.1 skrll pd_table = table;
90 1.1 skrll
91 1.1 skrll for (size_t i = 0; table[i].pd_size != 0; i++) {
92 1.1 skrll const struct pmap_devmap * const pdp = &table[i];
93 1.1 skrll const vaddr_t vmax = __type_max_u(vaddr_t);
94 1.2 skrll const paddr_t pmax = __type_max_u(paddr_t);
95 1.1 skrll
96 1.1 skrll KASSERT(pdp->pd_size != 0);
97 1.1 skrll KASSERTMSG(vmax - pdp->pd_va >= pdp->pd_size - 1,
98 1.1 skrll "va %" PRIxVADDR " sz %" PRIxPSIZE, pdp->pd_va,
99 1.1 skrll pdp->pd_size);
100 1.1 skrll KASSERTMSG(pmax - pdp->pd_pa >= pdp->pd_size - 1,
101 1.1 skrll "pa %" PRIxPADDR " sz %" PRIxPSIZE, pdp->pd_pa,
102 1.1 skrll pdp->pd_size);
103 1.1 skrll UVMHIST_LOG(maphist,
104 1.1 skrll "pa %#jx -> %#jx @ va %#jx -> %#jx",
105 1.1 skrll pdp->pd_pa, pdp->pd_pa + pdp->pd_size - 1,
106 1.1 skrll pdp->pd_va, pdp->pd_va + pdp->pd_size - 1);
107 1.1 skrll
108 1.1 skrll pmap_kenter_range(pdp->pd_va, pdp->pd_pa, pdp->pd_size,
109 1.1 skrll pdp->pd_prot, pdp->pd_flags);
110 1.1 skrll done = true;
111 1.1 skrll }
112 1.1 skrll if (done)
113 1.1 skrll pmap_devmap_bootstrap_done = true;
114 1.1 skrll }
115 1.1 skrll
116 1.1 skrll /*
117 1.1 skrll * Find the table entry that fully covers the physical address
118 1.1 skrll * range [pa, pa + size)
119 1.1 skrll */
120 1.1 skrll const struct pmap_devmap *
121 1.1 skrll pmap_devmap_find_pa(paddr_t pa, psize_t size)
122 1.1 skrll {
123 1.1 skrll if (pd_table == NULL)
124 1.1 skrll return NULL;
125 1.1 skrll
126 1.1 skrll for (size_t i = 0; pd_table[i].pd_size != 0; i++) {
127 1.1 skrll const paddr_t pd_pa = pd_table[i].pd_pa;
128 1.1 skrll const psize_t pd_sz = pd_table[i].pd_size;
129 1.1 skrll
130 1.1 skrll if (pa < pd_pa)
131 1.1 skrll continue;
132 1.1 skrll
133 1.1 skrll const psize_t pdiff = pa - pd_pa;
134 1.1 skrll
135 1.1 skrll if (pd_sz < pdiff)
136 1.1 skrll continue;
137 1.1 skrll
138 1.1 skrll if (pd_sz - pdiff >= size)
139 1.1 skrll return &pd_table[i];
140 1.1 skrll }
141 1.1 skrll
142 1.1 skrll return NULL;
143 1.1 skrll }
144 1.1 skrll
145 1.1 skrll /*
146 1.1 skrll * Find the table entry that fully covers the virtual address
147 1.1 skrll * range [va, va + size)
148 1.1 skrll */
149 1.1 skrll const struct pmap_devmap *
150 1.1 skrll pmap_devmap_find_va(vaddr_t va, vsize_t size)
151 1.1 skrll {
152 1.1 skrll if (pd_table == NULL)
153 1.1 skrll return NULL;
154 1.1 skrll
155 1.1 skrll for (size_t i = 0; pd_table[i].pd_size != 0; i++) {
156 1.1 skrll const vaddr_t pd_va = pd_table[i].pd_va;
157 1.1 skrll const vsize_t pd_sz = pd_table[i].pd_size;
158 1.1 skrll
159 1.1 skrll if (va < pd_va)
160 1.1 skrll continue;
161 1.1 skrll
162 1.1 skrll const vsize_t vdiff = va - pd_va;
163 1.1 skrll
164 1.1 skrll if (pd_sz < vdiff)
165 1.1 skrll continue;
166 1.1 skrll
167 1.1 skrll if (pd_sz - vdiff >= size)
168 1.1 skrll return &pd_table[i];
169 1.1 skrll
170 1.1 skrll }
171 1.1 skrll
172 1.1 skrll return NULL;
173 1.1 skrll }
174