3 * This file is provided under a dual BSD/GPLv2 license. When using or
4 * redistributing this file, you may do so under either license.
8 * Copyright(c) 2015 Intel Corporation.
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of version 2 of the GNU General Public License as
12 * published by the Free Software Foundation.
14 * This program is distributed in the hope that it will be useful, but
15 * WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * General Public License for more details.
21 * Copyright(c) 2015 Intel Corporation.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
27 * - Redistributions of source code must retain the above copyright
28 * notice, this list of conditions and the following disclaimer.
29 * - Redistributions in binary form must reproduce the above copyright
30 * notice, this list of conditions and the following disclaimer in
31 * the documentation and/or other materials provided with the
33 * - Neither the name of Intel Corporation nor the names of its
34 * contributors may be used to endorse or promote products derived
35 * from this software without specific prior written permission.
37 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
38 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
39 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
40 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
41 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
42 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
43 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
44 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
45 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
46 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
47 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
52 #include <linux/device.h>
56 static void __hfi1_release_user_pages(struct page **p, size_t num_pages,
61 for (i = 0; i < num_pages; i++) {
63 set_page_dirty_lock(p[i]);
69 * Call with current->mm->mmap_sem held.
71 static int __hfi1_get_user_pages(unsigned long start_page, size_t num_pages,
74 unsigned long lock_limit;
78 lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
80 if (num_pages > lock_limit && !capable(CAP_IPC_LOCK)) {
85 for (got = 0; got < num_pages; got += ret) {
86 ret = get_user_pages(current, current->mm,
87 start_page + got * PAGE_SIZE,
88 num_pages - got, 1, 1,
94 current->mm->pinned_vm += num_pages;
100 __hfi1_release_user_pages(p, got, 0);
106 * hfi1_map_page - a safety wrapper around pci_map_page()
109 dma_addr_t hfi1_map_page(struct pci_dev *hwdev, struct page *page,
110 unsigned long offset, size_t size, int direction)
114 phys = pci_map_page(hwdev, page, offset, size, direction);
120 * hfi1_get_user_pages - lock user pages into memory
121 * @start_page: the start page
122 * @num_pages: the number of pages
123 * @p: the output page structures
125 * This function takes a given start page (page aligned user virtual
126 * address) and pins it and the following specified number of pages. For
127 * now, num_pages is always 1, but that will probably change at some point
128 * (because caller is doing expected sends on a single virtually contiguous
129 * buffer, so we can do all pages at once).
131 int hfi1_get_user_pages(unsigned long start_page, size_t num_pages,
136 down_write(¤t->mm->mmap_sem);
138 ret = __hfi1_get_user_pages(start_page, num_pages, p);
140 up_write(¤t->mm->mmap_sem);
145 void hfi1_release_user_pages(struct page **p, size_t num_pages)
147 if (current->mm) /* during close after signal, mm can be NULL */
148 down_write(¤t->mm->mmap_sem);
150 __hfi1_release_user_pages(p, num_pages, 1);
153 current->mm->pinned_vm -= num_pages;
154 up_write(¤t->mm->mmap_sem);