1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
3 *
4 * Copyright (c) 2004 Alan L. Cox <alc@cs.rice.edu>
5 * Copyright (c) 1982, 1986, 1991, 1993
6 * The Regents of the University of California. All rights reserved.
7 * (c) UNIX System Laboratories, Inc.
8 * All or some portions of this file are derived from material licensed
9 * to the University of California by American Telephone and Telegraph
10 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
11 * the permission of UNIX System Laboratories, Inc.
12 *
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
15 * are met:
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 */
37
38 #include <sys/param.h>
39 #include <sys/kernel.h>
40 #include <sys/lock.h>
41 #include <sys/mutex.h>
42 #include <sys/proc.h>
43 #include <sys/systm.h>
44 #include <sys/uio.h>
45
46 #include <vm/vm.h>
47 #include <vm/vm_page.h>
48
49 #include <machine/vmparam.h>
50
51 /*
52 * Implement uiomove(9) from physical memory using the direct map to
53 * avoid the creation and destruction of ephemeral mappings.
54 */
55 int
uiomove_fromphys(vm_page_t ma[],vm_offset_t offset,int n,struct uio * uio)56 uiomove_fromphys(vm_page_t ma[], vm_offset_t offset, int n, struct uio *uio)
57 {
58 struct thread *td = curthread;
59 struct iovec *iov;
60 void *cp;
61 vm_offset_t page_offset, vaddr;
62 size_t cnt;
63 int error = 0;
64 int save = 0;
65 bool mapped;
66
67 KASSERT(uio->uio_rw == UIO_READ || uio->uio_rw == UIO_WRITE,
68 ("uiomove_fromphys: mode"));
69 KASSERT(uio->uio_segflg != UIO_USERSPACE || uio->uio_td == curthread,
70 ("uiomove_fromphys proc"));
71 KASSERT(uio->uio_resid >= 0,
72 ("%s: uio %p resid underflow", __func__, uio));
73
74 save = td->td_pflags & TDP_DEADLKTREAT;
75 td->td_pflags |= TDP_DEADLKTREAT;
76 mapped = false;
77 while (n > 0 && uio->uio_resid) {
78 KASSERT(uio->uio_iovcnt > 0,
79 ("%s: uio %p iovcnt underflow", __func__, uio));
80
81 iov = uio->uio_iov;
82 cnt = iov->iov_len;
83 if (cnt == 0) {
84 uio->uio_iov++;
85 uio->uio_iovcnt--;
86 continue;
87 }
88 if (cnt > n)
89 cnt = n;
90 page_offset = offset & PAGE_MASK;
91 cnt = min(cnt, PAGE_SIZE - page_offset);
92 if (uio->uio_segflg != UIO_NOCOPY) {
93 mapped = pmap_map_io_transient(
94 &ma[offset >> PAGE_SHIFT], &vaddr, 1, true);
95 cp = (char *)vaddr + page_offset;
96 }
97 switch (uio->uio_segflg) {
98 case UIO_USERSPACE:
99 maybe_yield();
100 switch (uio->uio_rw) {
101 case UIO_READ:
102 error = copyout(cp, iov->iov_base, cnt);
103 break;
104 case UIO_WRITE:
105 error = copyin(iov->iov_base, cp, cnt);
106 break;
107 }
108 if (error)
109 goto out;
110 break;
111 case UIO_SYSSPACE:
112 switch (uio->uio_rw) {
113 case UIO_READ:
114 bcopy(cp, iov->iov_base, cnt);
115 break;
116 case UIO_WRITE:
117 bcopy(iov->iov_base, cp, cnt);
118 break;
119 }
120 break;
121 case UIO_NOCOPY:
122 break;
123 }
124 if (__predict_false(mapped)) {
125 pmap_unmap_io_transient(&ma[offset >> PAGE_SHIFT],
126 &vaddr, 1, true);
127 mapped = false;
128 }
129 iov->iov_base = (char *)iov->iov_base + cnt;
130 iov->iov_len -= cnt;
131 uio->uio_resid -= cnt;
132 uio->uio_offset += cnt;
133 offset += cnt;
134 n -= cnt;
135 }
136 out:
137 if (__predict_false(mapped))
138 pmap_unmap_io_transient(&ma[offset >> PAGE_SHIFT], &vaddr, 1,
139 true);
140 if (save == 0)
141 td->td_pflags &= ~TDP_DEADLKTREAT;
142 return (error);
143 }
144