2 * Copyright (c) 2017-2019 François Tigeot <ftigeot@wolfpond.org>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice unmodified, this list of conditions, and the following
11 * 2. 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.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 #include <sys/queue.h>
28 #include <vm/vm_extern.h>
30 #include <linux/vmalloc.h>
31 #include <linux/slab.h>
37 SLIST_ENTRY(vmap) vm_vmaps;
40 struct lock vmap_lock = LOCK_INITIALIZER("dlvml", 0, LK_CANRECURSE);
42 SLIST_HEAD(vmap_list_head, vmap) vmap_list = SLIST_HEAD_INITIALIZER(vmap_list);
44 /* vmap: map an array of pages into virtually contiguous space */
46 vmap(struct page **pages, unsigned int count,
47 unsigned long flags, pgprot_t prot)
53 vmp = kmalloc(sizeof(struct vmap), M_DRM, M_WAITOK | M_ZERO);
55 size = count * PAGE_SIZE;
56 off = kmem_alloc_nofault(kernel_map, size,
57 VM_SUBSYS_DRM_VMAP, PAGE_SIZE);
61 vmp->addr = (void *)off;
63 pmap_qenter(off, (struct vm_page **)pages, count);
64 lockmgr(&vmap_lock, LK_EXCLUSIVE);
65 SLIST_INSERT_HEAD(&vmap_list, vmp, vm_vmaps);
66 lockmgr(&vmap_lock, LK_RELEASE);
72 vunmap(const void *addr)
74 struct vmap *vmp, *tmp_vmp;
77 SLIST_FOREACH_MUTABLE(vmp, &vmap_list, vm_vmaps, tmp_vmp) {
78 if (vmp->addr == addr) {
79 size = vmp->npages * PAGE_SIZE;
81 pmap_qremove((vm_offset_t)addr, vmp->npages);
82 kmem_free(kernel_map, (vm_offset_t)addr, size);
88 lockmgr(&vmap_lock, LK_EXCLUSIVE);
89 SLIST_REMOVE(&vmap_list, vmp, vmap, vm_vmaps);
90 lockmgr(&vmap_lock, LK_RELEASE);
95 is_vmalloc_addr(const void *x)
97 struct vmap *vmp, *tmp_vmp;
99 SLIST_FOREACH_MUTABLE(vmp, &vmap_list, vm_vmaps, tmp_vmp) {
108 vmalloc(unsigned long size)
110 return kmalloc(size, M_DRM, M_WAITOK);
114 vzalloc(unsigned long size)
116 return kmalloc(size, M_DRM, M_WAITOK | M_ZERO);
119 /* allocate zeroed virtually contiguous memory for userspace */
121 vmalloc_user(unsigned long size)
123 return kmalloc(size, M_DRM, M_WAITOK | M_ZERO);
127 vfree(const void *addr)
131 memcpy(&nc_addr, &addr, sizeof(void *));
136 kvmalloc_array(size_t n, size_t size, gfp_t flags)
141 if (n > SIZE_MAX / size)
144 return kmalloc(n * size, M_DRM, flags);