| @@ -1,1728 +1,1750 @@ | | | @@ -1,1728 +1,1750 @@ |
1 | /* $NetBSD: procfs_vnops.c,v 1.191 2014/07/27 16:47:26 hannken Exp $ */ | | 1 | /* $NetBSD: procfs_vnops.c,v 1.191.8.1 2019/08/29 16:14:37 martin Exp $ */ |
2 | | | 2 | |
3 | /*- | | 3 | /*- |
4 | * Copyright (c) 2006, 2007, 2008 The NetBSD Foundation, Inc. | | 4 | * Copyright (c) 2006, 2007, 2008 The NetBSD Foundation, Inc. |
5 | * All rights reserved. | | 5 | * All rights reserved. |
6 | * | | 6 | * |
7 | * This code is derived from software contributed to The NetBSD Foundation | | 7 | * This code is derived from software contributed to The NetBSD Foundation |
8 | * by Andrew Doran. | | 8 | * by Andrew Doran. |
9 | * | | 9 | * |
10 | * Redistribution and use in source and binary forms, with or without | | 10 | * Redistribution and use in source and binary forms, with or without |
11 | * modification, are permitted provided that the following conditions | | 11 | * modification, are permitted provided that the following conditions |
12 | * are met: | | 12 | * are met: |
13 | * 1. Redistributions of source code must retain the above copyright | | 13 | * 1. Redistributions of source code must retain the above copyright |
14 | * notice, this list of conditions and the following disclaimer. | | 14 | * notice, this list of conditions and the following disclaimer. |
15 | * 2. Redistributions in binary form must reproduce the above copyright | | 15 | * 2. Redistributions in binary form must reproduce the above copyright |
16 | * notice, this list of conditions and the following disclaimer in the | | 16 | * notice, this list of conditions and the following disclaimer in the |
17 | * documentation and/or other materials provided with the distribution. | | 17 | * documentation and/or other materials provided with the distribution. |
18 | * | | 18 | * |
19 | * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS | | 19 | * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS |
20 | * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED | | 20 | * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED |
21 | * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | | 21 | * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
22 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS | | 22 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS |
23 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | | 23 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
24 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | | 24 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
25 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | | 25 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
26 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | | 26 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
27 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | | 27 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
28 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | | 28 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
29 | * POSSIBILITY OF SUCH DAMAGE. | | 29 | * POSSIBILITY OF SUCH DAMAGE. |
30 | */ | | 30 | */ |
31 | | | 31 | |
32 | /* | | 32 | /* |
33 | * Copyright (c) 1993, 1995 | | 33 | * Copyright (c) 1993, 1995 |
34 | * The Regents of the University of California. All rights reserved. | | 34 | * The Regents of the University of California. All rights reserved. |
35 | * | | 35 | * |
36 | * This code is derived from software contributed to Berkeley by | | 36 | * This code is derived from software contributed to Berkeley by |
37 | * Jan-Simon Pendry. | | 37 | * Jan-Simon Pendry. |
38 | * | | 38 | * |
39 | * Redistribution and use in source and binary forms, with or without | | 39 | * Redistribution and use in source and binary forms, with or without |
40 | * modification, are permitted provided that the following conditions | | 40 | * modification, are permitted provided that the following conditions |
41 | * are met: | | 41 | * are met: |
42 | * 1. Redistributions of source code must retain the above copyright | | 42 | * 1. Redistributions of source code must retain the above copyright |
43 | * notice, this list of conditions and the following disclaimer. | | 43 | * notice, this list of conditions and the following disclaimer. |
44 | * 2. Redistributions in binary form must reproduce the above copyright | | 44 | * 2. Redistributions in binary form must reproduce the above copyright |
45 | * notice, this list of conditions and the following disclaimer in the | | 45 | * notice, this list of conditions and the following disclaimer in the |
46 | * documentation and/or other materials provided with the distribution. | | 46 | * documentation and/or other materials provided with the distribution. |
47 | * 3. Neither the name of the University nor the names of its contributors | | 47 | * 3. Neither the name of the University nor the names of its contributors |
48 | * may be used to endorse or promote products derived from this software | | 48 | * may be used to endorse or promote products derived from this software |
49 | * without specific prior written permission. | | 49 | * without specific prior written permission. |
50 | * | | 50 | * |
51 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | | 51 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
52 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | | 52 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
53 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | | 53 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
54 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | | 54 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
55 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | | 55 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
56 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | | 56 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
57 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | | 57 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
58 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | | 58 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
59 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | | 59 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
60 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | | 60 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
61 | * SUCH DAMAGE. | | 61 | * SUCH DAMAGE. |
62 | * | | 62 | * |
63 | * @(#)procfs_vnops.c 8.18 (Berkeley) 5/21/95 | | 63 | * @(#)procfs_vnops.c 8.18 (Berkeley) 5/21/95 |
64 | */ | | 64 | */ |
65 | | | 65 | |
66 | /* | | 66 | /* |
67 | * Copyright (c) 1993 Jan-Simon Pendry | | 67 | * Copyright (c) 1993 Jan-Simon Pendry |
68 | * | | 68 | * |
69 | * This code is derived from software contributed to Berkeley by | | 69 | * This code is derived from software contributed to Berkeley by |
70 | * Jan-Simon Pendry. | | 70 | * Jan-Simon Pendry. |
71 | * | | 71 | * |
72 | * Redistribution and use in source and binary forms, with or without | | 72 | * Redistribution and use in source and binary forms, with or without |
73 | * modification, are permitted provided that the following conditions | | 73 | * modification, are permitted provided that the following conditions |
74 | * are met: | | 74 | * are met: |
75 | * 1. Redistributions of source code must retain the above copyright | | 75 | * 1. Redistributions of source code must retain the above copyright |
76 | * notice, this list of conditions and the following disclaimer. | | 76 | * notice, this list of conditions and the following disclaimer. |
77 | * 2. Redistributions in binary form must reproduce the above copyright | | 77 | * 2. Redistributions in binary form must reproduce the above copyright |
78 | * notice, this list of conditions and the following disclaimer in the | | 78 | * notice, this list of conditions and the following disclaimer in the |
79 | * documentation and/or other materials provided with the distribution. | | 79 | * documentation and/or other materials provided with the distribution. |
80 | * 3. All advertising materials mentioning features or use of this software | | 80 | * 3. All advertising materials mentioning features or use of this software |
81 | * must display the following acknowledgement: | | 81 | * must display the following acknowledgement: |
82 | * This product includes software developed by the University of | | 82 | * This product includes software developed by the University of |
83 | * California, Berkeley and its contributors. | | 83 | * California, Berkeley and its contributors. |
84 | * 4. Neither the name of the University nor the names of its contributors | | 84 | * 4. Neither the name of the University nor the names of its contributors |
85 | * may be used to endorse or promote products derived from this software | | 85 | * may be used to endorse or promote products derived from this software |
86 | * without specific prior written permission. | | 86 | * without specific prior written permission. |
87 | * | | 87 | * |
88 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | | 88 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
89 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | | 89 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
90 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | | 90 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
91 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | | 91 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
92 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | | 92 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
93 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | | 93 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
94 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | | 94 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
95 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | | 95 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
96 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | | 96 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
97 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | | 97 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
98 | * SUCH DAMAGE. | | 98 | * SUCH DAMAGE. |
99 | * | | 99 | * |
100 | * @(#)procfs_vnops.c 8.18 (Berkeley) 5/21/95 | | 100 | * @(#)procfs_vnops.c 8.18 (Berkeley) 5/21/95 |
101 | */ | | 101 | */ |
102 | | | 102 | |
103 | /* | | 103 | /* |
104 | * procfs vnode interface | | 104 | * procfs vnode interface |
105 | */ | | 105 | */ |
106 | | | 106 | |
107 | #include <sys/cdefs.h> | | 107 | #include <sys/cdefs.h> |
108 | __KERNEL_RCSID(0, "$NetBSD: procfs_vnops.c,v 1.191 2014/07/27 16:47:26 hannken Exp $"); | | 108 | __KERNEL_RCSID(0, "$NetBSD: procfs_vnops.c,v 1.191.8.1 2019/08/29 16:14:37 martin Exp $"); |
109 | | | 109 | |
110 | #include <sys/param.h> | | 110 | #include <sys/param.h> |
111 | #include <sys/systm.h> | | 111 | #include <sys/systm.h> |
112 | #include <sys/time.h> | | 112 | #include <sys/time.h> |
113 | #include <sys/kernel.h> | | 113 | #include <sys/kernel.h> |
114 | #include <sys/file.h> | | 114 | #include <sys/file.h> |
115 | #include <sys/filedesc.h> | | 115 | #include <sys/filedesc.h> |
116 | #include <sys/proc.h> | | 116 | #include <sys/proc.h> |
117 | #include <sys/vnode.h> | | 117 | #include <sys/vnode.h> |
118 | #include <sys/namei.h> | | 118 | #include <sys/namei.h> |
119 | #include <sys/malloc.h> | | 119 | #include <sys/malloc.h> |
120 | #include <sys/mount.h> | | 120 | #include <sys/mount.h> |
121 | #include <sys/dirent.h> | | 121 | #include <sys/dirent.h> |
122 | #include <sys/resourcevar.h> | | 122 | #include <sys/resourcevar.h> |
123 | #include <sys/stat.h> | | 123 | #include <sys/stat.h> |
124 | #include <sys/ptrace.h> | | 124 | #include <sys/ptrace.h> |
125 | #include <sys/kauth.h> | | 125 | #include <sys/kauth.h> |
126 | | | 126 | |
127 | #include <uvm/uvm_extern.h> /* for PAGE_SIZE */ | | 127 | #include <uvm/uvm_extern.h> /* for PAGE_SIZE */ |
128 | | | 128 | |
129 | #include <machine/reg.h> | | 129 | #include <machine/reg.h> |
130 | | | 130 | |
131 | #include <miscfs/genfs/genfs.h> | | 131 | #include <miscfs/genfs/genfs.h> |
132 | #include <miscfs/procfs/procfs.h> | | 132 | #include <miscfs/procfs/procfs.h> |
133 | | | 133 | |
134 | /* | | 134 | /* |
135 | * Vnode Operations. | | 135 | * Vnode Operations. |
136 | * | | 136 | * |
137 | */ | | 137 | */ |
138 | | | 138 | |
139 | static int procfs_validfile_linux(struct lwp *, struct mount *); | | 139 | static int procfs_validfile_linux(struct lwp *, struct mount *); |
140 | static int procfs_root_readdir_callback(struct proc *, void *); | | 140 | static int procfs_root_readdir_callback(struct proc *, void *); |
141 | static void procfs_dir(pfstype, struct lwp *, struct proc *, char **, char *, | | 141 | static void procfs_dir(pfstype, struct lwp *, struct proc *, char **, char *, |
142 | size_t); | | 142 | size_t); |
143 | | | 143 | |
144 | /* | | 144 | /* |
145 | * This is a list of the valid names in the | | 145 | * This is a list of the valid names in the |
146 | * process-specific sub-directories. It is | | 146 | * process-specific sub-directories. It is |
147 | * used in procfs_lookup and procfs_readdir | | 147 | * used in procfs_lookup and procfs_readdir |
148 | */ | | 148 | */ |
149 | static const struct proc_target { | | 149 | static const struct proc_target { |
150 | u_char pt_type; | | 150 | u_char pt_type; |
151 | u_char pt_namlen; | | 151 | u_char pt_namlen; |
152 | const char *pt_name; | | 152 | const char *pt_name; |
153 | pfstype pt_pfstype; | | 153 | pfstype pt_pfstype; |
154 | int (*pt_valid)(struct lwp *, struct mount *); | | 154 | int (*pt_valid)(struct lwp *, struct mount *); |
155 | } proc_targets[] = { | | 155 | } proc_targets[] = { |
156 | #define N(s) sizeof(s)-1, s | | 156 | #define N(s) sizeof(s)-1, s |
157 | /* name type validp */ | | 157 | /* name type validp */ |
158 | { DT_DIR, N("."), PFSproc, NULL }, | | 158 | { DT_DIR, N("."), PFSproc, NULL }, |
159 | { DT_DIR, N(".."), PFSroot, NULL }, | | 159 | { DT_DIR, N(".."), PFSroot, NULL }, |
160 | { DT_DIR, N("fd"), PFSfd, NULL }, | | 160 | { DT_DIR, N("fd"), PFSfd, NULL }, |
161 | { DT_REG, N("file"), PFSfile, procfs_validfile }, | | 161 | { DT_REG, N("file"), PFSfile, procfs_validfile }, |
162 | { DT_REG, N("mem"), PFSmem, NULL }, | | 162 | { DT_REG, N("mem"), PFSmem, NULL }, |
163 | { DT_REG, N("regs"), PFSregs, procfs_validregs }, | | 163 | { DT_REG, N("regs"), PFSregs, procfs_validregs }, |
164 | { DT_REG, N("fpregs"), PFSfpregs, procfs_validfpregs }, | | 164 | { DT_REG, N("fpregs"), PFSfpregs, procfs_validfpregs }, |
165 | { DT_REG, N("ctl"), PFSctl, NULL }, | | 165 | { DT_REG, N("ctl"), PFSctl, NULL }, |
166 | { DT_REG, N("stat"), PFSstat, procfs_validfile_linux }, | | 166 | { DT_REG, N("stat"), PFSstat, procfs_validfile_linux }, |
167 | { DT_REG, N("status"), PFSstatus, NULL }, | | 167 | { DT_REG, N("status"), PFSstatus, NULL }, |
168 | { DT_REG, N("note"), PFSnote, NULL }, | | 168 | { DT_REG, N("note"), PFSnote, NULL }, |
169 | { DT_REG, N("notepg"), PFSnotepg, NULL }, | | 169 | { DT_REG, N("notepg"), PFSnotepg, NULL }, |
170 | { DT_REG, N("map"), PFSmap, procfs_validmap }, | | 170 | { DT_REG, N("map"), PFSmap, procfs_validmap }, |
171 | { DT_REG, N("maps"), PFSmaps, procfs_validmap }, | | 171 | { DT_REG, N("maps"), PFSmaps, procfs_validmap }, |
172 | { DT_REG, N("cmdline"), PFScmdline, NULL }, | | 172 | { DT_REG, N("cmdline"), PFScmdline, NULL }, |
173 | { DT_REG, N("exe"), PFSexe, procfs_validfile }, | | 173 | { DT_REG, N("exe"), PFSexe, procfs_validfile }, |
174 | { DT_LNK, N("cwd"), PFScwd, NULL }, | | 174 | { DT_LNK, N("cwd"), PFScwd, NULL }, |
175 | { DT_LNK, N("root"), PFSchroot, NULL }, | | 175 | { DT_LNK, N("root"), PFSchroot, NULL }, |
176 | { DT_LNK, N("emul"), PFSemul, NULL }, | | 176 | { DT_LNK, N("emul"), PFSemul, NULL }, |
177 | { DT_REG, N("statm"), PFSstatm, procfs_validfile_linux }, | | 177 | { DT_REG, N("statm"), PFSstatm, procfs_validfile_linux }, |
178 | { DT_DIR, N("task"), PFStask, procfs_validfile_linux }, | | 178 | { DT_DIR, N("task"), PFStask, procfs_validfile_linux }, |
179 | #ifdef __HAVE_PROCFS_MACHDEP | | 179 | #ifdef __HAVE_PROCFS_MACHDEP |
180 | PROCFS_MACHDEP_NODETYPE_DEFNS | | 180 | PROCFS_MACHDEP_NODETYPE_DEFNS |
181 | #endif | | 181 | #endif |
182 | #undef N | | 182 | #undef N |
183 | }; | | 183 | }; |
184 | static const int nproc_targets = sizeof(proc_targets) / sizeof(proc_targets[0]); | | 184 | static const int nproc_targets = sizeof(proc_targets) / sizeof(proc_targets[0]); |
185 | | | 185 | |
186 | /* | | 186 | /* |
187 | * List of files in the root directory. Note: the validate function will | | 187 | * List of files in the root directory. Note: the validate function will |
188 | * be called with p == NULL for these ones. | | 188 | * be called with p == NULL for these ones. |
189 | */ | | 189 | */ |
190 | static const struct proc_target proc_root_targets[] = { | | 190 | static const struct proc_target proc_root_targets[] = { |
191 | #define N(s) sizeof(s)-1, s | | 191 | #define N(s) sizeof(s)-1, s |
192 | /* name type validp */ | | 192 | /* name type validp */ |
193 | { DT_REG, N("meminfo"), PFSmeminfo, procfs_validfile_linux }, | | 193 | { DT_REG, N("meminfo"), PFSmeminfo, procfs_validfile_linux }, |
194 | { DT_REG, N("cpuinfo"), PFScpuinfo, procfs_validfile_linux }, | | 194 | { DT_REG, N("cpuinfo"), PFScpuinfo, procfs_validfile_linux }, |
195 | { DT_REG, N("uptime"), PFSuptime, procfs_validfile_linux }, | | 195 | { DT_REG, N("uptime"), PFSuptime, procfs_validfile_linux }, |
196 | { DT_REG, N("mounts"), PFSmounts, procfs_validfile_linux }, | | 196 | { DT_REG, N("mounts"), PFSmounts, procfs_validfile_linux }, |
197 | { DT_REG, N("devices"), PFSdevices, procfs_validfile_linux }, | | 197 | { DT_REG, N("devices"), PFSdevices, procfs_validfile_linux }, |
198 | { DT_REG, N("stat"), PFScpustat, procfs_validfile_linux }, | | 198 | { DT_REG, N("stat"), PFScpustat, procfs_validfile_linux }, |
199 | { DT_REG, N("loadavg"), PFSloadavg, procfs_validfile_linux }, | | 199 | { DT_REG, N("loadavg"), PFSloadavg, procfs_validfile_linux }, |
200 | { DT_REG, N("version"), PFSversion, procfs_validfile_linux }, | | 200 | { DT_REG, N("version"), PFSversion, procfs_validfile_linux }, |
201 | #undef N | | 201 | #undef N |
202 | }; | | 202 | }; |
203 | static const int nproc_root_targets = | | 203 | static const int nproc_root_targets = |
204 | sizeof(proc_root_targets) / sizeof(proc_root_targets[0]); | | 204 | sizeof(proc_root_targets) / sizeof(proc_root_targets[0]); |
205 | | | 205 | |
206 | int procfs_lookup(void *); | | 206 | int procfs_lookup(void *); |
207 | #define procfs_create genfs_eopnotsupp | | 207 | #define procfs_create genfs_eopnotsupp |
208 | #define procfs_mknod genfs_eopnotsupp | | 208 | #define procfs_mknod genfs_eopnotsupp |
209 | int procfs_open(void *); | | 209 | int procfs_open(void *); |
210 | int procfs_close(void *); | | 210 | int procfs_close(void *); |
211 | int procfs_access(void *); | | 211 | int procfs_access(void *); |
212 | int procfs_getattr(void *); | | 212 | int procfs_getattr(void *); |
213 | int procfs_setattr(void *); | | 213 | int procfs_setattr(void *); |
214 | #define procfs_read procfs_rw | | 214 | #define procfs_read procfs_rw |
215 | #define procfs_write procfs_rw | | 215 | #define procfs_write procfs_rw |
216 | #define procfs_fcntl genfs_fcntl | | 216 | #define procfs_fcntl genfs_fcntl |
217 | #define procfs_ioctl genfs_enoioctl | | 217 | #define procfs_ioctl genfs_enoioctl |
218 | #define procfs_poll genfs_poll | | 218 | #define procfs_poll genfs_poll |
219 | #define procfs_revoke genfs_revoke | | 219 | #define procfs_revoke genfs_revoke |
220 | #define procfs_fsync genfs_nullop | | 220 | #define procfs_fsync genfs_nullop |
221 | #define procfs_seek genfs_nullop | | 221 | #define procfs_seek genfs_nullop |
222 | #define procfs_remove genfs_eopnotsupp | | 222 | #define procfs_remove genfs_eopnotsupp |
223 | int procfs_link(void *); | | 223 | int procfs_link(void *); |
224 | #define procfs_rename genfs_eopnotsupp | | 224 | #define procfs_rename genfs_eopnotsupp |
225 | #define procfs_mkdir genfs_eopnotsupp | | 225 | #define procfs_mkdir genfs_eopnotsupp |
226 | #define procfs_rmdir genfs_eopnotsupp | | 226 | #define procfs_rmdir genfs_eopnotsupp |
227 | int procfs_symlink(void *); | | 227 | int procfs_symlink(void *); |
228 | int procfs_readdir(void *); | | 228 | int procfs_readdir(void *); |
229 | int procfs_readlink(void *); | | 229 | int procfs_readlink(void *); |
230 | #define procfs_abortop genfs_abortop | | 230 | #define procfs_abortop genfs_abortop |
231 | int procfs_inactive(void *); | | 231 | int procfs_inactive(void *); |
232 | int procfs_reclaim(void *); | | 232 | int procfs_reclaim(void *); |
233 | #define procfs_lock genfs_lock | | 233 | #define procfs_lock genfs_lock |
234 | #define procfs_unlock genfs_unlock | | 234 | #define procfs_unlock genfs_unlock |
235 | #define procfs_bmap genfs_badop | | 235 | #define procfs_bmap genfs_badop |
236 | #define procfs_strategy genfs_badop | | 236 | #define procfs_strategy genfs_badop |
237 | int procfs_print(void *); | | 237 | int procfs_print(void *); |
238 | int procfs_pathconf(void *); | | 238 | int procfs_pathconf(void *); |
239 | #define procfs_islocked genfs_islocked | | 239 | #define procfs_islocked genfs_islocked |
240 | #define procfs_advlock genfs_einval | | 240 | #define procfs_advlock genfs_einval |
241 | #define procfs_bwrite genfs_eopnotsupp | | 241 | #define procfs_bwrite genfs_eopnotsupp |
| | | 242 | int procfs_getpages(void *); |
242 | #define procfs_putpages genfs_null_putpages | | 243 | #define procfs_putpages genfs_null_putpages |
243 | | | 244 | |
244 | static int atoi(const char *, size_t); | | 245 | static int atoi(const char *, size_t); |
245 | | | 246 | |
246 | /* | | 247 | /* |
247 | * procfs vnode operations. | | 248 | * procfs vnode operations. |
248 | */ | | 249 | */ |
249 | int (**procfs_vnodeop_p)(void *); | | 250 | int (**procfs_vnodeop_p)(void *); |
250 | const struct vnodeopv_entry_desc procfs_vnodeop_entries[] = { | | 251 | const struct vnodeopv_entry_desc procfs_vnodeop_entries[] = { |
251 | { &vop_default_desc, vn_default_error }, | | 252 | { &vop_default_desc, vn_default_error }, |
252 | { &vop_lookup_desc, procfs_lookup }, /* lookup */ | | 253 | { &vop_lookup_desc, procfs_lookup }, /* lookup */ |
253 | { &vop_create_desc, procfs_create }, /* create */ | | 254 | { &vop_create_desc, procfs_create }, /* create */ |
254 | { &vop_mknod_desc, procfs_mknod }, /* mknod */ | | 255 | { &vop_mknod_desc, procfs_mknod }, /* mknod */ |
255 | { &vop_open_desc, procfs_open }, /* open */ | | 256 | { &vop_open_desc, procfs_open }, /* open */ |
256 | { &vop_close_desc, procfs_close }, /* close */ | | 257 | { &vop_close_desc, procfs_close }, /* close */ |
257 | { &vop_access_desc, procfs_access }, /* access */ | | 258 | { &vop_access_desc, procfs_access }, /* access */ |
258 | { &vop_getattr_desc, procfs_getattr }, /* getattr */ | | 259 | { &vop_getattr_desc, procfs_getattr }, /* getattr */ |
259 | { &vop_setattr_desc, procfs_setattr }, /* setattr */ | | 260 | { &vop_setattr_desc, procfs_setattr }, /* setattr */ |
260 | { &vop_read_desc, procfs_read }, /* read */ | | 261 | { &vop_read_desc, procfs_read }, /* read */ |
261 | { &vop_write_desc, procfs_write }, /* write */ | | 262 | { &vop_write_desc, procfs_write }, /* write */ |
262 | { &vop_fallocate_desc, genfs_eopnotsupp }, /* fallocate */ | | 263 | { &vop_fallocate_desc, genfs_eopnotsupp }, /* fallocate */ |
263 | { &vop_fdiscard_desc, genfs_eopnotsupp }, /* fdiscard */ | | 264 | { &vop_fdiscard_desc, genfs_eopnotsupp }, /* fdiscard */ |
264 | { &vop_fcntl_desc, procfs_fcntl }, /* fcntl */ | | 265 | { &vop_fcntl_desc, procfs_fcntl }, /* fcntl */ |
265 | { &vop_ioctl_desc, procfs_ioctl }, /* ioctl */ | | 266 | { &vop_ioctl_desc, procfs_ioctl }, /* ioctl */ |
266 | { &vop_poll_desc, procfs_poll }, /* poll */ | | 267 | { &vop_poll_desc, procfs_poll }, /* poll */ |
267 | { &vop_revoke_desc, procfs_revoke }, /* revoke */ | | 268 | { &vop_revoke_desc, procfs_revoke }, /* revoke */ |
268 | { &vop_fsync_desc, procfs_fsync }, /* fsync */ | | 269 | { &vop_fsync_desc, procfs_fsync }, /* fsync */ |
269 | { &vop_seek_desc, procfs_seek }, /* seek */ | | 270 | { &vop_seek_desc, procfs_seek }, /* seek */ |
270 | { &vop_remove_desc, procfs_remove }, /* remove */ | | 271 | { &vop_remove_desc, procfs_remove }, /* remove */ |
271 | { &vop_link_desc, procfs_link }, /* link */ | | 272 | { &vop_link_desc, procfs_link }, /* link */ |
272 | { &vop_rename_desc, procfs_rename }, /* rename */ | | 273 | { &vop_rename_desc, procfs_rename }, /* rename */ |
273 | { &vop_mkdir_desc, procfs_mkdir }, /* mkdir */ | | 274 | { &vop_mkdir_desc, procfs_mkdir }, /* mkdir */ |
274 | { &vop_rmdir_desc, procfs_rmdir }, /* rmdir */ | | 275 | { &vop_rmdir_desc, procfs_rmdir }, /* rmdir */ |
275 | { &vop_symlink_desc, procfs_symlink }, /* symlink */ | | 276 | { &vop_symlink_desc, procfs_symlink }, /* symlink */ |
276 | { &vop_readdir_desc, procfs_readdir }, /* readdir */ | | 277 | { &vop_readdir_desc, procfs_readdir }, /* readdir */ |
277 | { &vop_readlink_desc, procfs_readlink }, /* readlink */ | | 278 | { &vop_readlink_desc, procfs_readlink }, /* readlink */ |
278 | { &vop_abortop_desc, procfs_abortop }, /* abortop */ | | 279 | { &vop_abortop_desc, procfs_abortop }, /* abortop */ |
279 | { &vop_inactive_desc, procfs_inactive }, /* inactive */ | | 280 | { &vop_inactive_desc, procfs_inactive }, /* inactive */ |
280 | { &vop_reclaim_desc, procfs_reclaim }, /* reclaim */ | | 281 | { &vop_reclaim_desc, procfs_reclaim }, /* reclaim */ |
281 | { &vop_lock_desc, procfs_lock }, /* lock */ | | 282 | { &vop_lock_desc, procfs_lock }, /* lock */ |
282 | { &vop_unlock_desc, procfs_unlock }, /* unlock */ | | 283 | { &vop_unlock_desc, procfs_unlock }, /* unlock */ |
283 | { &vop_bmap_desc, procfs_bmap }, /* bmap */ | | 284 | { &vop_bmap_desc, procfs_bmap }, /* bmap */ |
284 | { &vop_strategy_desc, procfs_strategy }, /* strategy */ | | 285 | { &vop_strategy_desc, procfs_strategy }, /* strategy */ |
285 | { &vop_print_desc, procfs_print }, /* print */ | | 286 | { &vop_print_desc, procfs_print }, /* print */ |
286 | { &vop_islocked_desc, procfs_islocked }, /* islocked */ | | 287 | { &vop_islocked_desc, procfs_islocked }, /* islocked */ |
287 | { &vop_pathconf_desc, procfs_pathconf }, /* pathconf */ | | 288 | { &vop_pathconf_desc, procfs_pathconf }, /* pathconf */ |
288 | { &vop_advlock_desc, procfs_advlock }, /* advlock */ | | 289 | { &vop_advlock_desc, procfs_advlock }, /* advlock */ |
| | | 290 | { &vop_getpages_desc, procfs_getpages }, /* getpages */ |
289 | { &vop_putpages_desc, procfs_putpages }, /* putpages */ | | 291 | { &vop_putpages_desc, procfs_putpages }, /* putpages */ |
290 | { NULL, NULL } | | 292 | { NULL, NULL } |
291 | }; | | 293 | }; |
292 | const struct vnodeopv_desc procfs_vnodeop_opv_desc = | | 294 | const struct vnodeopv_desc procfs_vnodeop_opv_desc = |
293 | { &procfs_vnodeop_p, procfs_vnodeop_entries }; | | 295 | { &procfs_vnodeop_p, procfs_vnodeop_entries }; |
294 | /* | | 296 | /* |
295 | * set things up for doing i/o on | | 297 | * set things up for doing i/o on |
296 | * the pfsnode (vp). (vp) is locked | | 298 | * the pfsnode (vp). (vp) is locked |
297 | * on entry, and should be left locked | | 299 | * on entry, and should be left locked |
298 | * on exit. | | 300 | * on exit. |
299 | * | | 301 | * |
300 | * for procfs we don't need to do anything | | 302 | * for procfs we don't need to do anything |
301 | * in particular for i/o. all that is done | | 303 | * in particular for i/o. all that is done |
302 | * is to support exclusive open on process | | 304 | * is to support exclusive open on process |
303 | * memory images. | | 305 | * memory images. |
304 | */ | | 306 | */ |
305 | int | | 307 | int |
306 | procfs_open(void *v) | | 308 | procfs_open(void *v) |
307 | { | | 309 | { |
308 | struct vop_open_args /* { | | 310 | struct vop_open_args /* { |
309 | struct vnode *a_vp; | | 311 | struct vnode *a_vp; |
310 | int a_mode; | | 312 | int a_mode; |
311 | kauth_cred_t a_cred; | | 313 | kauth_cred_t a_cred; |
312 | } */ *ap = v; | | 314 | } */ *ap = v; |
313 | struct pfsnode *pfs = VTOPFS(ap->a_vp); | | 315 | struct pfsnode *pfs = VTOPFS(ap->a_vp); |
314 | struct lwp *l1; | | 316 | struct lwp *l1; |
315 | struct proc *p2; | | 317 | struct proc *p2; |
316 | int error; | | 318 | int error; |
317 | | | 319 | |
318 | if ((error = procfs_proc_lock(pfs->pfs_pid, &p2, ENOENT)) != 0) | | 320 | if ((error = procfs_proc_lock(pfs->pfs_pid, &p2, ENOENT)) != 0) |
319 | return error; | | 321 | return error; |
320 | | | 322 | |
321 | l1 = curlwp; /* tracer */ | | 323 | l1 = curlwp; /* tracer */ |
322 | | | 324 | |
323 | #define M2K(m) (((m) & FREAD) && ((m) & FWRITE) ? \ | | 325 | #define M2K(m) (((m) & FREAD) && ((m) & FWRITE) ? \ |
324 | KAUTH_REQ_PROCESS_PROCFS_RW : \ | | 326 | KAUTH_REQ_PROCESS_PROCFS_RW : \ |
325 | (m) & FWRITE ? KAUTH_REQ_PROCESS_PROCFS_WRITE : \ | | 327 | (m) & FWRITE ? KAUTH_REQ_PROCESS_PROCFS_WRITE : \ |
326 | KAUTH_REQ_PROCESS_PROCFS_READ) | | 328 | KAUTH_REQ_PROCESS_PROCFS_READ) |
327 | | | 329 | |
328 | mutex_enter(p2->p_lock); | | 330 | mutex_enter(p2->p_lock); |
329 | error = kauth_authorize_process(l1->l_cred, KAUTH_PROCESS_PROCFS, | | 331 | error = kauth_authorize_process(l1->l_cred, KAUTH_PROCESS_PROCFS, |
330 | p2, pfs, KAUTH_ARG(M2K(ap->a_mode)), NULL); | | 332 | p2, pfs, KAUTH_ARG(M2K(ap->a_mode)), NULL); |
331 | mutex_exit(p2->p_lock); | | 333 | mutex_exit(p2->p_lock); |
332 | if (error) { | | 334 | if (error) { |
333 | procfs_proc_unlock(p2); | | 335 | procfs_proc_unlock(p2); |
334 | return (error); | | 336 | return (error); |
335 | } | | 337 | } |
336 | | | 338 | |
337 | #undef M2K | | 339 | #undef M2K |
338 | | | 340 | |
339 | switch (pfs->pfs_type) { | | 341 | switch (pfs->pfs_type) { |
340 | case PFSmem: | | 342 | case PFSmem: |
341 | if (((pfs->pfs_flags & FWRITE) && (ap->a_mode & O_EXCL)) || | | 343 | if (((pfs->pfs_flags & FWRITE) && (ap->a_mode & O_EXCL)) || |
342 | ((pfs->pfs_flags & O_EXCL) && (ap->a_mode & FWRITE))) { | | 344 | ((pfs->pfs_flags & O_EXCL) && (ap->a_mode & FWRITE))) { |
343 | error = EBUSY; | | 345 | error = EBUSY; |
344 | break; | | 346 | break; |
345 | } | | 347 | } |
346 | | | 348 | |
347 | if (!proc_isunder(p2, l1)) { | | 349 | if (!proc_isunder(p2, l1)) { |
348 | error = EPERM; | | 350 | error = EPERM; |
349 | break; | | 351 | break; |
350 | } | | 352 | } |
351 | | | 353 | |
352 | if (ap->a_mode & FWRITE) | | 354 | if (ap->a_mode & FWRITE) |
353 | pfs->pfs_flags = ap->a_mode & (FWRITE|O_EXCL); | | 355 | pfs->pfs_flags = ap->a_mode & (FWRITE|O_EXCL); |
354 | | | 356 | |
355 | break; | | 357 | break; |
356 | | | 358 | |
357 | case PFSregs: | | 359 | case PFSregs: |
358 | case PFSfpregs: | | 360 | case PFSfpregs: |
359 | if (!proc_isunder(p2, l1)) { | | 361 | if (!proc_isunder(p2, l1)) { |
360 | error = EPERM; | | 362 | error = EPERM; |
361 | break; | | 363 | break; |
362 | } | | 364 | } |
363 | break; | | 365 | break; |
364 | | | 366 | |
365 | default: | | 367 | default: |
366 | break; | | 368 | break; |
367 | } | | 369 | } |
368 | | | 370 | |
369 | procfs_proc_unlock(p2); | | 371 | procfs_proc_unlock(p2); |
370 | return (error); | | 372 | return (error); |
371 | } | | 373 | } |
372 | | | 374 | |
373 | /* | | 375 | /* |
374 | * close the pfsnode (vp) after doing i/o. | | 376 | * close the pfsnode (vp) after doing i/o. |
375 | * (vp) is not locked on entry or exit. | | 377 | * (vp) is not locked on entry or exit. |
376 | * | | 378 | * |
377 | * nothing to do for procfs other than undo | | 379 | * nothing to do for procfs other than undo |
378 | * any exclusive open flag (see _open above). | | 380 | * any exclusive open flag (see _open above). |
379 | */ | | 381 | */ |
380 | int | | 382 | int |
381 | procfs_close(void *v) | | 383 | procfs_close(void *v) |
382 | { | | 384 | { |
383 | struct vop_close_args /* { | | 385 | struct vop_close_args /* { |
384 | struct vnode *a_vp; | | 386 | struct vnode *a_vp; |
385 | int a_fflag; | | 387 | int a_fflag; |
386 | kauth_cred_t a_cred; | | 388 | kauth_cred_t a_cred; |
387 | } */ *ap = v; | | 389 | } */ *ap = v; |
388 | struct pfsnode *pfs = VTOPFS(ap->a_vp); | | 390 | struct pfsnode *pfs = VTOPFS(ap->a_vp); |
389 | | | 391 | |
390 | switch (pfs->pfs_type) { | | 392 | switch (pfs->pfs_type) { |
391 | case PFSmem: | | 393 | case PFSmem: |
392 | if ((ap->a_fflag & FWRITE) && (pfs->pfs_flags & O_EXCL)) | | 394 | if ((ap->a_fflag & FWRITE) && (pfs->pfs_flags & O_EXCL)) |
393 | pfs->pfs_flags &= ~(FWRITE|O_EXCL); | | 395 | pfs->pfs_flags &= ~(FWRITE|O_EXCL); |
394 | break; | | 396 | break; |
395 | | | 397 | |
396 | default: | | 398 | default: |
397 | break; | | 399 | break; |
398 | } | | 400 | } |
399 | | | 401 | |
400 | return (0); | | 402 | return (0); |
401 | } | | 403 | } |
402 | | | 404 | |
403 | /* | | 405 | /* |
404 | * _inactive is called when the pfsnode | | 406 | * _inactive is called when the pfsnode |
405 | * is vrele'd and the reference count goes | | 407 | * is vrele'd and the reference count goes |
406 | * to zero. (vp) will be on the vnode free | | 408 | * to zero. (vp) will be on the vnode free |
407 | * list, so to get it back vget() must be | | 409 | * list, so to get it back vget() must be |
408 | * used. | | 410 | * used. |
409 | * | | 411 | * |
410 | * (vp) is locked on entry, but must be unlocked on exit. | | 412 | * (vp) is locked on entry, but must be unlocked on exit. |
411 | */ | | 413 | */ |
412 | int | | 414 | int |
413 | procfs_inactive(void *v) | | 415 | procfs_inactive(void *v) |
414 | { | | 416 | { |
415 | struct vop_inactive_args /* { | | 417 | struct vop_inactive_args /* { |
416 | struct vnode *a_vp; | | 418 | struct vnode *a_vp; |
417 | bool *a_recycle; | | 419 | bool *a_recycle; |
418 | } */ *ap = v; | | 420 | } */ *ap = v; |
419 | struct vnode *vp = ap->a_vp; | | 421 | struct vnode *vp = ap->a_vp; |
420 | struct pfsnode *pfs = VTOPFS(vp); | | 422 | struct pfsnode *pfs = VTOPFS(vp); |
421 | | | 423 | |
422 | mutex_enter(proc_lock); | | 424 | mutex_enter(proc_lock); |
423 | *ap->a_recycle = (proc_find(pfs->pfs_pid) == NULL); | | 425 | *ap->a_recycle = (proc_find(pfs->pfs_pid) == NULL); |
424 | mutex_exit(proc_lock); | | 426 | mutex_exit(proc_lock); |
425 | | | 427 | |
426 | VOP_UNLOCK(vp); | | 428 | VOP_UNLOCK(vp); |
427 | | | 429 | |
428 | return (0); | | 430 | return (0); |
429 | } | | 431 | } |
430 | | | 432 | |
431 | /* | | 433 | /* |
432 | * _reclaim is called when getnewvnode() | | 434 | * _reclaim is called when getnewvnode() |
433 | * wants to make use of an entry on the vnode | | 435 | * wants to make use of an entry on the vnode |
434 | * free list. at this time the filesystem needs | | 436 | * free list. at this time the filesystem needs |
435 | * to free any private data and remove the node | | 437 | * to free any private data and remove the node |
436 | * from any private lists. | | 438 | * from any private lists. |
437 | */ | | 439 | */ |
438 | int | | 440 | int |
439 | procfs_reclaim(void *v) | | 441 | procfs_reclaim(void *v) |
440 | { | | 442 | { |
441 | struct vop_reclaim_args /* { | | 443 | struct vop_reclaim_args /* { |
442 | struct vnode *a_vp; | | 444 | struct vnode *a_vp; |
443 | } */ *ap = v; | | 445 | } */ *ap = v; |
444 | struct vnode *vp = ap->a_vp; | | 446 | struct vnode *vp = ap->a_vp; |
445 | struct pfsnode *pfs = VTOPFS(vp); | | 447 | struct pfsnode *pfs = VTOPFS(vp); |
446 | | | 448 | |
447 | /* | | 449 | /* |
448 | * To interlock with procfs_revoke_vnodes(). | | 450 | * To interlock with procfs_revoke_vnodes(). |
449 | */ | | 451 | */ |
450 | mutex_enter(vp->v_interlock); | | 452 | mutex_enter(vp->v_interlock); |
451 | vp->v_data = NULL; | | 453 | vp->v_data = NULL; |
452 | mutex_exit(vp->v_interlock); | | 454 | mutex_exit(vp->v_interlock); |
453 | vcache_remove(vp->v_mount, &pfs->pfs_key, sizeof(pfs->pfs_key)); | | 455 | vcache_remove(vp->v_mount, &pfs->pfs_key, sizeof(pfs->pfs_key)); |
454 | kmem_free(pfs, sizeof(*pfs)); | | 456 | kmem_free(pfs, sizeof(*pfs)); |
455 | return 0; | | 457 | return 0; |
456 | } | | 458 | } |
457 | | | 459 | |
458 | /* | | 460 | /* |
459 | * Return POSIX pathconf information applicable to special devices. | | 461 | * Return POSIX pathconf information applicable to special devices. |
460 | */ | | 462 | */ |
461 | int | | 463 | int |
462 | procfs_pathconf(void *v) | | 464 | procfs_pathconf(void *v) |
463 | { | | 465 | { |
464 | struct vop_pathconf_args /* { | | 466 | struct vop_pathconf_args /* { |
465 | struct vnode *a_vp; | | 467 | struct vnode *a_vp; |
466 | int a_name; | | 468 | int a_name; |
467 | register_t *a_retval; | | 469 | register_t *a_retval; |
468 | } */ *ap = v; | | 470 | } */ *ap = v; |
469 | | | 471 | |
470 | switch (ap->a_name) { | | 472 | switch (ap->a_name) { |
471 | case _PC_LINK_MAX: | | 473 | case _PC_LINK_MAX: |
472 | *ap->a_retval = LINK_MAX; | | 474 | *ap->a_retval = LINK_MAX; |
473 | return (0); | | 475 | return (0); |
474 | case _PC_MAX_CANON: | | 476 | case _PC_MAX_CANON: |
475 | *ap->a_retval = MAX_CANON; | | 477 | *ap->a_retval = MAX_CANON; |
476 | return (0); | | 478 | return (0); |
477 | case _PC_MAX_INPUT: | | 479 | case _PC_MAX_INPUT: |
478 | *ap->a_retval = MAX_INPUT; | | 480 | *ap->a_retval = MAX_INPUT; |
479 | return (0); | | 481 | return (0); |
480 | case _PC_PIPE_BUF: | | 482 | case _PC_PIPE_BUF: |
481 | *ap->a_retval = PIPE_BUF; | | 483 | *ap->a_retval = PIPE_BUF; |
482 | return (0); | | 484 | return (0); |
483 | case _PC_CHOWN_RESTRICTED: | | 485 | case _PC_CHOWN_RESTRICTED: |
484 | *ap->a_retval = 1; | | 486 | *ap->a_retval = 1; |
485 | return (0); | | 487 | return (0); |
486 | case _PC_VDISABLE: | | 488 | case _PC_VDISABLE: |
487 | *ap->a_retval = _POSIX_VDISABLE; | | 489 | *ap->a_retval = _POSIX_VDISABLE; |
488 | return (0); | | 490 | return (0); |
489 | case _PC_SYNC_IO: | | 491 | case _PC_SYNC_IO: |
490 | *ap->a_retval = 1; | | 492 | *ap->a_retval = 1; |
491 | return (0); | | 493 | return (0); |
492 | default: | | 494 | default: |
493 | return (EINVAL); | | 495 | return (EINVAL); |
494 | } | | 496 | } |
495 | /* NOTREACHED */ | | 497 | /* NOTREACHED */ |
496 | } | | 498 | } |
497 | | | 499 | |
498 | /* | | 500 | /* |
499 | * _print is used for debugging. | | 501 | * _print is used for debugging. |
500 | * just print a readable description | | 502 | * just print a readable description |
501 | * of (vp). | | 503 | * of (vp). |
502 | */ | | 504 | */ |
503 | int | | 505 | int |
504 | procfs_print(void *v) | | 506 | procfs_print(void *v) |
505 | { | | 507 | { |
506 | struct vop_print_args /* { | | 508 | struct vop_print_args /* { |
507 | struct vnode *a_vp; | | 509 | struct vnode *a_vp; |
508 | } */ *ap = v; | | 510 | } */ *ap = v; |
509 | struct pfsnode *pfs = VTOPFS(ap->a_vp); | | 511 | struct pfsnode *pfs = VTOPFS(ap->a_vp); |
510 | | | 512 | |
511 | printf("tag VT_PROCFS, type %d, pid %d, mode %x, flags %lx\n", | | 513 | printf("tag VT_PROCFS, type %d, pid %d, mode %x, flags %lx\n", |
512 | pfs->pfs_type, pfs->pfs_pid, pfs->pfs_mode, pfs->pfs_flags); | | 514 | pfs->pfs_type, pfs->pfs_pid, pfs->pfs_mode, pfs->pfs_flags); |
513 | return 0; | | 515 | return 0; |
514 | } | | 516 | } |
515 | | | 517 | |
516 | int | | 518 | int |
517 | procfs_link(void *v) | | 519 | procfs_link(void *v) |
518 | { | | 520 | { |
519 | struct vop_link_args /* { | | 521 | struct vop_link_args /* { |
520 | struct vnode *a_dvp; | | 522 | struct vnode *a_dvp; |
521 | struct vnode *a_vp; | | 523 | struct vnode *a_vp; |
522 | struct componentname *a_cnp; | | 524 | struct componentname *a_cnp; |
523 | } */ *ap = v; | | 525 | } */ *ap = v; |
524 | | | 526 | |
525 | VOP_ABORTOP(ap->a_dvp, ap->a_cnp); | | 527 | VOP_ABORTOP(ap->a_dvp, ap->a_cnp); |
526 | vput(ap->a_dvp); | | 528 | vput(ap->a_dvp); |
527 | return (EROFS); | | 529 | return (EROFS); |
528 | } | | 530 | } |
529 | | | 531 | |
530 | int | | 532 | int |
531 | procfs_symlink(void *v) | | 533 | procfs_symlink(void *v) |
532 | { | | 534 | { |
533 | struct vop_symlink_v3_args /* { | | 535 | struct vop_symlink_v3_args /* { |
534 | struct vnode *a_dvp; | | 536 | struct vnode *a_dvp; |
535 | struct vnode **a_vpp; | | 537 | struct vnode **a_vpp; |
536 | struct componentname *a_cnp; | | 538 | struct componentname *a_cnp; |
537 | struct vattr *a_vap; | | 539 | struct vattr *a_vap; |
538 | char *a_target; | | 540 | char *a_target; |
539 | } */ *ap = v; | | 541 | } */ *ap = v; |
540 | | | 542 | |
541 | VOP_ABORTOP(ap->a_dvp, ap->a_cnp); | | 543 | VOP_ABORTOP(ap->a_dvp, ap->a_cnp); |
542 | return (EROFS); | | 544 | return (EROFS); |
543 | } | | 545 | } |
544 | | | 546 | |
545 | /* | | 547 | /* |
546 | * Works out the path to (and vnode of) the target process's current | | 548 | * Works out the path to (and vnode of) the target process's current |
547 | * working directory or chroot. If the caller is in a chroot and | | 549 | * working directory or chroot. If the caller is in a chroot and |
548 | * can't "reach" the target's cwd or root (or some other error | | 550 | * can't "reach" the target's cwd or root (or some other error |
549 | * occurs), a "/" is returned for the path and a NULL pointer is | | 551 | * occurs), a "/" is returned for the path and a NULL pointer is |
550 | * returned for the vnode. | | 552 | * returned for the vnode. |
551 | */ | | 553 | */ |
552 | static void | | 554 | static void |
553 | procfs_dir(pfstype t, struct lwp *caller, struct proc *target, char **bpp, | | 555 | procfs_dir(pfstype t, struct lwp *caller, struct proc *target, char **bpp, |
554 | char *path, size_t len) | | 556 | char *path, size_t len) |
555 | { | | 557 | { |
556 | struct cwdinfo *cwdi; | | 558 | struct cwdinfo *cwdi; |
557 | struct vnode *vp, *rvp; | | 559 | struct vnode *vp, *rvp; |
558 | char *bp; | | 560 | char *bp; |
559 | | | 561 | |
560 | cwdi = caller->l_proc->p_cwdi; | | 562 | cwdi = caller->l_proc->p_cwdi; |
561 | rw_enter(&cwdi->cwdi_lock, RW_READER); | | 563 | rw_enter(&cwdi->cwdi_lock, RW_READER); |
562 | | | 564 | |
563 | rvp = cwdi->cwdi_rdir; | | 565 | rvp = cwdi->cwdi_rdir; |
564 | bp = bpp ? *bpp : NULL; | | 566 | bp = bpp ? *bpp : NULL; |
565 | | | 567 | |
566 | switch (t) { | | 568 | switch (t) { |
567 | case PFScwd: | | 569 | case PFScwd: |
568 | vp = target->p_cwdi->cwdi_cdir; | | 570 | vp = target->p_cwdi->cwdi_cdir; |
569 | break; | | 571 | break; |
570 | case PFSchroot: | | 572 | case PFSchroot: |
571 | vp = target->p_cwdi->cwdi_rdir; | | 573 | vp = target->p_cwdi->cwdi_rdir; |
572 | break; | | 574 | break; |
573 | case PFSexe: | | 575 | case PFSexe: |
574 | vp = target->p_textvp; | | 576 | vp = target->p_textvp; |
575 | break; | | 577 | break; |
576 | default: | | 578 | default: |
577 | rw_exit(&cwdi->cwdi_lock); | | 579 | rw_exit(&cwdi->cwdi_lock); |
578 | return; | | 580 | return; |
579 | } | | 581 | } |
580 | | | 582 | |
581 | /* | | 583 | /* |
582 | * XXX: this horrible kludge avoids locking panics when | | 584 | * XXX: this horrible kludge avoids locking panics when |
583 | * attempting to lookup links that point to within procfs | | 585 | * attempting to lookup links that point to within procfs |
584 | */ | | 586 | */ |
585 | if (vp != NULL && vp->v_tag == VT_PROCFS) { | | 587 | if (vp != NULL && vp->v_tag == VT_PROCFS) { |
586 | if (bpp) { | | 588 | if (bpp) { |
587 | *--bp = '/'; | | 589 | *--bp = '/'; |
588 | *bpp = bp; | | 590 | *bpp = bp; |
589 | } | | 591 | } |
590 | rw_exit(&cwdi->cwdi_lock); | | 592 | rw_exit(&cwdi->cwdi_lock); |
591 | return; | | 593 | return; |
592 | } | | 594 | } |
593 | | | 595 | |
594 | if (rvp == NULL) | | 596 | if (rvp == NULL) |
595 | rvp = rootvnode; | | 597 | rvp = rootvnode; |
596 | if (vp == NULL || getcwd_common(vp, rvp, bp ? &bp : NULL, path, | | 598 | if (vp == NULL || getcwd_common(vp, rvp, bp ? &bp : NULL, path, |
597 | len / 2, 0, caller) != 0) { | | 599 | len / 2, 0, caller) != 0) { |
598 | vp = NULL; | | 600 | vp = NULL; |
599 | if (bpp) { | | 601 | if (bpp) { |
600 | /* | | 602 | /* |
601 | if (t == PFSexe) { | | 603 | if (t == PFSexe) { |
602 | snprintf(path, len, "%s/%d/file" | | 604 | snprintf(path, len, "%s/%d/file" |
603 | mp->mnt_stat.f_mntonname, pfs->pfs_pid); | | 605 | mp->mnt_stat.f_mntonname, pfs->pfs_pid); |
604 | } else */ { | | 606 | } else */ { |
605 | bp = *bpp; | | 607 | bp = *bpp; |
606 | *--bp = '/'; | | 608 | *--bp = '/'; |
607 | } | | 609 | } |
608 | } | | 610 | } |
609 | } | | 611 | } |
610 | | | 612 | |
611 | if (bpp) | | 613 | if (bpp) |
612 | *bpp = bp; | | 614 | *bpp = bp; |
613 | | | 615 | |
614 | rw_exit(&cwdi->cwdi_lock); | | 616 | rw_exit(&cwdi->cwdi_lock); |
615 | } | | 617 | } |
616 | | | 618 | |
617 | /* | | 619 | /* |
618 | * Invent attributes for pfsnode (vp) and store | | 620 | * Invent attributes for pfsnode (vp) and store |
619 | * them in (vap). | | 621 | * them in (vap). |
620 | * Directories lengths are returned as zero since | | 622 | * Directories lengths are returned as zero since |
621 | * any real length would require the genuine size | | 623 | * any real length would require the genuine size |
622 | * to be computed, and nothing cares anyway. | | 624 | * to be computed, and nothing cares anyway. |
623 | * | | 625 | * |
624 | * this is relatively minimal for procfs. | | 626 | * this is relatively minimal for procfs. |
625 | */ | | 627 | */ |
626 | int | | 628 | int |
627 | procfs_getattr(void *v) | | 629 | procfs_getattr(void *v) |
628 | { | | 630 | { |
629 | struct vop_getattr_args /* { | | 631 | struct vop_getattr_args /* { |
630 | struct vnode *a_vp; | | 632 | struct vnode *a_vp; |
631 | struct vattr *a_vap; | | 633 | struct vattr *a_vap; |
632 | kauth_cred_t a_cred; | | 634 | kauth_cred_t a_cred; |
633 | } */ *ap = v; | | 635 | } */ *ap = v; |
634 | struct pfsnode *pfs = VTOPFS(ap->a_vp); | | 636 | struct pfsnode *pfs = VTOPFS(ap->a_vp); |
635 | struct vattr *vap = ap->a_vap; | | 637 | struct vattr *vap = ap->a_vap; |
636 | struct proc *procp; | | 638 | struct proc *procp; |
637 | char *path; | | 639 | char *path; |
638 | int error; | | 640 | int error; |
639 | | | 641 | |
640 | /* first check the process still exists */ | | 642 | /* first check the process still exists */ |
641 | switch (pfs->pfs_type) { | | 643 | switch (pfs->pfs_type) { |
642 | case PFSroot: | | 644 | case PFSroot: |
643 | case PFScurproc: | | 645 | case PFScurproc: |
644 | case PFSself: | | 646 | case PFSself: |
645 | procp = NULL; | | 647 | procp = NULL; |
646 | break; | | 648 | break; |
647 | | | 649 | |
648 | default: | | 650 | default: |
649 | error = procfs_proc_lock(pfs->pfs_pid, &procp, ENOENT); | | 651 | error = procfs_proc_lock(pfs->pfs_pid, &procp, ENOENT); |
650 | if (error != 0) | | 652 | if (error != 0) |
651 | return (error); | | 653 | return (error); |
652 | break; | | 654 | break; |
653 | } | | 655 | } |
654 | | | 656 | |
655 | switch (pfs->pfs_type) { | | 657 | switch (pfs->pfs_type) { |
656 | case PFStask: | | 658 | case PFStask: |
657 | if (pfs->pfs_fd == -1) { | | 659 | if (pfs->pfs_fd == -1) { |
658 | path = NULL; | | 660 | path = NULL; |
659 | break; | | 661 | break; |
660 | } | | 662 | } |
661 | /*FALLTHROUGH*/ | | 663 | /*FALLTHROUGH*/ |
662 | case PFScwd: | | 664 | case PFScwd: |
663 | case PFSchroot: | | 665 | case PFSchroot: |
664 | case PFSexe: | | 666 | case PFSexe: |
665 | path = malloc(MAXPATHLEN + 4, M_TEMP, M_WAITOK|M_CANFAIL); | | 667 | path = malloc(MAXPATHLEN + 4, M_TEMP, M_WAITOK|M_CANFAIL); |
666 | if (path == NULL && procp != NULL) { | | 668 | if (path == NULL && procp != NULL) { |
667 | procfs_proc_unlock(procp); | | 669 | procfs_proc_unlock(procp); |
668 | return (ENOMEM); | | 670 | return (ENOMEM); |
669 | } | | 671 | } |
670 | break; | | 672 | break; |
671 | | | 673 | |
672 | default: | | 674 | default: |
673 | path = NULL; | | 675 | path = NULL; |
674 | break; | | 676 | break; |
675 | } | | 677 | } |
676 | | | 678 | |
677 | if (procp != NULL) { | | 679 | if (procp != NULL) { |
678 | mutex_enter(procp->p_lock); | | 680 | mutex_enter(procp->p_lock); |
679 | error = kauth_authorize_process(kauth_cred_get(), | | 681 | error = kauth_authorize_process(kauth_cred_get(), |
680 | KAUTH_PROCESS_CANSEE, procp, | | 682 | KAUTH_PROCESS_CANSEE, procp, |
681 | KAUTH_ARG(KAUTH_REQ_PROCESS_CANSEE_ENTRY), NULL, NULL); | | 683 | KAUTH_ARG(KAUTH_REQ_PROCESS_CANSEE_ENTRY), NULL, NULL); |
682 | mutex_exit(procp->p_lock); | | 684 | mutex_exit(procp->p_lock); |
683 | if (error != 0) { | | 685 | if (error != 0) { |
684 | procfs_proc_unlock(procp); | | 686 | procfs_proc_unlock(procp); |
685 | if (path != NULL) | | 687 | if (path != NULL) |
686 | free(path, M_TEMP); | | 688 | free(path, M_TEMP); |
687 | return (ENOENT); | | 689 | return (ENOENT); |
688 | } | | 690 | } |
689 | } | | 691 | } |
690 | | | 692 | |
691 | error = 0; | | 693 | error = 0; |
692 | | | 694 | |
693 | /* start by zeroing out the attributes */ | | 695 | /* start by zeroing out the attributes */ |
694 | vattr_null(vap); | | 696 | vattr_null(vap); |
695 | | | 697 | |
696 | /* next do all the common fields */ | | 698 | /* next do all the common fields */ |
697 | vap->va_type = ap->a_vp->v_type; | | 699 | vap->va_type = ap->a_vp->v_type; |
698 | vap->va_mode = pfs->pfs_mode; | | 700 | vap->va_mode = pfs->pfs_mode; |
699 | vap->va_fileid = pfs->pfs_fileno; | | 701 | vap->va_fileid = pfs->pfs_fileno; |
700 | vap->va_flags = 0; | | 702 | vap->va_flags = 0; |
701 | vap->va_blocksize = PAGE_SIZE; | | 703 | vap->va_blocksize = PAGE_SIZE; |
702 | | | 704 | |
703 | /* | | 705 | /* |
704 | * Make all times be current TOD. | | 706 | * Make all times be current TOD. |
705 | * | | 707 | * |
706 | * It would be possible to get the process start | | 708 | * It would be possible to get the process start |
707 | * time from the p_stats structure, but there's | | 709 | * time from the p_stats structure, but there's |
708 | * no "file creation" time stamp anyway, and the | | 710 | * no "file creation" time stamp anyway, and the |
709 | * p_stats structure is not addressable if u. gets | | 711 | * p_stats structure is not addressable if u. gets |
710 | * swapped out for that process. | | 712 | * swapped out for that process. |
711 | */ | | 713 | */ |
712 | getnanotime(&vap->va_ctime); | | 714 | getnanotime(&vap->va_ctime); |
713 | vap->va_atime = vap->va_mtime = vap->va_ctime; | | 715 | vap->va_atime = vap->va_mtime = vap->va_ctime; |
714 | if (procp) | | 716 | if (procp) |
715 | TIMEVAL_TO_TIMESPEC(&procp->p_stats->p_start, | | 717 | TIMEVAL_TO_TIMESPEC(&procp->p_stats->p_start, |
716 | &vap->va_birthtime); | | 718 | &vap->va_birthtime); |
717 | else | | 719 | else |
718 | getnanotime(&vap->va_birthtime); | | 720 | getnanotime(&vap->va_birthtime); |
719 | | | 721 | |
720 | switch (pfs->pfs_type) { | | 722 | switch (pfs->pfs_type) { |
721 | case PFSmem: | | 723 | case PFSmem: |
722 | case PFSregs: | | 724 | case PFSregs: |
723 | case PFSfpregs: | | 725 | case PFSfpregs: |
724 | #if defined(__HAVE_PROCFS_MACHDEP) && defined(PROCFS_MACHDEP_PROTECT_CASES) | | 726 | #if defined(__HAVE_PROCFS_MACHDEP) && defined(PROCFS_MACHDEP_PROTECT_CASES) |
725 | PROCFS_MACHDEP_PROTECT_CASES | | 727 | PROCFS_MACHDEP_PROTECT_CASES |
726 | #endif | | 728 | #endif |
727 | /* | | 729 | /* |
728 | * If the process has exercised some setuid or setgid | | 730 | * If the process has exercised some setuid or setgid |
729 | * privilege, then rip away read/write permission so | | 731 | * privilege, then rip away read/write permission so |
730 | * that only root can gain access. | | 732 | * that only root can gain access. |
731 | */ | | 733 | */ |
732 | if (procp->p_flag & PK_SUGID) | | 734 | if (procp->p_flag & PK_SUGID) |
733 | vap->va_mode &= ~(S_IRUSR|S_IWUSR); | | 735 | vap->va_mode &= ~(S_IRUSR|S_IWUSR); |
734 | /* FALLTHROUGH */ | | 736 | /* FALLTHROUGH */ |
735 | case PFSctl: | | 737 | case PFSctl: |
736 | case PFSstatus: | | 738 | case PFSstatus: |
737 | case PFSstat: | | 739 | case PFSstat: |
738 | case PFSnote: | | 740 | case PFSnote: |
739 | case PFSnotepg: | | 741 | case PFSnotepg: |
740 | case PFSmap: | | 742 | case PFSmap: |
741 | case PFSmaps: | | 743 | case PFSmaps: |
742 | case PFScmdline: | | 744 | case PFScmdline: |
743 | case PFSemul: | | 745 | case PFSemul: |
744 | case PFSstatm: | | 746 | case PFSstatm: |
745 | if (pfs->pfs_type == PFSmap || pfs->pfs_type == PFSmaps) | | 747 | if (pfs->pfs_type == PFSmap || pfs->pfs_type == PFSmaps) |
746 | vap->va_mode = S_IRUSR; | | 748 | vap->va_mode = S_IRUSR; |
747 | vap->va_nlink = 1; | | 749 | vap->va_nlink = 1; |
748 | vap->va_uid = kauth_cred_geteuid(procp->p_cred); | | 750 | vap->va_uid = kauth_cred_geteuid(procp->p_cred); |
749 | vap->va_gid = kauth_cred_getegid(procp->p_cred); | | 751 | vap->va_gid = kauth_cred_getegid(procp->p_cred); |
750 | break; | | 752 | break; |
751 | case PFSmeminfo: | | 753 | case PFSmeminfo: |
752 | case PFSdevices: | | 754 | case PFSdevices: |
753 | case PFScpuinfo: | | 755 | case PFScpuinfo: |
754 | case PFSuptime: | | 756 | case PFSuptime: |
755 | case PFSmounts: | | 757 | case PFSmounts: |
756 | case PFScpustat: | | 758 | case PFScpustat: |
757 | case PFSloadavg: | | 759 | case PFSloadavg: |
758 | case PFSversion: | | 760 | case PFSversion: |
759 | vap->va_nlink = 1; | | 761 | vap->va_nlink = 1; |
760 | vap->va_uid = vap->va_gid = 0; | | 762 | vap->va_uid = vap->va_gid = 0; |
761 | break; | | 763 | break; |
762 | | | 764 | |
763 | default: | | 765 | default: |
764 | break; | | 766 | break; |
765 | } | | 767 | } |
766 | | | 768 | |
767 | /* | | 769 | /* |
768 | * now do the object specific fields | | 770 | * now do the object specific fields |
769 | * | | 771 | * |
770 | * The size could be set from struct reg, but it's hardly | | 772 | * The size could be set from struct reg, but it's hardly |
771 | * worth the trouble, and it puts some (potentially) machine | | 773 | * worth the trouble, and it puts some (potentially) machine |
772 | * dependent data into this machine-independent code. If it | | 774 | * dependent data into this machine-independent code. If it |
773 | * becomes important then this function should break out into | | 775 | * becomes important then this function should break out into |
774 | * a per-file stat function in the corresponding .c file. | | 776 | * a per-file stat function in the corresponding .c file. |
775 | */ | | 777 | */ |
776 | | | 778 | |
777 | switch (pfs->pfs_type) { | | 779 | switch (pfs->pfs_type) { |
778 | case PFSroot: | | 780 | case PFSroot: |
779 | /* | | 781 | /* |
780 | * Set nlink to 1 to tell fts(3) we don't actually know. | | 782 | * Set nlink to 1 to tell fts(3) we don't actually know. |
781 | */ | | 783 | */ |
782 | vap->va_nlink = 1; | | 784 | vap->va_nlink = 1; |
783 | vap->va_uid = 0; | | 785 | vap->va_uid = 0; |
784 | vap->va_gid = 0; | | 786 | vap->va_gid = 0; |
785 | vap->va_bytes = vap->va_size = DEV_BSIZE; | | 787 | vap->va_bytes = vap->va_size = DEV_BSIZE; |
786 | break; | | 788 | break; |
787 | | | 789 | |
788 | case PFSself: | | 790 | case PFSself: |
789 | case PFScurproc: { | | 791 | case PFScurproc: { |
790 | char bf[16]; /* should be enough */ | | 792 | char bf[16]; /* should be enough */ |
791 | vap->va_nlink = 1; | | 793 | vap->va_nlink = 1; |
792 | vap->va_uid = 0; | | 794 | vap->va_uid = 0; |
793 | vap->va_gid = 0; | | 795 | vap->va_gid = 0; |
794 | vap->va_bytes = vap->va_size = | | 796 | vap->va_bytes = vap->va_size = |
795 | snprintf(bf, sizeof(bf), "%ld", (long)curproc->p_pid); | | 797 | snprintf(bf, sizeof(bf), "%ld", (long)curproc->p_pid); |
796 | break; | | 798 | break; |
797 | } | | 799 | } |
798 | case PFStask: | | 800 | case PFStask: |
799 | if (pfs->pfs_fd != -1) { | | 801 | if (pfs->pfs_fd != -1) { |
800 | char bf[4]; /* should be enough */ | | 802 | char bf[4]; /* should be enough */ |
801 | vap->va_nlink = 1; | | 803 | vap->va_nlink = 1; |
802 | vap->va_uid = 0; | | 804 | vap->va_uid = 0; |
803 | vap->va_gid = 0; | | 805 | vap->va_gid = 0; |
804 | vap->va_bytes = vap->va_size = | | 806 | vap->va_bytes = vap->va_size = |
805 | snprintf(bf, sizeof(bf), ".."); | | 807 | snprintf(bf, sizeof(bf), ".."); |
806 | break; | | 808 | break; |
807 | } | | 809 | } |
808 | /*FALLTHROUGH*/ | | 810 | /*FALLTHROUGH*/ |
809 | case PFSfd: | | 811 | case PFSfd: |
810 | if (pfs->pfs_fd != -1) { | | 812 | if (pfs->pfs_fd != -1) { |
811 | file_t *fp; | | 813 | file_t *fp; |
812 | | | 814 | |
813 | fp = fd_getfile2(procp, pfs->pfs_fd); | | 815 | fp = fd_getfile2(procp, pfs->pfs_fd); |
814 | if (fp == NULL) { | | 816 | if (fp == NULL) { |
815 | error = EBADF; | | 817 | error = EBADF; |
816 | break; | | 818 | break; |
817 | } | | 819 | } |
818 | vap->va_nlink = 1; | | 820 | vap->va_nlink = 1; |
819 | vap->va_uid = kauth_cred_geteuid(fp->f_cred); | | 821 | vap->va_uid = kauth_cred_geteuid(fp->f_cred); |
820 | vap->va_gid = kauth_cred_getegid(fp->f_cred); | | 822 | vap->va_gid = kauth_cred_getegid(fp->f_cred); |
821 | switch (fp->f_type) { | | 823 | switch (fp->f_type) { |
822 | case DTYPE_VNODE: | | 824 | case DTYPE_VNODE: |
823 | vap->va_bytes = vap->va_size = | | 825 | vap->va_bytes = vap->va_size = |
824 | ((struct vnode *)fp->f_data)->v_size; | | 826 | ((struct vnode *)fp->f_data)->v_size; |
825 | break; | | 827 | break; |
826 | default: | | 828 | default: |
827 | vap->va_bytes = vap->va_size = 0; | | 829 | vap->va_bytes = vap->va_size = 0; |
828 | break; | | 830 | break; |
829 | } | | 831 | } |
830 | closef(fp); | | 832 | closef(fp); |
831 | break; | | 833 | break; |
832 | } | | 834 | } |
833 | /*FALLTHROUGH*/ | | 835 | /*FALLTHROUGH*/ |
834 | case PFSproc: | | 836 | case PFSproc: |
835 | vap->va_nlink = 2; | | 837 | vap->va_nlink = 2; |
836 | vap->va_uid = kauth_cred_geteuid(procp->p_cred); | | 838 | vap->va_uid = kauth_cred_geteuid(procp->p_cred); |
837 | vap->va_gid = kauth_cred_getegid(procp->p_cred); | | 839 | vap->va_gid = kauth_cred_getegid(procp->p_cred); |
838 | vap->va_bytes = vap->va_size = DEV_BSIZE; | | 840 | vap->va_bytes = vap->va_size = DEV_BSIZE; |
839 | break; | | 841 | break; |
840 | | | 842 | |
841 | case PFSfile: | | 843 | case PFSfile: |
842 | error = EOPNOTSUPP; | | 844 | error = EOPNOTSUPP; |
843 | break; | | 845 | break; |
844 | | | 846 | |
845 | case PFSmem: | | 847 | case PFSmem: |
846 | vap->va_bytes = vap->va_size = | | 848 | vap->va_bytes = vap->va_size = |
847 | ctob(procp->p_vmspace->vm_tsize + | | 849 | ctob(procp->p_vmspace->vm_tsize + |
848 | procp->p_vmspace->vm_dsize + | | 850 | procp->p_vmspace->vm_dsize + |
849 | procp->p_vmspace->vm_ssize); | | 851 | procp->p_vmspace->vm_ssize); |
850 | break; | | 852 | break; |
851 | | | 853 | |
852 | #if defined(PT_GETREGS) || defined(PT_SETREGS) | | 854 | #if defined(PT_GETREGS) || defined(PT_SETREGS) |
853 | case PFSregs: | | 855 | case PFSregs: |
854 | vap->va_bytes = vap->va_size = sizeof(struct reg); | | 856 | vap->va_bytes = vap->va_size = sizeof(struct reg); |
855 | break; | | 857 | break; |
856 | #endif | | 858 | #endif |
857 | | | 859 | |
858 | #if defined(PT_GETFPREGS) || defined(PT_SETFPREGS) | | 860 | #if defined(PT_GETFPREGS) || defined(PT_SETFPREGS) |
859 | case PFSfpregs: | | 861 | case PFSfpregs: |
860 | vap->va_bytes = vap->va_size = sizeof(struct fpreg); | | 862 | vap->va_bytes = vap->va_size = sizeof(struct fpreg); |
861 | break; | | 863 | break; |
862 | #endif | | 864 | #endif |
863 | | | 865 | |
864 | case PFSctl: | | 866 | case PFSctl: |
865 | case PFSstatus: | | 867 | case PFSstatus: |
866 | case PFSstat: | | 868 | case PFSstat: |
867 | case PFSnote: | | 869 | case PFSnote: |
868 | case PFSnotepg: | | 870 | case PFSnotepg: |
869 | case PFScmdline: | | 871 | case PFScmdline: |
870 | case PFSmeminfo: | | 872 | case PFSmeminfo: |
871 | case PFSdevices: | | 873 | case PFSdevices: |
872 | case PFScpuinfo: | | 874 | case PFScpuinfo: |
873 | case PFSuptime: | | 875 | case PFSuptime: |
874 | case PFSmounts: | | 876 | case PFSmounts: |
875 | case PFScpustat: | | 877 | case PFScpustat: |
876 | case PFSloadavg: | | 878 | case PFSloadavg: |
877 | case PFSstatm: | | 879 | case PFSstatm: |
878 | case PFSversion: | | 880 | case PFSversion: |
879 | vap->va_bytes = vap->va_size = 0; | | 881 | vap->va_bytes = vap->va_size = 0; |
880 | break; | | 882 | break; |
881 | case PFSmap: | | 883 | case PFSmap: |
882 | case PFSmaps: | | 884 | case PFSmaps: |
883 | /* | | 885 | /* |
884 | * Advise a larger blocksize for the map files, so that | | 886 | * Advise a larger blocksize for the map files, so that |
885 | * they may be read in one pass. | | 887 | * they may be read in one pass. |
886 | */ | | 888 | */ |
887 | vap->va_blocksize = 4 * PAGE_SIZE; | | 889 | vap->va_blocksize = 4 * PAGE_SIZE; |
888 | vap->va_bytes = vap->va_size = 0; | | 890 | vap->va_bytes = vap->va_size = 0; |
889 | break; | | 891 | break; |
890 | | | 892 | |
891 | case PFScwd: | | 893 | case PFScwd: |
892 | case PFSchroot: | | 894 | case PFSchroot: |
893 | case PFSexe: { | | 895 | case PFSexe: { |
894 | char *bp; | | 896 | char *bp; |
895 | | | 897 | |
896 | vap->va_nlink = 1; | | 898 | vap->va_nlink = 1; |
897 | vap->va_uid = 0; | | 899 | vap->va_uid = 0; |
898 | vap->va_gid = 0; | | 900 | vap->va_gid = 0; |
899 | bp = path + MAXPATHLEN; | | 901 | bp = path + MAXPATHLEN; |
900 | *--bp = '\0'; | | 902 | *--bp = '\0'; |
901 | procfs_dir(pfs->pfs_type, curlwp, procp, &bp, path, | | 903 | procfs_dir(pfs->pfs_type, curlwp, procp, &bp, path, |
902 | MAXPATHLEN); | | 904 | MAXPATHLEN); |
903 | vap->va_bytes = vap->va_size = strlen(bp); | | 905 | vap->va_bytes = vap->va_size = strlen(bp); |
904 | break; | | 906 | break; |
905 | } | | 907 | } |
906 | | | 908 | |
907 | case PFSemul: | | 909 | case PFSemul: |
908 | vap->va_bytes = vap->va_size = strlen(procp->p_emul->e_name); | | 910 | vap->va_bytes = vap->va_size = strlen(procp->p_emul->e_name); |
909 | break; | | 911 | break; |
910 | | | 912 | |
911 | #ifdef __HAVE_PROCFS_MACHDEP | | 913 | #ifdef __HAVE_PROCFS_MACHDEP |
912 | PROCFS_MACHDEP_NODETYPE_CASES | | 914 | PROCFS_MACHDEP_NODETYPE_CASES |
913 | error = procfs_machdep_getattr(ap->a_vp, vap, procp); | | 915 | error = procfs_machdep_getattr(ap->a_vp, vap, procp); |
914 | break; | | 916 | break; |
915 | #endif | | 917 | #endif |
916 | | | 918 | |
917 | default: | | 919 | default: |
918 | panic("procfs_getattr"); | | 920 | panic("procfs_getattr"); |
919 | } | | 921 | } |
920 | | | 922 | |
921 | if (procp != NULL) | | 923 | if (procp != NULL) |
922 | procfs_proc_unlock(procp); | | 924 | procfs_proc_unlock(procp); |
923 | if (path != NULL) | | 925 | if (path != NULL) |
924 | free(path, M_TEMP); | | 926 | free(path, M_TEMP); |
925 | | | 927 | |
926 | return (error); | | 928 | return (error); |
927 | } | | 929 | } |
928 | | | 930 | |
929 | /*ARGSUSED*/ | | 931 | /*ARGSUSED*/ |
930 | int | | 932 | int |
931 | procfs_setattr(void *v) | | 933 | procfs_setattr(void *v) |
932 | { | | 934 | { |
933 | /* | | 935 | /* |
934 | * just fake out attribute setting | | 936 | * just fake out attribute setting |
935 | * it's not good to generate an error | | 937 | * it's not good to generate an error |
936 | * return, otherwise things like creat() | | 938 | * return, otherwise things like creat() |
937 | * will fail when they try to set the | | 939 | * will fail when they try to set the |
938 | * file length to 0. worse, this means | | 940 | * file length to 0. worse, this means |
939 | * that echo $note > /proc/$pid/note will fail. | | 941 | * that echo $note > /proc/$pid/note will fail. |
940 | */ | | 942 | */ |
941 | | | 943 | |
942 | return (0); | | 944 | return (0); |
943 | } | | 945 | } |
944 | | | 946 | |
945 | /* | | 947 | /* |
946 | * implement access checking. | | 948 | * implement access checking. |
947 | * | | 949 | * |
948 | * actually, the check for super-user is slightly | | 950 | * actually, the check for super-user is slightly |
949 | * broken since it will allow read access to write-only | | 951 | * broken since it will allow read access to write-only |
950 | * objects. this doesn't cause any particular trouble | | 952 | * objects. this doesn't cause any particular trouble |
951 | * but does mean that the i/o entry points need to check | | 953 | * but does mean that the i/o entry points need to check |
952 | * that the operation really does make sense. | | 954 | * that the operation really does make sense. |
953 | */ | | 955 | */ |
954 | int | | 956 | int |
955 | procfs_access(void *v) | | 957 | procfs_access(void *v) |
956 | { | | 958 | { |
957 | struct vop_access_args /* { | | 959 | struct vop_access_args /* { |
958 | struct vnode *a_vp; | | 960 | struct vnode *a_vp; |
959 | int a_mode; | | 961 | int a_mode; |
960 | kauth_cred_t a_cred; | | 962 | kauth_cred_t a_cred; |
961 | } */ *ap = v; | | 963 | } */ *ap = v; |
962 | struct vattr va; | | 964 | struct vattr va; |
963 | int error; | | 965 | int error; |
964 | | | 966 | |
965 | if ((error = VOP_GETATTR(ap->a_vp, &va, ap->a_cred)) != 0) | | 967 | if ((error = VOP_GETATTR(ap->a_vp, &va, ap->a_cred)) != 0) |
966 | return (error); | | 968 | return (error); |
967 | | | 969 | |
968 | return kauth_authorize_vnode(ap->a_cred, | | 970 | return kauth_authorize_vnode(ap->a_cred, |
969 | KAUTH_ACCESS_ACTION(ap->a_mode, ap->a_vp->v_type, va.va_mode), | | 971 | KAUTH_ACCESS_ACTION(ap->a_mode, ap->a_vp->v_type, va.va_mode), |
970 | ap->a_vp, NULL, genfs_can_access(va.va_type, va.va_mode, | | 972 | ap->a_vp, NULL, genfs_can_access(va.va_type, va.va_mode, |
971 | va.va_uid, va.va_gid, ap->a_mode, ap->a_cred)); | | 973 | va.va_uid, va.va_gid, ap->a_mode, ap->a_cred)); |
972 | } | | 974 | } |
973 | | | 975 | |
974 | /* | | 976 | /* |
975 | * lookup. this is incredibly complicated in the | | 977 | * lookup. this is incredibly complicated in the |
976 | * general case, however for most pseudo-filesystems | | 978 | * general case, however for most pseudo-filesystems |
977 | * very little needs to be done. | | 979 | * very little needs to be done. |
978 | * | | 980 | * |
979 | * Locking isn't hard here, just poorly documented. | | 981 | * Locking isn't hard here, just poorly documented. |
980 | * | | 982 | * |
981 | * If we're looking up ".", just vref the parent & return it. | | 983 | * If we're looking up ".", just vref the parent & return it. |
982 | * | | 984 | * |
983 | * If we're looking up "..", unlock the parent, and lock "..". If everything | | 985 | * If we're looking up "..", unlock the parent, and lock "..". If everything |
984 | * went ok, and we're on the last component and the caller requested the | | 986 | * went ok, and we're on the last component and the caller requested the |
985 | * parent locked, try to re-lock the parent. We do this to prevent lock | | 987 | * parent locked, try to re-lock the parent. We do this to prevent lock |
986 | * races. | | 988 | * races. |
987 | * | | 989 | * |
988 | * For anything else, get the needed node. Then unlock the parent if not | | 990 | * For anything else, get the needed node. Then unlock the parent if not |
989 | * the last component or not LOCKPARENT (i.e. if we wouldn't re-lock the | | 991 | * the last component or not LOCKPARENT (i.e. if we wouldn't re-lock the |
990 | * parent in the .. case). | | 992 | * parent in the .. case). |
991 | * | | 993 | * |
992 | * We try to exit with the parent locked in error cases. | | 994 | * We try to exit with the parent locked in error cases. |
993 | */ | | 995 | */ |
994 | int | | 996 | int |
995 | procfs_lookup(void *v) | | 997 | procfs_lookup(void *v) |
996 | { | | 998 | { |
997 | struct vop_lookup_v2_args /* { | | 999 | struct vop_lookup_v2_args /* { |
998 | struct vnode * a_dvp; | | 1000 | struct vnode * a_dvp; |
999 | struct vnode ** a_vpp; | | 1001 | struct vnode ** a_vpp; |
1000 | struct componentname * a_cnp; | | 1002 | struct componentname * a_cnp; |
1001 | } */ *ap = v; | | 1003 | } */ *ap = v; |
1002 | struct componentname *cnp = ap->a_cnp; | | 1004 | struct componentname *cnp = ap->a_cnp; |
1003 | struct vnode **vpp = ap->a_vpp; | | 1005 | struct vnode **vpp = ap->a_vpp; |
1004 | struct vnode *dvp = ap->a_dvp; | | 1006 | struct vnode *dvp = ap->a_dvp; |
1005 | const char *pname = cnp->cn_nameptr; | | 1007 | const char *pname = cnp->cn_nameptr; |
1006 | const struct proc_target *pt = NULL; | | 1008 | const struct proc_target *pt = NULL; |
1007 | struct vnode *fvp; | | 1009 | struct vnode *fvp; |
1008 | pid_t pid, vnpid; | | 1010 | pid_t pid, vnpid; |
1009 | struct pfsnode *pfs; | | 1011 | struct pfsnode *pfs; |
1010 | struct proc *p = NULL; | | 1012 | struct proc *p = NULL; |
1011 | struct lwp *plwp; | | 1013 | struct lwp *plwp; |
1012 | int i, error; | | 1014 | int i, error; |
1013 | pfstype type; | | 1015 | pfstype type; |
1014 | | | 1016 | |
1015 | *vpp = NULL; | | 1017 | *vpp = NULL; |
1016 | | | 1018 | |
1017 | if (cnp->cn_nameiop == DELETE || cnp->cn_nameiop == RENAME) | | 1019 | if (cnp->cn_nameiop == DELETE || cnp->cn_nameiop == RENAME) |
1018 | return (EROFS); | | 1020 | return (EROFS); |
1019 | | | 1021 | |
1020 | if (cnp->cn_namelen == 1 && *pname == '.') { | | 1022 | if (cnp->cn_namelen == 1 && *pname == '.') { |
1021 | *vpp = dvp; | | 1023 | *vpp = dvp; |
1022 | vref(dvp); | | 1024 | vref(dvp); |
1023 | return (0); | | 1025 | return (0); |
1024 | } | | 1026 | } |
1025 | | | 1027 | |
1026 | pfs = VTOPFS(dvp); | | 1028 | pfs = VTOPFS(dvp); |
1027 | switch (pfs->pfs_type) { | | 1029 | switch (pfs->pfs_type) { |
1028 | case PFSroot: | | 1030 | case PFSroot: |
1029 | /* | | 1031 | /* |
1030 | * Shouldn't get here with .. in the root node. | | 1032 | * Shouldn't get here with .. in the root node. |
1031 | */ | | 1033 | */ |
1032 | if (cnp->cn_flags & ISDOTDOT) | | 1034 | if (cnp->cn_flags & ISDOTDOT) |
1033 | return (EIO); | | 1035 | return (EIO); |
1034 | | | 1036 | |
1035 | for (i = 0; i < nproc_root_targets; i++) { | | 1037 | for (i = 0; i < nproc_root_targets; i++) { |
1036 | pt = &proc_root_targets[i]; | | 1038 | pt = &proc_root_targets[i]; |
1037 | /* | | 1039 | /* |
1038 | * check for node match. proc is always NULL here, | | 1040 | * check for node match. proc is always NULL here, |
1039 | * so call pt_valid with constant NULL lwp. | | 1041 | * so call pt_valid with constant NULL lwp. |
1040 | */ | | 1042 | */ |
1041 | if (cnp->cn_namelen == pt->pt_namlen && | | 1043 | if (cnp->cn_namelen == pt->pt_namlen && |
1042 | memcmp(pt->pt_name, pname, cnp->cn_namelen) == 0 && | | 1044 | memcmp(pt->pt_name, pname, cnp->cn_namelen) == 0 && |
1043 | (pt->pt_valid == NULL || | | 1045 | (pt->pt_valid == NULL || |
1044 | (*pt->pt_valid)(NULL, dvp->v_mount))) | | 1046 | (*pt->pt_valid)(NULL, dvp->v_mount))) |
1045 | break; | | 1047 | break; |
1046 | } | | 1048 | } |
1047 | | | 1049 | |
1048 | if (i != nproc_root_targets) { | | 1050 | if (i != nproc_root_targets) { |
1049 | error = procfs_allocvp(dvp->v_mount, vpp, 0, | | 1051 | error = procfs_allocvp(dvp->v_mount, vpp, 0, |
1050 | pt->pt_pfstype, -1); | | 1052 | pt->pt_pfstype, -1); |
1051 | return (error); | | 1053 | return (error); |
1052 | } | | 1054 | } |
1053 | | | 1055 | |
1054 | if (CNEQ(cnp, "curproc", 7)) { | | 1056 | if (CNEQ(cnp, "curproc", 7)) { |
1055 | pid = curproc->p_pid; | | 1057 | pid = curproc->p_pid; |
1056 | vnpid = 0; | | 1058 | vnpid = 0; |
1057 | type = PFScurproc; | | 1059 | type = PFScurproc; |
1058 | } else if (CNEQ(cnp, "self", 4)) { | | 1060 | } else if (CNEQ(cnp, "self", 4)) { |
1059 | pid = curproc->p_pid; | | 1061 | pid = curproc->p_pid; |
1060 | vnpid = 0; | | 1062 | vnpid = 0; |
1061 | type = PFSself; | | 1063 | type = PFSself; |
1062 | } else { | | 1064 | } else { |
1063 | pid = (pid_t)atoi(pname, cnp->cn_namelen); | | 1065 | pid = (pid_t)atoi(pname, cnp->cn_namelen); |
1064 | vnpid = pid; | | 1066 | vnpid = pid; |
1065 | type = PFSproc; | | 1067 | type = PFSproc; |
1066 | } | | 1068 | } |
1067 | | | 1069 | |
1068 | if (procfs_proc_lock(pid, &p, ESRCH) != 0) | | 1070 | if (procfs_proc_lock(pid, &p, ESRCH) != 0) |
1069 | break; | | 1071 | break; |
1070 | error = procfs_allocvp(dvp->v_mount, vpp, vnpid, type, -1); | | 1072 | error = procfs_allocvp(dvp->v_mount, vpp, vnpid, type, -1); |
1071 | procfs_proc_unlock(p); | | 1073 | procfs_proc_unlock(p); |
1072 | return (error); | | 1074 | return (error); |
1073 | | | 1075 | |
1074 | case PFSproc: | | 1076 | case PFSproc: |
1075 | if (cnp->cn_flags & ISDOTDOT) { | | 1077 | if (cnp->cn_flags & ISDOTDOT) { |
1076 | error = procfs_allocvp(dvp->v_mount, vpp, 0, PFSroot, | | 1078 | error = procfs_allocvp(dvp->v_mount, vpp, 0, PFSroot, |
1077 | -1); | | 1079 | -1); |
1078 | return (error); | | 1080 | return (error); |
1079 | } | | 1081 | } |
1080 | | | 1082 | |
1081 | if (procfs_proc_lock(pfs->pfs_pid, &p, ESRCH) != 0) | | 1083 | if (procfs_proc_lock(pfs->pfs_pid, &p, ESRCH) != 0) |
1082 | break; | | 1084 | break; |
1083 | | | 1085 | |
1084 | mutex_enter(p->p_lock); | | 1086 | mutex_enter(p->p_lock); |
1085 | LIST_FOREACH(plwp, &p->p_lwps, l_sibling) { | | 1087 | LIST_FOREACH(plwp, &p->p_lwps, l_sibling) { |
1086 | if (plwp->l_stat != LSZOMB) | | 1088 | if (plwp->l_stat != LSZOMB) |
1087 | break; | | 1089 | break; |
1088 | } | | 1090 | } |
1089 | /* Process is exiting if no-LWPS or all LWPs are LSZOMB */ | | 1091 | /* Process is exiting if no-LWPS or all LWPs are LSZOMB */ |
1090 | if (plwp == NULL) { | | 1092 | if (plwp == NULL) { |
1091 | mutex_exit(p->p_lock); | | 1093 | mutex_exit(p->p_lock); |
1092 | procfs_proc_unlock(p); | | 1094 | procfs_proc_unlock(p); |
1093 | return ESRCH; | | 1095 | return ESRCH; |
1094 | } | | 1096 | } |
1095 | | | 1097 | |
1096 | lwp_addref(plwp); | | 1098 | lwp_addref(plwp); |
1097 | mutex_exit(p->p_lock); | | 1099 | mutex_exit(p->p_lock); |
1098 | | | 1100 | |
1099 | for (pt = proc_targets, i = 0; i < nproc_targets; pt++, i++) { | | 1101 | for (pt = proc_targets, i = 0; i < nproc_targets; pt++, i++) { |
1100 | int found; | | 1102 | int found; |
1101 | | | 1103 | |
1102 | found = cnp->cn_namelen == pt->pt_namlen && | | 1104 | found = cnp->cn_namelen == pt->pt_namlen && |
1103 | memcmp(pt->pt_name, pname, cnp->cn_namelen) == 0 && | | 1105 | memcmp(pt->pt_name, pname, cnp->cn_namelen) == 0 && |
1104 | (pt->pt_valid == NULL | | 1106 | (pt->pt_valid == NULL |
1105 | || (*pt->pt_valid)(plwp, dvp->v_mount)); | | 1107 | || (*pt->pt_valid)(plwp, dvp->v_mount)); |
1106 | if (found) | | 1108 | if (found) |
1107 | break; | | 1109 | break; |
1108 | } | | 1110 | } |
1109 | lwp_delref(plwp); | | 1111 | lwp_delref(plwp); |
1110 | | | 1112 | |
1111 | if (i == nproc_targets) { | | 1113 | if (i == nproc_targets) { |
1112 | procfs_proc_unlock(p); | | 1114 | procfs_proc_unlock(p); |
1113 | break; | | 1115 | break; |
1114 | } | | 1116 | } |
1115 | if (pt->pt_pfstype == PFSfile) { | | 1117 | if (pt->pt_pfstype == PFSfile) { |
1116 | fvp = p->p_textvp; | | 1118 | fvp = p->p_textvp; |
1117 | /* We already checked that it exists. */ | | 1119 | /* We already checked that it exists. */ |
1118 | vref(fvp); | | 1120 | vref(fvp); |
1119 | procfs_proc_unlock(p); | | 1121 | procfs_proc_unlock(p); |
1120 | *vpp = fvp; | | 1122 | *vpp = fvp; |
1121 | return (0); | | 1123 | return (0); |
1122 | } | | 1124 | } |
1123 | | | 1125 | |
1124 | error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid, | | 1126 | error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid, |
1125 | pt->pt_pfstype, -1); | | 1127 | pt->pt_pfstype, -1); |
1126 | procfs_proc_unlock(p); | | 1128 | procfs_proc_unlock(p); |
1127 | return (error); | | 1129 | return (error); |
1128 | | | 1130 | |
1129 | case PFSfd: { | | 1131 | case PFSfd: { |
1130 | int fd; | | 1132 | int fd; |
1131 | file_t *fp; | | 1133 | file_t *fp; |
1132 | | | 1134 | |
1133 | if ((error = procfs_proc_lock(pfs->pfs_pid, &p, ENOENT)) != 0) | | 1135 | if ((error = procfs_proc_lock(pfs->pfs_pid, &p, ENOENT)) != 0) |
1134 | return error; | | 1136 | return error; |
1135 | | | 1137 | |
1136 | if (cnp->cn_flags & ISDOTDOT) { | | 1138 | if (cnp->cn_flags & ISDOTDOT) { |
1137 | error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid, | | 1139 | error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid, |
1138 | PFSproc, -1); | | 1140 | PFSproc, -1); |
1139 | procfs_proc_unlock(p); | | 1141 | procfs_proc_unlock(p); |
1140 | return (error); | | 1142 | return (error); |
1141 | } | | 1143 | } |
1142 | fd = atoi(pname, cnp->cn_namelen); | | 1144 | fd = atoi(pname, cnp->cn_namelen); |
1143 | | | 1145 | |
1144 | fp = fd_getfile2(p, fd); | | 1146 | fp = fd_getfile2(p, fd); |
1145 | if (fp == NULL) { | | 1147 | if (fp == NULL) { |
1146 | procfs_proc_unlock(p); | | 1148 | procfs_proc_unlock(p); |
1147 | return ENOENT; | | 1149 | return ENOENT; |
1148 | } | | 1150 | } |
1149 | fvp = fp->f_data; | | 1151 | fvp = fp->f_data; |
1150 | | | 1152 | |
1151 | /* Don't show directories */ | | 1153 | /* Don't show directories */ |
1152 | if (fp->f_type == DTYPE_VNODE && fvp->v_type != VDIR) { | | 1154 | if (fp->f_type == DTYPE_VNODE && fvp->v_type != VDIR) { |
1153 | vref(fvp); | | 1155 | vref(fvp); |
1154 | closef(fp); | | 1156 | closef(fp); |
1155 | procfs_proc_unlock(p); | | 1157 | procfs_proc_unlock(p); |
1156 | *vpp = fvp; | | 1158 | *vpp = fvp; |
1157 | return 0; | | 1159 | return 0; |
1158 | } | | 1160 | } |
1159 | | | 1161 | |
1160 | closef(fp); | | 1162 | closef(fp); |
1161 | error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid, | | 1163 | error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid, |
1162 | PFSfd, fd); | | 1164 | PFSfd, fd); |
1163 | procfs_proc_unlock(p); | | 1165 | procfs_proc_unlock(p); |
1164 | return error; | | 1166 | return error; |
1165 | } | | 1167 | } |
1166 | case PFStask: { | | 1168 | case PFStask: { |
1167 | int xpid; | | 1169 | int xpid; |
1168 | | | 1170 | |
1169 | if ((error = procfs_proc_lock(pfs->pfs_pid, &p, ENOENT)) != 0) | | 1171 | if ((error = procfs_proc_lock(pfs->pfs_pid, &p, ENOENT)) != 0) |
1170 | return error; | | 1172 | return error; |
1171 | | | 1173 | |
1172 | if (cnp->cn_flags & ISDOTDOT) { | | 1174 | if (cnp->cn_flags & ISDOTDOT) { |
1173 | error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid, | | 1175 | error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid, |
1174 | PFSproc, -1); | | 1176 | PFSproc, -1); |
1175 | procfs_proc_unlock(p); | | 1177 | procfs_proc_unlock(p); |
1176 | return (error); | | 1178 | return (error); |
1177 | } | | 1179 | } |
1178 | xpid = atoi(pname, cnp->cn_namelen); | | 1180 | xpid = atoi(pname, cnp->cn_namelen); |
1179 | | | 1181 | |
1180 | if (xpid != pfs->pfs_pid) { | | 1182 | if (xpid != pfs->pfs_pid) { |
1181 | procfs_proc_unlock(p); | | 1183 | procfs_proc_unlock(p); |
1182 | return ENOENT; | | 1184 | return ENOENT; |
1183 | } | | 1185 | } |
1184 | error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid, | | 1186 | error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid, |
1185 | PFStask, 0); | | 1187 | PFStask, 0); |
1186 | procfs_proc_unlock(p); | | 1188 | procfs_proc_unlock(p); |
1187 | return error; | | 1189 | return error; |
1188 | } | | 1190 | } |
1189 | default: | | 1191 | default: |
1190 | return (ENOTDIR); | | 1192 | return (ENOTDIR); |
1191 | } | | 1193 | } |
1192 | | | 1194 | |
1193 | return (cnp->cn_nameiop == LOOKUP ? ENOENT : EROFS); | | 1195 | return (cnp->cn_nameiop == LOOKUP ? ENOENT : EROFS); |
1194 | } | | 1196 | } |
1195 | | | 1197 | |
1196 | int | | 1198 | int |
1197 | procfs_validfile(struct lwp *l, struct mount *mp) | | 1199 | procfs_validfile(struct lwp *l, struct mount *mp) |
1198 | { | | 1200 | { |
1199 | return l != NULL && l->l_proc != NULL && l->l_proc->p_textvp != NULL; | | 1201 | return l != NULL && l->l_proc != NULL && l->l_proc->p_textvp != NULL; |
1200 | } | | 1202 | } |
1201 | | | 1203 | |
1202 | static int | | 1204 | static int |
1203 | procfs_validfile_linux(struct lwp *l, struct mount *mp) | | 1205 | procfs_validfile_linux(struct lwp *l, struct mount *mp) |
1204 | { | | 1206 | { |
1205 | int flags; | | 1207 | int flags; |
1206 | | | 1208 | |
1207 | flags = VFSTOPROC(mp)->pmnt_flags; | | 1209 | flags = VFSTOPROC(mp)->pmnt_flags; |
1208 | return (flags & PROCFSMNT_LINUXCOMPAT) && | | 1210 | return (flags & PROCFSMNT_LINUXCOMPAT) && |
1209 | (l == NULL || l->l_proc == NULL || procfs_validfile(l, mp)); | | 1211 | (l == NULL || l->l_proc == NULL || procfs_validfile(l, mp)); |
1210 | } | | 1212 | } |
1211 | | | 1213 | |
1212 | struct procfs_root_readdir_ctx { | | 1214 | struct procfs_root_readdir_ctx { |
1213 | struct uio *uiop; | | 1215 | struct uio *uiop; |
1214 | off_t *cookies; | | 1216 | off_t *cookies; |
1215 | int ncookies; | | 1217 | int ncookies; |
1216 | off_t off; | | 1218 | off_t off; |
1217 | off_t startoff; | | 1219 | off_t startoff; |
1218 | int error; | | 1220 | int error; |
1219 | }; | | 1221 | }; |
1220 | | | 1222 | |
1221 | static int | | 1223 | static int |
1222 | procfs_root_readdir_callback(struct proc *p, void *arg) | | 1224 | procfs_root_readdir_callback(struct proc *p, void *arg) |
1223 | { | | 1225 | { |
1224 | struct procfs_root_readdir_ctx *ctxp = arg; | | 1226 | struct procfs_root_readdir_ctx *ctxp = arg; |
1225 | struct dirent d; | | 1227 | struct dirent d; |
1226 | struct uio *uiop; | | 1228 | struct uio *uiop; |
1227 | int error; | | 1229 | int error; |
1228 | | | 1230 | |
1229 | uiop = ctxp->uiop; | | 1231 | uiop = ctxp->uiop; |
1230 | if (uiop->uio_resid < UIO_MX) | | 1232 | if (uiop->uio_resid < UIO_MX) |
1231 | return -1; /* no space */ | | 1233 | return -1; /* no space */ |
1232 | | | 1234 | |
1233 | if (ctxp->off < ctxp->startoff) { | | 1235 | if (ctxp->off < ctxp->startoff) { |
1234 | ctxp->off++; | | 1236 | ctxp->off++; |
1235 | return 0; | | 1237 | return 0; |
1236 | } | | 1238 | } |
1237 | | | 1239 | |
1238 | if (kauth_authorize_process(kauth_cred_get(), | | 1240 | if (kauth_authorize_process(kauth_cred_get(), |
1239 | KAUTH_PROCESS_CANSEE, p, | | 1241 | KAUTH_PROCESS_CANSEE, p, |
1240 | KAUTH_ARG(KAUTH_REQ_PROCESS_CANSEE_ENTRY), NULL, NULL) != 0) | | 1242 | KAUTH_ARG(KAUTH_REQ_PROCESS_CANSEE_ENTRY), NULL, NULL) != 0) |
1241 | return 0; | | 1243 | return 0; |
1242 | | | 1244 | |
1243 | memset(&d, 0, UIO_MX); | | 1245 | memset(&d, 0, UIO_MX); |
1244 | d.d_reclen = UIO_MX; | | 1246 | d.d_reclen = UIO_MX; |
1245 | d.d_fileno = PROCFS_FILENO(p->p_pid, PFSproc, -1); | | 1247 | d.d_fileno = PROCFS_FILENO(p->p_pid, PFSproc, -1); |
1246 | d.d_namlen = snprintf(d.d_name, | | 1248 | d.d_namlen = snprintf(d.d_name, |
1247 | UIO_MX - offsetof(struct dirent, d_name), "%ld", (long)p->p_pid); | | 1249 | UIO_MX - offsetof(struct dirent, d_name), "%ld", (long)p->p_pid); |
1248 | d.d_type = DT_DIR; | | 1250 | d.d_type = DT_DIR; |
1249 | | | 1251 | |
1250 | mutex_exit(proc_lock); | | 1252 | mutex_exit(proc_lock); |
1251 | error = uiomove(&d, UIO_MX, uiop); | | 1253 | error = uiomove(&d, UIO_MX, uiop); |
1252 | mutex_enter(proc_lock); | | 1254 | mutex_enter(proc_lock); |
1253 | if (error) { | | 1255 | if (error) { |
1254 | ctxp->error = error; | | 1256 | ctxp->error = error; |
1255 | return -1; | | 1257 | return -1; |
1256 | } | | 1258 | } |
1257 | | | 1259 | |
1258 | ctxp->ncookies++; | | 1260 | ctxp->ncookies++; |
1259 | if (ctxp->cookies) | | 1261 | if (ctxp->cookies) |
1260 | *(ctxp->cookies)++ = ctxp->off + 1; | | 1262 | *(ctxp->cookies)++ = ctxp->off + 1; |
1261 | ctxp->off++; | | 1263 | ctxp->off++; |
1262 | | | 1264 | |
1263 | return 0; | | 1265 | return 0; |
1264 | } | | 1266 | } |
1265 | | | 1267 | |
1266 | /* | | 1268 | /* |
1267 | * readdir returns directory entries from pfsnode (vp). | | 1269 | * readdir returns directory entries from pfsnode (vp). |
1268 | * | | 1270 | * |
1269 | * the strategy here with procfs is to generate a single | | 1271 | * the strategy here with procfs is to generate a single |
1270 | * directory entry at a time (struct dirent) and then | | 1272 | * directory entry at a time (struct dirent) and then |
1271 | * copy that out to userland using uiomove. a more efficent | | 1273 | * copy that out to userland using uiomove. a more efficent |
1272 | * though more complex implementation, would try to minimize | | 1274 | * though more complex implementation, would try to minimize |
1273 | * the number of calls to uiomove(). for procfs, this is | | 1275 | * the number of calls to uiomove(). for procfs, this is |
1274 | * hardly worth the added code complexity. | | 1276 | * hardly worth the added code complexity. |
1275 | * | | 1277 | * |
1276 | * this should just be done through read() | | 1278 | * this should just be done through read() |
1277 | */ | | 1279 | */ |
1278 | int | | 1280 | int |
1279 | procfs_readdir(void *v) | | 1281 | procfs_readdir(void *v) |
1280 | { | | 1282 | { |
1281 | struct vop_readdir_args /* { | | 1283 | struct vop_readdir_args /* { |
1282 | struct vnode *a_vp; | | 1284 | struct vnode *a_vp; |
1283 | struct uio *a_uio; | | 1285 | struct uio *a_uio; |
1284 | kauth_cred_t a_cred; | | 1286 | kauth_cred_t a_cred; |
1285 | int *a_eofflag; | | 1287 | int *a_eofflag; |
1286 | off_t **a_cookies; | | 1288 | off_t **a_cookies; |
1287 | int *a_ncookies; | | 1289 | int *a_ncookies; |
1288 | } */ *ap = v; | | 1290 | } */ *ap = v; |
1289 | struct uio *uio = ap->a_uio; | | 1291 | struct uio *uio = ap->a_uio; |
1290 | struct dirent d; | | 1292 | struct dirent d; |
1291 | struct pfsnode *pfs; | | 1293 | struct pfsnode *pfs; |
1292 | off_t i; | | 1294 | off_t i; |
1293 | int error; | | 1295 | int error; |
1294 | off_t *cookies = NULL; | | 1296 | off_t *cookies = NULL; |
1295 | int ncookies; | | 1297 | int ncookies; |
1296 | struct vnode *vp; | | 1298 | struct vnode *vp; |
1297 | const struct proc_target *pt; | | 1299 | const struct proc_target *pt; |
1298 | struct procfs_root_readdir_ctx ctx; | | 1300 | struct procfs_root_readdir_ctx ctx; |
1299 | struct lwp *l; | | 1301 | struct lwp *l; |
1300 | int nfd; | | 1302 | int nfd; |
1301 | | | 1303 | |
1302 | vp = ap->a_vp; | | 1304 | vp = ap->a_vp; |
1303 | pfs = VTOPFS(vp); | | 1305 | pfs = VTOPFS(vp); |
1304 | | | 1306 | |
1305 | if (uio->uio_resid < UIO_MX) | | 1307 | if (uio->uio_resid < UIO_MX) |
1306 | return (EINVAL); | | 1308 | return (EINVAL); |
1307 | if (uio->uio_offset < 0) | | 1309 | if (uio->uio_offset < 0) |
1308 | return (EINVAL); | | 1310 | return (EINVAL); |
1309 | | | 1311 | |
1310 | error = 0; | | 1312 | error = 0; |
1311 | i = uio->uio_offset; | | 1313 | i = uio->uio_offset; |
1312 | memset(&d, 0, UIO_MX); | | 1314 | memset(&d, 0, UIO_MX); |
1313 | d.d_reclen = UIO_MX; | | 1315 | d.d_reclen = UIO_MX; |
1314 | ncookies = uio->uio_resid / UIO_MX; | | 1316 | ncookies = uio->uio_resid / UIO_MX; |
1315 | | | 1317 | |
1316 | switch (pfs->pfs_type) { | | 1318 | switch (pfs->pfs_type) { |
1317 | /* | | 1319 | /* |
1318 | * this is for the process-specific sub-directories. | | 1320 | * this is for the process-specific sub-directories. |
1319 | * all that is needed to is copy out all the entries | | 1321 | * all that is needed to is copy out all the entries |
1320 | * from the procent[] table (top of this file). | | 1322 | * from the procent[] table (top of this file). |
1321 | */ | | 1323 | */ |
1322 | case PFSproc: { | | 1324 | case PFSproc: { |
1323 | struct proc *p; | | 1325 | struct proc *p; |
1324 | | | 1326 | |
1325 | if (i >= nproc_targets) | | 1327 | if (i >= nproc_targets) |
1326 | return 0; | | 1328 | return 0; |
1327 | | | 1329 | |
1328 | if (procfs_proc_lock(pfs->pfs_pid, &p, ESRCH) != 0) | | 1330 | if (procfs_proc_lock(pfs->pfs_pid, &p, ESRCH) != 0) |
1329 | break; | | 1331 | break; |
1330 | | | 1332 | |
1331 | if (ap->a_ncookies) { | | 1333 | if (ap->a_ncookies) { |
1332 | ncookies = min(ncookies, (nproc_targets - i)); | | 1334 | ncookies = min(ncookies, (nproc_targets - i)); |
1333 | cookies = malloc(ncookies * sizeof (off_t), | | 1335 | cookies = malloc(ncookies * sizeof (off_t), |
1334 | M_TEMP, M_WAITOK); | | 1336 | M_TEMP, M_WAITOK); |
1335 | *ap->a_cookies = cookies; | | 1337 | *ap->a_cookies = cookies; |
1336 | } | | 1338 | } |
1337 | | | 1339 | |
1338 | for (pt = &proc_targets[i]; | | 1340 | for (pt = &proc_targets[i]; |
1339 | uio->uio_resid >= UIO_MX && i < nproc_targets; pt++, i++) { | | 1341 | uio->uio_resid >= UIO_MX && i < nproc_targets; pt++, i++) { |
1340 | if (pt->pt_valid) { | | 1342 | if (pt->pt_valid) { |
1341 | /* XXXSMP LWP can disappear */ | | 1343 | /* XXXSMP LWP can disappear */ |
1342 | mutex_enter(p->p_lock); | | 1344 | mutex_enter(p->p_lock); |
1343 | l = LIST_FIRST(&p->p_lwps); | | 1345 | l = LIST_FIRST(&p->p_lwps); |
1344 | KASSERT(l != NULL); | | 1346 | KASSERT(l != NULL); |
1345 | mutex_exit(p->p_lock); | | 1347 | mutex_exit(p->p_lock); |
1346 | if ((*pt->pt_valid)(l, vp->v_mount) == 0) | | 1348 | if ((*pt->pt_valid)(l, vp->v_mount) == 0) |
1347 | continue; | | 1349 | continue; |
1348 | } | | 1350 | } |
1349 | | | 1351 | |
1350 | d.d_fileno = PROCFS_FILENO(pfs->pfs_pid, | | 1352 | d.d_fileno = PROCFS_FILENO(pfs->pfs_pid, |
1351 | pt->pt_pfstype, -1); | | 1353 | pt->pt_pfstype, -1); |
1352 | d.d_namlen = pt->pt_namlen; | | 1354 | d.d_namlen = pt->pt_namlen; |
1353 | memcpy(d.d_name, pt->pt_name, pt->pt_namlen + 1); | | 1355 | memcpy(d.d_name, pt->pt_name, pt->pt_namlen + 1); |
1354 | d.d_type = pt->pt_type; | | 1356 | d.d_type = pt->pt_type; |
1355 | | | 1357 | |
1356 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) | | 1358 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) |
1357 | break; | | 1359 | break; |
1358 | if (cookies) | | 1360 | if (cookies) |
1359 | *cookies++ = i + 1; | | 1361 | *cookies++ = i + 1; |
1360 | } | | 1362 | } |
1361 | | | 1363 | |
1362 | procfs_proc_unlock(p); | | 1364 | procfs_proc_unlock(p); |
1363 | break; | | 1365 | break; |
1364 | } | | 1366 | } |
1365 | case PFSfd: { | | 1367 | case PFSfd: { |
1366 | struct proc *p; | | 1368 | struct proc *p; |
1367 | file_t *fp; | | 1369 | file_t *fp; |
1368 | int lim, nc = 0; | | 1370 | int lim, nc = 0; |
1369 | | | 1371 | |
1370 | if ((error = procfs_proc_lock(pfs->pfs_pid, &p, ESRCH)) != 0) | | 1372 | if ((error = procfs_proc_lock(pfs->pfs_pid, &p, ESRCH)) != 0) |
1371 | return error; | | 1373 | return error; |
1372 | | | 1374 | |
1373 | /* XXX Should this be by file as well? */ | | 1375 | /* XXX Should this be by file as well? */ |
1374 | if (kauth_authorize_process(kauth_cred_get(), | | 1376 | if (kauth_authorize_process(kauth_cred_get(), |
1375 | KAUTH_PROCESS_CANSEE, p, | | 1377 | KAUTH_PROCESS_CANSEE, p, |
1376 | KAUTH_ARG(KAUTH_REQ_PROCESS_CANSEE_OPENFILES), NULL, | | 1378 | KAUTH_ARG(KAUTH_REQ_PROCESS_CANSEE_OPENFILES), NULL, |
1377 | NULL) != 0) { | | 1379 | NULL) != 0) { |
1378 | procfs_proc_unlock(p); | | 1380 | procfs_proc_unlock(p); |
1379 | return ESRCH; | | 1381 | return ESRCH; |
1380 | } | | 1382 | } |
1381 | | | 1383 | |
1382 | nfd = p->p_fd->fd_dt->dt_nfiles; | | 1384 | nfd = p->p_fd->fd_dt->dt_nfiles; |
1383 | | | 1385 | |
1384 | lim = min((int)p->p_rlimit[RLIMIT_NOFILE].rlim_cur, maxfiles); | | 1386 | lim = min((int)p->p_rlimit[RLIMIT_NOFILE].rlim_cur, maxfiles); |
1385 | if (i >= lim) { | | 1387 | if (i >= lim) { |
1386 | procfs_proc_unlock(p); | | 1388 | procfs_proc_unlock(p); |
1387 | return 0; | | 1389 | return 0; |
1388 | } | | 1390 | } |
1389 | | | 1391 | |
1390 | if (ap->a_ncookies) { | | 1392 | if (ap->a_ncookies) { |
1391 | ncookies = min(ncookies, (nfd + 2 - i)); | | 1393 | ncookies = min(ncookies, (nfd + 2 - i)); |
1392 | cookies = malloc(ncookies * sizeof (off_t), | | 1394 | cookies = malloc(ncookies * sizeof (off_t), |
1393 | M_TEMP, M_WAITOK); | | 1395 | M_TEMP, M_WAITOK); |
1394 | *ap->a_cookies = cookies; | | 1396 | *ap->a_cookies = cookies; |
1395 | } | | 1397 | } |
1396 | | | 1398 | |
1397 | for (; i < 2 && uio->uio_resid >= UIO_MX; i++) { | | 1399 | for (; i < 2 && uio->uio_resid >= UIO_MX; i++) { |
1398 | pt = &proc_targets[i]; | | 1400 | pt = &proc_targets[i]; |
1399 | d.d_namlen = pt->pt_namlen; | | 1401 | d.d_namlen = pt->pt_namlen; |
1400 | d.d_fileno = PROCFS_FILENO(pfs->pfs_pid, | | 1402 | d.d_fileno = PROCFS_FILENO(pfs->pfs_pid, |
1401 | pt->pt_pfstype, -1); | | 1403 | pt->pt_pfstype, -1); |
1402 | (void)memcpy(d.d_name, pt->pt_name, pt->pt_namlen + 1); | | 1404 | (void)memcpy(d.d_name, pt->pt_name, pt->pt_namlen + 1); |
1403 | d.d_type = pt->pt_type; | | 1405 | d.d_type = pt->pt_type; |
1404 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) | | 1406 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) |
1405 | break; | | 1407 | break; |
1406 | if (cookies) | | 1408 | if (cookies) |
1407 | *cookies++ = i + 1; | | 1409 | *cookies++ = i + 1; |
1408 | nc++; | | 1410 | nc++; |
1409 | } | | 1411 | } |
1410 | if (error) { | | 1412 | if (error) { |
1411 | ncookies = nc; | | 1413 | ncookies = nc; |
1412 | break; | | 1414 | break; |
1413 | } | | 1415 | } |
1414 | for (; uio->uio_resid >= UIO_MX && i < nfd; i++) { | | 1416 | for (; uio->uio_resid >= UIO_MX && i < nfd; i++) { |
1415 | /* check the descriptor exists */ | | 1417 | /* check the descriptor exists */ |
1416 | if ((fp = fd_getfile2(p, i - 2)) == NULL) | | 1418 | if ((fp = fd_getfile2(p, i - 2)) == NULL) |
1417 | continue; | | 1419 | continue; |
1418 | closef(fp); | | 1420 | closef(fp); |
1419 | | | 1421 | |
1420 | d.d_fileno = PROCFS_FILENO(pfs->pfs_pid, PFSfd, i - 2); | | 1422 | d.d_fileno = PROCFS_FILENO(pfs->pfs_pid, PFSfd, i - 2); |
1421 | d.d_namlen = snprintf(d.d_name, sizeof(d.d_name), | | 1423 | d.d_namlen = snprintf(d.d_name, sizeof(d.d_name), |
1422 | "%lld", (long long)(i - 2)); | | 1424 | "%lld", (long long)(i - 2)); |
1423 | d.d_type = VREG; | | 1425 | d.d_type = VREG; |
1424 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) | | 1426 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) |
1425 | break; | | 1427 | break; |
1426 | if (cookies) | | 1428 | if (cookies) |
1427 | *cookies++ = i + 1; | | 1429 | *cookies++ = i + 1; |
1428 | nc++; | | 1430 | nc++; |
1429 | } | | 1431 | } |
1430 | ncookies = nc; | | 1432 | ncookies = nc; |
1431 | procfs_proc_unlock(p); | | 1433 | procfs_proc_unlock(p); |
1432 | break; | | 1434 | break; |
1433 | } | | 1435 | } |
1434 | case PFStask: { | | 1436 | case PFStask: { |
1435 | struct proc *p; | | 1437 | struct proc *p; |
1436 | int nc = 0; | | 1438 | int nc = 0; |
1437 | | | 1439 | |
1438 | if ((error = procfs_proc_lock(pfs->pfs_pid, &p, ESRCH)) != 0) | | 1440 | if ((error = procfs_proc_lock(pfs->pfs_pid, &p, ESRCH)) != 0) |
1439 | return error; | | 1441 | return error; |
1440 | | | 1442 | |
1441 | nfd = 3; /* ., .., pid */ | | 1443 | nfd = 3; /* ., .., pid */ |
1442 | | | 1444 | |
1443 | if (ap->a_ncookies) { | | 1445 | if (ap->a_ncookies) { |
1444 | ncookies = min(ncookies, (nfd + 2 - i)); | | 1446 | ncookies = min(ncookies, (nfd + 2 - i)); |
1445 | cookies = malloc(ncookies * sizeof (off_t), | | 1447 | cookies = malloc(ncookies * sizeof (off_t), |
1446 | M_TEMP, M_WAITOK); | | 1448 | M_TEMP, M_WAITOK); |
1447 | *ap->a_cookies = cookies; | | 1449 | *ap->a_cookies = cookies; |
1448 | } | | 1450 | } |
1449 | | | 1451 | |
1450 | for (; i < 2 && uio->uio_resid >= UIO_MX; i++) { | | 1452 | for (; i < 2 && uio->uio_resid >= UIO_MX; i++) { |
1451 | pt = &proc_targets[i]; | | 1453 | pt = &proc_targets[i]; |
1452 | d.d_namlen = pt->pt_namlen; | | 1454 | d.d_namlen = pt->pt_namlen; |
1453 | d.d_fileno = PROCFS_FILENO(pfs->pfs_pid, | | 1455 | d.d_fileno = PROCFS_FILENO(pfs->pfs_pid, |
1454 | pt->pt_pfstype, -1); | | 1456 | pt->pt_pfstype, -1); |
1455 | (void)memcpy(d.d_name, pt->pt_name, pt->pt_namlen + 1); | | 1457 | (void)memcpy(d.d_name, pt->pt_name, pt->pt_namlen + 1); |
1456 | d.d_type = pt->pt_type; | | 1458 | d.d_type = pt->pt_type; |
1457 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) | | 1459 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) |
1458 | break; | | 1460 | break; |
1459 | if (cookies) | | 1461 | if (cookies) |
1460 | *cookies++ = i + 1; | | 1462 | *cookies++ = i + 1; |
1461 | nc++; | | 1463 | nc++; |
1462 | } | | 1464 | } |
1463 | if (error) { | | 1465 | if (error) { |
1464 | ncookies = nc; | | 1466 | ncookies = nc; |
1465 | break; | | 1467 | break; |
1466 | } | | 1468 | } |
1467 | for (; uio->uio_resid >= UIO_MX && i < nfd; i++) { | | 1469 | for (; uio->uio_resid >= UIO_MX && i < nfd; i++) { |
1468 | /* check the descriptor exists */ | | 1470 | /* check the descriptor exists */ |
1469 | d.d_fileno = PROCFS_FILENO(pfs->pfs_pid, PFStask, | | 1471 | d.d_fileno = PROCFS_FILENO(pfs->pfs_pid, PFStask, |
1470 | i - 2); | | 1472 | i - 2); |
1471 | d.d_namlen = snprintf(d.d_name, sizeof(d.d_name), | | 1473 | d.d_namlen = snprintf(d.d_name, sizeof(d.d_name), |
1472 | "%ld", (long)pfs->pfs_pid); | | 1474 | "%ld", (long)pfs->pfs_pid); |
1473 | d.d_type = DT_LNK; | | 1475 | d.d_type = DT_LNK; |
1474 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) | | 1476 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) |
1475 | break; | | 1477 | break; |
1476 | if (cookies) | | 1478 | if (cookies) |
1477 | *cookies++ = i + 1; | | 1479 | *cookies++ = i + 1; |
1478 | nc++; | | 1480 | nc++; |
1479 | } | | 1481 | } |
1480 | ncookies = nc; | | 1482 | ncookies = nc; |
1481 | procfs_proc_unlock(p); | | 1483 | procfs_proc_unlock(p); |
1482 | break; | | 1484 | break; |
1483 | } | | 1485 | } |
1484 | | | 1486 | |
1485 | /* | | 1487 | /* |
1486 | * this is for the root of the procfs filesystem | | 1488 | * this is for the root of the procfs filesystem |
1487 | * what is needed are special entries for "curproc" | | 1489 | * what is needed are special entries for "curproc" |
1488 | * and "self" followed by an entry for each process | | 1490 | * and "self" followed by an entry for each process |
1489 | * on allproc. | | 1491 | * on allproc. |
1490 | */ | | 1492 | */ |
1491 | | | 1493 | |
1492 | case PFSroot: { | | 1494 | case PFSroot: { |
1493 | int nc = 0; | | 1495 | int nc = 0; |
1494 | | | 1496 | |
1495 | if (ap->a_ncookies) { | | 1497 | if (ap->a_ncookies) { |
1496 | /* | | 1498 | /* |
1497 | * XXX Potentially allocating too much space here, | | 1499 | * XXX Potentially allocating too much space here, |
1498 | * but I'm lazy. This loop needs some work. | | 1500 | * but I'm lazy. This loop needs some work. |
1499 | */ | | 1501 | */ |
1500 | cookies = malloc(ncookies * sizeof (off_t), | | 1502 | cookies = malloc(ncookies * sizeof (off_t), |
1501 | M_TEMP, M_WAITOK); | | 1503 | M_TEMP, M_WAITOK); |
1502 | *ap->a_cookies = cookies; | | 1504 | *ap->a_cookies = cookies; |
1503 | } | | 1505 | } |
1504 | error = 0; | | 1506 | error = 0; |
1505 | /* 0 ... 3 are static entries. */ | | 1507 | /* 0 ... 3 are static entries. */ |
1506 | for (; i <= 3 && uio->uio_resid >= UIO_MX; i++) { | | 1508 | for (; i <= 3 && uio->uio_resid >= UIO_MX; i++) { |
1507 | switch (i) { | | 1509 | switch (i) { |
1508 | case 0: /* `.' */ | | 1510 | case 0: /* `.' */ |
1509 | case 1: /* `..' */ | | 1511 | case 1: /* `..' */ |
1510 | d.d_fileno = PROCFS_FILENO(0, PFSroot, -1); | | 1512 | d.d_fileno = PROCFS_FILENO(0, PFSroot, -1); |
1511 | d.d_namlen = i + 1; | | 1513 | d.d_namlen = i + 1; |
1512 | memcpy(d.d_name, "..", d.d_namlen); | | 1514 | memcpy(d.d_name, "..", d.d_namlen); |
1513 | d.d_name[i + 1] = '\0'; | | 1515 | d.d_name[i + 1] = '\0'; |
1514 | d.d_type = DT_DIR; | | 1516 | d.d_type = DT_DIR; |
1515 | break; | | 1517 | break; |
1516 | | | 1518 | |
1517 | case 2: | | 1519 | case 2: |
1518 | d.d_fileno = PROCFS_FILENO(0, PFScurproc, -1); | | 1520 | d.d_fileno = PROCFS_FILENO(0, PFScurproc, -1); |
1519 | d.d_namlen = sizeof("curproc") - 1; | | 1521 | d.d_namlen = sizeof("curproc") - 1; |
1520 | memcpy(d.d_name, "curproc", sizeof("curproc")); | | 1522 | memcpy(d.d_name, "curproc", sizeof("curproc")); |
1521 | d.d_type = DT_LNK; | | 1523 | d.d_type = DT_LNK; |
1522 | break; | | 1524 | break; |
1523 | | | 1525 | |
1524 | case 3: | | 1526 | case 3: |
1525 | d.d_fileno = PROCFS_FILENO(0, PFSself, -1); | | 1527 | d.d_fileno = PROCFS_FILENO(0, PFSself, -1); |
1526 | d.d_namlen = sizeof("self") - 1; | | 1528 | d.d_namlen = sizeof("self") - 1; |
1527 | memcpy(d.d_name, "self", sizeof("self")); | | 1529 | memcpy(d.d_name, "self", sizeof("self")); |
1528 | d.d_type = DT_LNK; | | 1530 | d.d_type = DT_LNK; |
1529 | break; | | 1531 | break; |
1530 | } | | 1532 | } |
1531 | | | 1533 | |
1532 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) | | 1534 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) |
1533 | break; | | 1535 | break; |
1534 | nc++; | | 1536 | nc++; |
1535 | if (cookies) | | 1537 | if (cookies) |
1536 | *cookies++ = i + 1; | | 1538 | *cookies++ = i + 1; |
1537 | } | | 1539 | } |
1538 | /* 4 ... are process entries. */ | | 1540 | /* 4 ... are process entries. */ |
1539 | ctx.uiop = uio; | | 1541 | ctx.uiop = uio; |
1540 | ctx.error = 0; | | 1542 | ctx.error = 0; |
1541 | ctx.off = 4; | | 1543 | ctx.off = 4; |
1542 | ctx.startoff = i; | | 1544 | ctx.startoff = i; |
1543 | ctx.cookies = cookies; | | 1545 | ctx.cookies = cookies; |
1544 | ctx.ncookies = nc; | | 1546 | ctx.ncookies = nc; |
1545 | proclist_foreach_call(&allproc, | | 1547 | proclist_foreach_call(&allproc, |
1546 | procfs_root_readdir_callback, &ctx); | | 1548 | procfs_root_readdir_callback, &ctx); |
1547 | cookies = ctx.cookies; | | 1549 | cookies = ctx.cookies; |
1548 | nc = ctx.ncookies; | | 1550 | nc = ctx.ncookies; |
1549 | error = ctx.error; | | 1551 | error = ctx.error; |
1550 | if (error) | | 1552 | if (error) |
1551 | break; | | 1553 | break; |
1552 | | | 1554 | |
1553 | /* misc entries. */ | | 1555 | /* misc entries. */ |
1554 | if (i < ctx.off) | | 1556 | if (i < ctx.off) |
1555 | i = ctx.off; | | 1557 | i = ctx.off; |
1556 | if (i >= ctx.off + nproc_root_targets) | | 1558 | if (i >= ctx.off + nproc_root_targets) |
1557 | break; | | 1559 | break; |
1558 | for (pt = &proc_root_targets[i - ctx.off]; | | 1560 | for (pt = &proc_root_targets[i - ctx.off]; |
1559 | uio->uio_resid >= UIO_MX && | | 1561 | uio->uio_resid >= UIO_MX && |
1560 | pt < &proc_root_targets[nproc_root_targets]; | | 1562 | pt < &proc_root_targets[nproc_root_targets]; |
1561 | pt++, i++) { | | 1563 | pt++, i++) { |
1562 | if (pt->pt_valid && | | 1564 | if (pt->pt_valid && |
1563 | (*pt->pt_valid)(NULL, vp->v_mount) == 0) | | 1565 | (*pt->pt_valid)(NULL, vp->v_mount) == 0) |
1564 | continue; | | 1566 | continue; |
1565 | d.d_fileno = PROCFS_FILENO(0, pt->pt_pfstype, -1); | | 1567 | d.d_fileno = PROCFS_FILENO(0, pt->pt_pfstype, -1); |
1566 | d.d_namlen = pt->pt_namlen; | | 1568 | d.d_namlen = pt->pt_namlen; |
1567 | memcpy(d.d_name, pt->pt_name, pt->pt_namlen + 1); | | 1569 | memcpy(d.d_name, pt->pt_name, pt->pt_namlen + 1); |
1568 | d.d_type = pt->pt_type; | | 1570 | d.d_type = pt->pt_type; |
1569 | | | 1571 | |
1570 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) | | 1572 | if ((error = uiomove(&d, UIO_MX, uio)) != 0) |
1571 | break; | | 1573 | break; |
1572 | nc++; | | 1574 | nc++; |
1573 | if (cookies) | | 1575 | if (cookies) |
1574 | *cookies++ = i + 1; | | 1576 | *cookies++ = i + 1; |
1575 | } | | 1577 | } |
1576 | | | 1578 | |
1577 | ncookies = nc; | | 1579 | ncookies = nc; |
1578 | break; | | 1580 | break; |
1579 | } | | 1581 | } |
1580 | | | 1582 | |
1581 | default: | | 1583 | default: |
1582 | error = ENOTDIR; | | 1584 | error = ENOTDIR; |
1583 | break; | | 1585 | break; |
1584 | } | | 1586 | } |
1585 | | | 1587 | |
1586 | if (ap->a_ncookies) { | | 1588 | if (ap->a_ncookies) { |
1587 | if (error) { | | 1589 | if (error) { |
1588 | if (cookies) | | 1590 | if (cookies) |
1589 | free(*ap->a_cookies, M_TEMP); | | 1591 | free(*ap->a_cookies, M_TEMP); |
1590 | *ap->a_ncookies = 0; | | 1592 | *ap->a_ncookies = 0; |
1591 | *ap->a_cookies = NULL; | | 1593 | *ap->a_cookies = NULL; |
1592 | } else | | 1594 | } else |
1593 | *ap->a_ncookies = ncookies; | | 1595 | *ap->a_ncookies = ncookies; |
1594 | } | | 1596 | } |
1595 | uio->uio_offset = i; | | 1597 | uio->uio_offset = i; |
1596 | return (error); | | 1598 | return (error); |
1597 | } | | 1599 | } |
1598 | | | 1600 | |
1599 | /* | | 1601 | /* |
1600 | * readlink reads the link of `curproc' and others | | 1602 | * readlink reads the link of `curproc' and others |
1601 | */ | | 1603 | */ |
1602 | int | | 1604 | int |
1603 | procfs_readlink(void *v) | | 1605 | procfs_readlink(void *v) |
1604 | { | | 1606 | { |
1605 | struct vop_readlink_args *ap = v; | | 1607 | struct vop_readlink_args *ap = v; |
1606 | char bf[16]; /* should be enough */ | | 1608 | char bf[16]; /* should be enough */ |
1607 | char *bp = bf; | | 1609 | char *bp = bf; |
1608 | char *path = NULL; | | 1610 | char *path = NULL; |
1609 | int len = 0; | | 1611 | int len = 0; |
1610 | int error = 0; | | 1612 | int error = 0; |
1611 | struct pfsnode *pfs = VTOPFS(ap->a_vp); | | 1613 | struct pfsnode *pfs = VTOPFS(ap->a_vp); |
1612 | struct proc *pown; | | 1614 | struct proc *pown; |
1613 | | | 1615 | |
1614 | if (pfs->pfs_fileno == PROCFS_FILENO(0, PFScurproc, -1)) | | 1616 | if (pfs->pfs_fileno == PROCFS_FILENO(0, PFScurproc, -1)) |
1615 | len = snprintf(bf, sizeof(bf), "%ld", (long)curproc->p_pid); | | 1617 | len = snprintf(bf, sizeof(bf), "%ld", (long)curproc->p_pid); |
1616 | else if (pfs->pfs_fileno == PROCFS_FILENO(0, PFSself, -1)) | | 1618 | else if (pfs->pfs_fileno == PROCFS_FILENO(0, PFSself, -1)) |
1617 | len = snprintf(bf, sizeof(bf), "%s", "curproc"); | | 1619 | len = snprintf(bf, sizeof(bf), "%s", "curproc"); |
1618 | else if (pfs->pfs_fileno == PROCFS_FILENO(pfs->pfs_pid, PFStask, 0)) | | 1620 | else if (pfs->pfs_fileno == PROCFS_FILENO(pfs->pfs_pid, PFStask, 0)) |
1619 | len = snprintf(bf, sizeof(bf), ".."); | | 1621 | len = snprintf(bf, sizeof(bf), ".."); |
1620 | else if (pfs->pfs_fileno == PROCFS_FILENO(pfs->pfs_pid, PFScwd, -1) || | | 1622 | else if (pfs->pfs_fileno == PROCFS_FILENO(pfs->pfs_pid, PFScwd, -1) || |
1621 | pfs->pfs_fileno == PROCFS_FILENO(pfs->pfs_pid, PFSchroot, -1) || | | 1623 | pfs->pfs_fileno == PROCFS_FILENO(pfs->pfs_pid, PFSchroot, -1) || |
1622 | pfs->pfs_fileno == PROCFS_FILENO(pfs->pfs_pid, PFSexe, -1)) { | | 1624 | pfs->pfs_fileno == PROCFS_FILENO(pfs->pfs_pid, PFSexe, -1)) { |
1623 | if ((error = procfs_proc_lock(pfs->pfs_pid, &pown, ESRCH)) != 0) | | 1625 | if ((error = procfs_proc_lock(pfs->pfs_pid, &pown, ESRCH)) != 0) |
1624 | return error; | | 1626 | return error; |
1625 | path = malloc(MAXPATHLEN + 4, M_TEMP, M_WAITOK|M_CANFAIL); | | 1627 | path = malloc(MAXPATHLEN + 4, M_TEMP, M_WAITOK|M_CANFAIL); |
1626 | if (path == NULL) { | | 1628 | if (path == NULL) { |
1627 | procfs_proc_unlock(pown); | | 1629 | procfs_proc_unlock(pown); |
1628 | return (ENOMEM); | | 1630 | return (ENOMEM); |
1629 | } | | 1631 | } |
1630 | bp = path + MAXPATHLEN; | | 1632 | bp = path + MAXPATHLEN; |
1631 | *--bp = '\0'; | | 1633 | *--bp = '\0'; |
1632 | procfs_dir(PROCFS_TYPE(pfs->pfs_fileno), curlwp, pown, | | 1634 | procfs_dir(PROCFS_TYPE(pfs->pfs_fileno), curlwp, pown, |
1633 | &bp, path, MAXPATHLEN); | | 1635 | &bp, path, MAXPATHLEN); |
1634 | procfs_proc_unlock(pown); | | 1636 | procfs_proc_unlock(pown); |
1635 | len = strlen(bp); | | 1637 | len = strlen(bp); |
1636 | } else { | | 1638 | } else { |
1637 | file_t *fp; | | 1639 | file_t *fp; |
1638 | struct vnode *vxp, *vp; | | 1640 | struct vnode *vxp, *vp; |
1639 | | | 1641 | |
1640 | if ((error = procfs_proc_lock(pfs->pfs_pid, &pown, ESRCH)) != 0) | | 1642 | if ((error = procfs_proc_lock(pfs->pfs_pid, &pown, ESRCH)) != 0) |
1641 | return error; | | 1643 | return error; |
1642 | | | 1644 | |
1643 | fp = fd_getfile2(pown, pfs->pfs_fd); | | 1645 | fp = fd_getfile2(pown, pfs->pfs_fd); |
1644 | if (fp == NULL) { | | 1646 | if (fp == NULL) { |
1645 | procfs_proc_unlock(pown); | | 1647 | procfs_proc_unlock(pown); |
1646 | return EBADF; | | 1648 | return EBADF; |
1647 | } | | 1649 | } |
1648 | | | 1650 | |
1649 | switch (fp->f_type) { | | 1651 | switch (fp->f_type) { |
1650 | case DTYPE_VNODE: | | 1652 | case DTYPE_VNODE: |
1651 | vxp = (struct vnode *)fp->f_data; | | 1653 | vxp = (struct vnode *)fp->f_data; |
1652 | if (vxp->v_type != VDIR) { | | 1654 | if (vxp->v_type != VDIR) { |
1653 | error = EINVAL; | | 1655 | error = EINVAL; |
1654 | break; | | 1656 | break; |
1655 | } | | 1657 | } |
1656 | if ((path = malloc(MAXPATHLEN, M_TEMP, M_WAITOK)) | | 1658 | if ((path = malloc(MAXPATHLEN, M_TEMP, M_WAITOK)) |
1657 | == NULL) { | | 1659 | == NULL) { |
1658 | error = ENOMEM; | | 1660 | error = ENOMEM; |
1659 | break; | | 1661 | break; |
1660 | } | | 1662 | } |
1661 | bp = path + MAXPATHLEN; | | 1663 | bp = path + MAXPATHLEN; |
1662 | *--bp = '\0'; | | 1664 | *--bp = '\0'; |
1663 | | | 1665 | |
1664 | /* | | 1666 | /* |
1665 | * XXX: kludge to avoid locking against ourselves | | 1667 | * XXX: kludge to avoid locking against ourselves |
1666 | * in getcwd() | | 1668 | * in getcwd() |
1667 | */ | | 1669 | */ |
1668 | if (vxp->v_tag == VT_PROCFS) { | | 1670 | if (vxp->v_tag == VT_PROCFS) { |
1669 | *--bp = '/'; | | 1671 | *--bp = '/'; |
1670 | } else { | | 1672 | } else { |
1671 | rw_enter(&curproc->p_cwdi->cwdi_lock, | | 1673 | rw_enter(&curproc->p_cwdi->cwdi_lock, |
1672 | RW_READER); | | 1674 | RW_READER); |
1673 | vp = curproc->p_cwdi->cwdi_rdir; | | 1675 | vp = curproc->p_cwdi->cwdi_rdir; |
1674 | if (vp == NULL) | | 1676 | if (vp == NULL) |
1675 | vp = rootvnode; | | 1677 | vp = rootvnode; |
1676 | error = getcwd_common(vxp, vp, &bp, path, | | 1678 | error = getcwd_common(vxp, vp, &bp, path, |
1677 | MAXPATHLEN / 2, 0, curlwp); | | 1679 | MAXPATHLEN / 2, 0, curlwp); |
1678 | rw_exit(&curproc->p_cwdi->cwdi_lock); | | 1680 | rw_exit(&curproc->p_cwdi->cwdi_lock); |
1679 | } | | 1681 | } |
1680 | if (error) | | 1682 | if (error) |
1681 | break; | | 1683 | break; |
1682 | len = strlen(bp); | | 1684 | len = strlen(bp); |
1683 | break; | | 1685 | break; |
1684 | | | 1686 | |
1685 | case DTYPE_MISC: | | 1687 | case DTYPE_MISC: |
1686 | len = snprintf(bf, sizeof(bf), "%s", "[misc]"); | | 1688 | len = snprintf(bf, sizeof(bf), "%s", "[misc]"); |
1687 | break; | | 1689 | break; |
1688 | | | 1690 | |
1689 | case DTYPE_KQUEUE: | | 1691 | case DTYPE_KQUEUE: |
1690 | len = snprintf(bf, sizeof(bf), "%s", "[kqueue]"); | | 1692 | len = snprintf(bf, sizeof(bf), "%s", "[kqueue]"); |
1691 | break; | | 1693 | break; |
1692 | | | 1694 | |
1693 | case DTYPE_SEM: | | 1695 | case DTYPE_SEM: |
1694 | len = snprintf(bf, sizeof(bf), "%s", "[ksem]"); | | 1696 | len = snprintf(bf, sizeof(bf), "%s", "[ksem]"); |
1695 | break; | | 1697 | break; |
1696 | | | 1698 | |
1697 | default: | | 1699 | default: |
1698 | error = EINVAL; | | 1700 | error = EINVAL; |
1699 | break; | | 1701 | break; |
1700 | } | | 1702 | } |
1701 | closef(fp); | | 1703 | closef(fp); |
1702 | procfs_proc_unlock(pown); | | 1704 | procfs_proc_unlock(pown); |
1703 | } | | 1705 | } |
1704 | | | 1706 | |
1705 | if (error == 0) | | 1707 | if (error == 0) |
1706 | error = uiomove(bp, len, ap->a_uio); | | 1708 | error = uiomove(bp, len, ap->a_uio); |
1707 | if (path) | | 1709 | if (path) |
1708 | free(path, M_TEMP); | | 1710 | free(path, M_TEMP); |
1709 | return error; | | 1711 | return error; |
1710 | } | | 1712 | } |
1711 | | | 1713 | |
| | | 1714 | int |
| | | 1715 | procfs_getpages(void *v) |
| | | 1716 | { |
| | | 1717 | struct vop_getpages_args /* { |
| | | 1718 | struct vnode *a_vp; |
| | | 1719 | voff_t a_offset; |
| | | 1720 | struct vm_page **a_m; |
| | | 1721 | int *a_count; |
| | | 1722 | int a_centeridx; |
| | | 1723 | vm_prot_t a_access_type; |
| | | 1724 | int a_advice; |
| | | 1725 | int a_flags; |
| | | 1726 | } */ *ap = v; |
| | | 1727 | |
| | | 1728 | if ((ap->a_flags & PGO_LOCKED) == 0) |
| | | 1729 | mutex_exit(ap->a_vp->v_interlock); |
| | | 1730 | |
| | | 1731 | return (EFAULT); |
| | | 1732 | } |
| | | 1733 | |
1712 | /* | | 1734 | /* |
1713 | * convert decimal ascii to int | | 1735 | * convert decimal ascii to int |
1714 | */ | | 1736 | */ |
1715 | static int | | 1737 | static int |
1716 | atoi(const char *b, size_t len) | | 1738 | atoi(const char *b, size_t len) |
1717 | { | | 1739 | { |
1718 | int p = 0; | | 1740 | int p = 0; |
1719 | | | 1741 | |
1720 | while (len--) { | | 1742 | while (len--) { |
1721 | char c = *b++; | | 1743 | char c = *b++; |
1722 | if (c < '0' || c > '9') | | 1744 | if (c < '0' || c > '9') |
1723 | return -1; | | 1745 | return -1; |
1724 | p = 10 * p + (c - '0'); | | 1746 | p = 10 * p + (c - '0'); |
1725 | } | | 1747 | } |
1726 | | | 1748 | |
1727 | return p; | | 1749 | return p; |
1728 | } | | 1750 | } |