2 * Copyright (c) 2006 QLogic, Inc. All rights reserved.
3 * Copyright (c) 2003, 2004, 2005, 2006 PathScale, Inc. All rights reserved.
5 * This software is available to you under a choice of one of two
6 * licenses. You may choose to be licensed under the terms of the GNU
7 * General Public License (GPL) Version 2, available from the file
8 * COPYING in the main directory of this source tree, or the
9 * OpenIB.org BSD license below:
11 * Redistribution and use in source and binary forms, with or
12 * without modification, are permitted provided that the following
15 * - Redistributions of source code must retain the above
16 * copyright notice, this list of conditions and the following
19 * - Redistributions in binary form must reproduce the above
20 * copyright notice, this list of conditions and the following
21 * disclaimer in the documentation and/or other materials
22 * provided with the distribution.
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
28 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
29 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
30 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
35 #include <linux/device.h>
37 #include "ipath_kernel.h"
39 static void __ipath_release_user_pages(struct page **p, size_t num_pages,
44 for (i = 0; i < num_pages; i++) {
45 ipath_cdbg(MM, "%lu/%lu put_page %p\n", (unsigned long) i,
46 (unsigned long) num_pages, p[i]);
48 set_page_dirty_lock(p[i]);
53 /* call with current->mm->mmap_sem held */
54 static int __get_user_pages(unsigned long start_page, size_t num_pages,
55 struct page **p, struct vm_area_struct **vma)
57 unsigned long lock_limit;
61 lock_limit = current->signal->rlim[RLIMIT_MEMLOCK].rlim_cur >>
64 if (num_pages > lock_limit) {
69 ipath_cdbg(VERBOSE, "pin %lx pages from vaddr %lx\n",
70 (unsigned long) num_pages, start_page);
72 for (got = 0; got < num_pages; got += ret) {
73 ret = get_user_pages(current, current->mm,
74 start_page + got * PAGE_SIZE,
75 num_pages - got, 1, 1,
81 current->mm->locked_vm += num_pages;
87 __ipath_release_user_pages(p, got, 0);
93 * ipath_map_page - a safety wrapper around pci_map_page()
95 * A dma_addr of all 0's is interpreted by the chip as "disabled".
96 * Unfortunately, it can also be a valid dma_addr returned on some
99 * The powerpc iommu assigns dma_addrs in ascending order, so we don't
100 * have to bother with retries or mapping a dummy page to insure we
101 * don't just get the same mapping again.
103 * I'm sure we won't be so lucky with other iommu's, so FIXME.
105 dma_addr_t ipath_map_page(struct pci_dev *hwdev, struct page *page,
106 unsigned long offset, size_t size, int direction)
110 phys = pci_map_page(hwdev, page, offset, size, direction);
113 pci_unmap_page(hwdev, phys, size, direction);
114 phys = pci_map_page(hwdev, page, offset, size, direction);
116 * FIXME: If we get 0 again, we should keep this page,
117 * map another, then free the 0 page.
125 * ipath_map_single - a safety wrapper around pci_map_single()
127 * Same idea as ipath_map_page().
129 dma_addr_t ipath_map_single(struct pci_dev *hwdev, void *ptr, size_t size,
134 phys = pci_map_single(hwdev, ptr, size, direction);
137 pci_unmap_single(hwdev, phys, size, direction);
138 phys = pci_map_single(hwdev, ptr, size, direction);
140 * FIXME: If we get 0 again, we should keep this page,
141 * map another, then free the 0 page.
149 * ipath_get_user_pages - lock user pages into memory
150 * @start_page: the start page
151 * @num_pages: the number of pages
152 * @p: the output page structures
154 * This function takes a given start page (page aligned user virtual
155 * address) and pins it and the following specified number of pages. For
156 * now, num_pages is always 1, but that will probably change at some point
157 * (because caller is doing expected sends on a single virtually contiguous
158 * buffer, so we can do all pages at once).
160 int ipath_get_user_pages(unsigned long start_page, size_t num_pages,
165 down_write(¤t->mm->mmap_sem);
167 ret = __get_user_pages(start_page, num_pages, p, NULL);
169 up_write(¤t->mm->mmap_sem);
175 * ipath_get_user_pages_nocopy - lock a single page for I/O and mark shared
176 * @start_page: the page to lock
177 * @p: the output page structure
179 * This is similar to ipath_get_user_pages, but it's always one page, and we
180 * mark the page as locked for I/O, and shared. This is used for the user
181 * process page that contains the destination address for the rcvhdrq tail
182 * update, so we need to have the vma. If we don't do this, the page can be
183 * taken away from us on fork, even if the child never touches it, and then
184 * the user process never sees the tail register updates.
186 int ipath_get_user_pages_nocopy(unsigned long page, struct page **p)
188 struct vm_area_struct *vma;
191 down_write(¤t->mm->mmap_sem);
193 ret = __get_user_pages(page, 1, p, &vma);
195 up_write(¤t->mm->mmap_sem);
200 void ipath_release_user_pages(struct page **p, size_t num_pages)
202 down_write(¤t->mm->mmap_sem);
204 __ipath_release_user_pages(p, num_pages, 1);
206 current->mm->locked_vm -= num_pages;
208 up_write(¤t->mm->mmap_sem);
211 struct ipath_user_pages_work {
212 struct work_struct work;
213 struct mm_struct *mm;
214 unsigned long num_pages;
217 static void user_pages_account(struct work_struct *_work)
219 struct ipath_user_pages_work *work =
220 container_of(_work, struct ipath_user_pages_work, work);
222 down_write(&work->mm->mmap_sem);
223 work->mm->locked_vm -= work->num_pages;
224 up_write(&work->mm->mmap_sem);
229 void ipath_release_user_pages_on_close(struct page **p, size_t num_pages)
231 struct ipath_user_pages_work *work;
232 struct mm_struct *mm;
234 __ipath_release_user_pages(p, num_pages, 1);
236 mm = get_task_mm(current);
240 work = kmalloc(sizeof(*work), GFP_KERNEL);
246 INIT_WORK(&work->work, user_pages_account);
248 work->num_pages = num_pages;