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