linux_kmap.c revision 1.4.4.2 1 1.4.4.2 rmind /* $NetBSD: linux_kmap.c,v 1.4.4.2 2014/05/18 17:46:01 rmind Exp $ */
2 1.4.4.2 rmind
3 1.4.4.2 rmind /*-
4 1.4.4.2 rmind * Copyright (c) 2013 The NetBSD Foundation, Inc.
5 1.4.4.2 rmind * All rights reserved.
6 1.4.4.2 rmind *
7 1.4.4.2 rmind * This code is derived from software contributed to The NetBSD Foundation
8 1.4.4.2 rmind * by Taylor R. Campbell.
9 1.4.4.2 rmind *
10 1.4.4.2 rmind * Redistribution and use in source and binary forms, with or without
11 1.4.4.2 rmind * modification, are permitted provided that the following conditions
12 1.4.4.2 rmind * are met:
13 1.4.4.2 rmind * 1. Redistributions of source code must retain the above copyright
14 1.4.4.2 rmind * notice, this list of conditions and the following disclaimer.
15 1.4.4.2 rmind * 2. Redistributions in binary form must reproduce the above copyright
16 1.4.4.2 rmind * notice, this list of conditions and the following disclaimer in the
17 1.4.4.2 rmind * documentation and/or other materials provided with the distribution.
18 1.4.4.2 rmind *
19 1.4.4.2 rmind * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.4.4.2 rmind * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.4.4.2 rmind * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.4.4.2 rmind * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.4.4.2 rmind * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.4.4.2 rmind * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.4.4.2 rmind * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.4.4.2 rmind * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.4.4.2 rmind * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.4.4.2 rmind * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.4.4.2 rmind * POSSIBILITY OF SUCH DAMAGE.
30 1.4.4.2 rmind */
31 1.4.4.2 rmind
32 1.4.4.2 rmind #include <sys/cdefs.h>
33 1.4.4.2 rmind __KERNEL_RCSID(0, "$NetBSD: linux_kmap.c,v 1.4.4.2 2014/05/18 17:46:01 rmind Exp $");
34 1.4.4.2 rmind
35 1.4.4.2 rmind #include <sys/types.h>
36 1.4.4.2 rmind #include <sys/kmem.h>
37 1.4.4.2 rmind #include <sys/mutex.h>
38 1.4.4.2 rmind #include <sys/rbtree.h>
39 1.4.4.2 rmind
40 1.4.4.2 rmind #include <uvm/uvm_extern.h>
41 1.4.4.2 rmind
42 1.4.4.2 rmind #include <linux/highmem.h>
43 1.4.4.2 rmind
44 1.4.4.2 rmind /*
45 1.4.4.2 rmind * XXX Kludgerific implementation of Linux kmap_atomic, which is
46 1.4.4.2 rmind * required not to fail. To accomodate this, we reserve one page of
47 1.4.4.2 rmind * kva at boot (or load) and limit the system to at most kmap_atomic in
48 1.4.4.2 rmind * use at a time.
49 1.4.4.2 rmind */
50 1.4.4.2 rmind
51 1.4.4.2 rmind /*
52 1.4.4.2 rmind * XXX Use direct-mapped physical pages where available, e.g. amd64.
53 1.4.4.2 rmind *
54 1.4.4.2 rmind * XXX ...or add an abstraction to uvm for this. (uvm_emap?)
55 1.4.4.2 rmind */
56 1.4.4.2 rmind
57 1.4.4.2 rmind static kmutex_t linux_kmap_atomic_lock;
58 1.4.4.2 rmind static vaddr_t linux_kmap_atomic_vaddr;
59 1.4.4.2 rmind
60 1.4.4.2 rmind static kmutex_t linux_kmap_lock;
61 1.4.4.2 rmind static rb_tree_t linux_kmap_entries;
62 1.4.4.2 rmind
63 1.4.4.2 rmind struct linux_kmap_entry {
64 1.4.4.2 rmind paddr_t lke_paddr;
65 1.4.4.2 rmind vaddr_t lke_vaddr;
66 1.4.4.2 rmind unsigned int lke_refcnt;
67 1.4.4.2 rmind rb_node_t lke_node;
68 1.4.4.2 rmind };
69 1.4.4.2 rmind
70 1.4.4.2 rmind static int
71 1.4.4.2 rmind lke_compare_nodes(void *ctx __unused, const void *an, const void *bn)
72 1.4.4.2 rmind {
73 1.4.4.2 rmind const struct linux_kmap_entry *const a = an;
74 1.4.4.2 rmind const struct linux_kmap_entry *const b = bn;
75 1.4.4.2 rmind
76 1.4.4.2 rmind if (a->lke_paddr < b->lke_paddr)
77 1.4.4.2 rmind return -1;
78 1.4.4.2 rmind else if (a->lke_paddr > b->lke_paddr)
79 1.4.4.2 rmind return +1;
80 1.4.4.2 rmind else
81 1.4.4.2 rmind return 0;
82 1.4.4.2 rmind }
83 1.4.4.2 rmind
84 1.4.4.2 rmind static int
85 1.4.4.2 rmind lke_compare_key(void *ctx __unused, const void *node, const void *key)
86 1.4.4.2 rmind {
87 1.4.4.2 rmind const struct linux_kmap_entry *const lke = node;
88 1.4.4.2 rmind const paddr_t *const paddrp = key;
89 1.4.4.2 rmind
90 1.4.4.2 rmind if (lke->lke_paddr < *paddrp)
91 1.4.4.2 rmind return -1;
92 1.4.4.2 rmind else if (lke->lke_paddr > *paddrp)
93 1.4.4.2 rmind return +1;
94 1.4.4.2 rmind else
95 1.4.4.2 rmind return 0;
96 1.4.4.2 rmind }
97 1.4.4.2 rmind
98 1.4.4.2 rmind static const rb_tree_ops_t linux_kmap_entry_ops = {
99 1.4.4.2 rmind .rbto_compare_nodes = &lke_compare_nodes,
100 1.4.4.2 rmind .rbto_compare_key = &lke_compare_key,
101 1.4.4.2 rmind .rbto_node_offset = offsetof(struct linux_kmap_entry, lke_node),
102 1.4.4.2 rmind .rbto_context = NULL,
103 1.4.4.2 rmind };
104 1.4.4.2 rmind
105 1.4.4.2 rmind int
106 1.4.4.2 rmind linux_kmap_init(void)
107 1.4.4.2 rmind {
108 1.4.4.2 rmind
109 1.4.4.2 rmind /* IPL_VM is needed to block pmap_kenter_pa. */
110 1.4.4.2 rmind mutex_init(&linux_kmap_atomic_lock, MUTEX_DEFAULT, IPL_VM);
111 1.4.4.2 rmind
112 1.4.4.2 rmind linux_kmap_atomic_vaddr = uvm_km_alloc(kernel_map, PAGE_SIZE, 0,
113 1.4.4.2 rmind (UVM_KMF_VAONLY | UVM_KMF_WAITVA));
114 1.4.4.2 rmind
115 1.4.4.2 rmind KASSERT(linux_kmap_atomic_vaddr != 0);
116 1.4.4.2 rmind KASSERT(!pmap_extract(pmap_kernel(), linux_kmap_atomic_vaddr, NULL));
117 1.4.4.2 rmind
118 1.4.4.2 rmind mutex_init(&linux_kmap_lock, MUTEX_DEFAULT, IPL_VM);
119 1.4.4.2 rmind rb_tree_init(&linux_kmap_entries, &linux_kmap_entry_ops);
120 1.4.4.2 rmind
121 1.4.4.2 rmind return 0;
122 1.4.4.2 rmind }
123 1.4.4.2 rmind
124 1.4.4.2 rmind void
125 1.4.4.2 rmind linux_kmap_fini(void)
126 1.4.4.2 rmind {
127 1.4.4.2 rmind
128 1.4.4.2 rmind KASSERT(rb_tree_iterate(&linux_kmap_entries, NULL, RB_DIR_RIGHT) ==
129 1.4.4.2 rmind NULL);
130 1.4.4.2 rmind #if 0 /* XXX no rb_tree_destroy*/
131 1.4.4.2 rmind rb_tree_destroy(&linux_kmap_entries);
132 1.4.4.2 rmind #endif
133 1.4.4.2 rmind mutex_destroy(&linux_kmap_lock);
134 1.4.4.2 rmind
135 1.4.4.2 rmind KASSERT(linux_kmap_atomic_vaddr != 0);
136 1.4.4.2 rmind KASSERT(!pmap_extract(pmap_kernel(), linux_kmap_atomic_vaddr, NULL));
137 1.4.4.2 rmind
138 1.4.4.2 rmind uvm_km_free(kernel_map, linux_kmap_atomic_vaddr, PAGE_SIZE,
139 1.4.4.2 rmind (UVM_KMF_VAONLY | UVM_KMF_WAITVA));
140 1.4.4.2 rmind
141 1.4.4.2 rmind mutex_destroy(&linux_kmap_atomic_lock);
142 1.4.4.2 rmind }
143 1.4.4.2 rmind
144 1.4.4.2 rmind void *
145 1.4.4.2 rmind kmap_atomic(struct page *page)
146 1.4.4.2 rmind {
147 1.4.4.2 rmind const paddr_t paddr = uvm_vm_page_to_phys(&page->p_vmp);
148 1.4.4.2 rmind
149 1.4.4.2 rmind mutex_spin_enter(&linux_kmap_atomic_lock);
150 1.4.4.2 rmind
151 1.4.4.2 rmind KASSERT(linux_kmap_atomic_vaddr != 0);
152 1.4.4.2 rmind KASSERT(!pmap_extract(pmap_kernel(), linux_kmap_atomic_vaddr, NULL));
153 1.4.4.2 rmind
154 1.4.4.2 rmind const vaddr_t vaddr = linux_kmap_atomic_vaddr;
155 1.4.4.2 rmind const int prot = (VM_PROT_READ | VM_PROT_WRITE);
156 1.4.4.2 rmind const int flags = 0;
157 1.4.4.2 rmind pmap_kenter_pa(vaddr, paddr, prot, flags);
158 1.4.4.2 rmind pmap_update(pmap_kernel());
159 1.4.4.2 rmind
160 1.4.4.2 rmind return (void *)vaddr;
161 1.4.4.2 rmind }
162 1.4.4.2 rmind
163 1.4.4.2 rmind void
164 1.4.4.2 rmind kunmap_atomic(void *addr)
165 1.4.4.2 rmind {
166 1.4.4.2 rmind const vaddr_t vaddr = (vaddr_t)addr;
167 1.4.4.2 rmind
168 1.4.4.2 rmind KASSERT(mutex_owned(&linux_kmap_atomic_lock));
169 1.4.4.2 rmind KASSERT(linux_kmap_atomic_vaddr == vaddr);
170 1.4.4.2 rmind KASSERT(pmap_extract(pmap_kernel(), vaddr, NULL));
171 1.4.4.2 rmind
172 1.4.4.2 rmind pmap_kremove(vaddr, PAGE_SIZE);
173 1.4.4.2 rmind pmap_update(pmap_kernel());
174 1.4.4.2 rmind
175 1.4.4.2 rmind mutex_spin_exit(&linux_kmap_atomic_lock);
176 1.4.4.2 rmind }
177 1.4.4.2 rmind
178 1.4.4.2 rmind void *
179 1.4.4.2 rmind kmap(struct page *page)
180 1.4.4.2 rmind {
181 1.4.4.2 rmind const paddr_t paddr = VM_PAGE_TO_PHYS(&page->p_vmp);
182 1.4.4.2 rmind const vaddr_t vaddr = uvm_km_alloc(kernel_map, PAGE_SIZE, 0,
183 1.4.4.2 rmind (UVM_KMF_VAONLY | UVM_KMF_WAITVA));
184 1.4.4.2 rmind KASSERT(vaddr != 0);
185 1.4.4.2 rmind
186 1.4.4.2 rmind struct linux_kmap_entry *const lke = kmem_alloc(sizeof(*lke),
187 1.4.4.2 rmind KM_SLEEP);
188 1.4.4.2 rmind lke->lke_paddr = paddr;
189 1.4.4.2 rmind lke->lke_vaddr = vaddr;
190 1.4.4.2 rmind
191 1.4.4.2 rmind mutex_spin_enter(&linux_kmap_lock);
192 1.4.4.2 rmind struct linux_kmap_entry *const collision __unused =
193 1.4.4.2 rmind rb_tree_insert_node(&linux_kmap_entries, lke);
194 1.4.4.2 rmind KASSERT(collision == lke);
195 1.4.4.2 rmind mutex_spin_exit(&linux_kmap_lock);
196 1.4.4.2 rmind
197 1.4.4.2 rmind KASSERT(!pmap_extract(pmap_kernel(), vaddr, NULL));
198 1.4.4.2 rmind const int prot = (VM_PROT_READ | VM_PROT_WRITE);
199 1.4.4.2 rmind const int flags = 0;
200 1.4.4.2 rmind pmap_kenter_pa(vaddr, paddr, prot, flags);
201 1.4.4.2 rmind pmap_update(pmap_kernel());
202 1.4.4.2 rmind
203 1.4.4.2 rmind return (void *)vaddr;
204 1.4.4.2 rmind }
205 1.4.4.2 rmind
206 1.4.4.2 rmind void
207 1.4.4.2 rmind kunmap(struct page *page)
208 1.4.4.2 rmind {
209 1.4.4.2 rmind const paddr_t paddr = VM_PAGE_TO_PHYS(&page->p_vmp);
210 1.4.4.2 rmind
211 1.4.4.2 rmind mutex_spin_enter(&linux_kmap_lock);
212 1.4.4.2 rmind struct linux_kmap_entry *const lke =
213 1.4.4.2 rmind rb_tree_find_node(&linux_kmap_entries, &paddr);
214 1.4.4.2 rmind KASSERT(lke != NULL);
215 1.4.4.2 rmind rb_tree_remove_node(&linux_kmap_entries, lke);
216 1.4.4.2 rmind mutex_spin_exit(&linux_kmap_lock);
217 1.4.4.2 rmind
218 1.4.4.2 rmind const vaddr_t vaddr = lke->lke_vaddr;
219 1.4.4.2 rmind kmem_free(lke, sizeof(*lke));
220 1.4.4.2 rmind
221 1.4.4.2 rmind KASSERT(pmap_extract(pmap_kernel(), vaddr, NULL));
222 1.4.4.2 rmind
223 1.4.4.2 rmind pmap_kremove(vaddr, PAGE_SIZE);
224 1.4.4.2 rmind pmap_update(pmap_kernel());
225 1.4.4.2 rmind
226 1.4.4.2 rmind uvm_km_free(kernel_map, vaddr, PAGE_SIZE, UVM_KMF_VAONLY);
227 1.4.4.2 rmind }
228