1/*- 2 * Copyright (c) 2001 Dag-Erling Sm�rgrav 3 * Copyright (c) 1993 Jan-Simon Pendry 4 * Copyright (c) 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Jan-Simon Pendry. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * @(#)procfs_vfsops.c 8.7 (Berkeley) 5/10/95 39 *
| 1/*- 2 * Copyright (c) 2001 Dag-Erling Sm�rgrav 3 * Copyright (c) 1993 Jan-Simon Pendry 4 * Copyright (c) 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Jan-Simon Pendry. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * @(#)procfs_vfsops.c 8.7 (Berkeley) 5/10/95 39 *
|
41 */ 42 43#include <sys/param.h> 44#include <sys/queue.h> 45#include <sys/exec.h> 46#include <sys/lock.h> 47#include <sys/kernel.h> 48#include <sys/malloc.h> 49#include <sys/mount.h> 50#include <sys/mutex.h> 51#include <sys/proc.h> 52#include <sys/sbuf.h> 53#include <sys/sysproto.h> 54#include <sys/systm.h> 55#include <sys/vnode.h> 56 57#include <vm/vm.h> 58#include <vm/pmap.h> 59#include <vm/vm_param.h> 60 61#include <fs/pseudofs/pseudofs.h> 62#include <fs/procfs/procfs.h> 63 64/* 65 * Filler function for proc/pid/self 66 */ 67int 68procfs_doprocfile(PFS_FILL_ARGS) 69{ 70 char *fullpath = "unknown"; 71 char *freepath = NULL; 72 struct vnode *textvp; 73 74 PROC_LOCK(p); 75 textvp = p->p_textvp; 76 vhold(textvp); 77 PROC_UNLOCK(p); 78 vn_fullpath(td, textvp, &fullpath, &freepath); 79 vdrop(textvp); 80 sbuf_printf(sb, "%s", fullpath); 81 if (freepath) 82 free(freepath, M_TEMP); 83 return (0); 84} 85 86/* 87 * Filler function for proc/curproc 88 */ 89int 90procfs_docurproc(PFS_FILL_ARGS) 91{ 92 sbuf_printf(sb, "%ld", (long)td->td_proc->p_pid); 93 return (0); 94} 95 96/* 97 * Adjust mode for some nodes that need it 98 */ 99int 100procfs_attr(PFS_ATTR_ARGS) 101{ 102 103 /* XXX inefficient, split into separate functions */ 104 if (strcmp(pn->pn_name, "ctl") == 0 || 105 strcmp(pn->pn_name, "note") == 0 || 106 strcmp(pn->pn_name, "notepg") == 0) 107 vap->va_mode = 0200; 108 else if (strcmp(pn->pn_name, "mem") == 0 || 109 strcmp(pn->pn_name, "regs") == 0 || 110 strcmp(pn->pn_name, "dbregs") == 0 ||
| 41 */ 42 43#include <sys/param.h> 44#include <sys/queue.h> 45#include <sys/exec.h> 46#include <sys/lock.h> 47#include <sys/kernel.h> 48#include <sys/malloc.h> 49#include <sys/mount.h> 50#include <sys/mutex.h> 51#include <sys/proc.h> 52#include <sys/sbuf.h> 53#include <sys/sysproto.h> 54#include <sys/systm.h> 55#include <sys/vnode.h> 56 57#include <vm/vm.h> 58#include <vm/pmap.h> 59#include <vm/vm_param.h> 60 61#include <fs/pseudofs/pseudofs.h> 62#include <fs/procfs/procfs.h> 63 64/* 65 * Filler function for proc/pid/self 66 */ 67int 68procfs_doprocfile(PFS_FILL_ARGS) 69{ 70 char *fullpath = "unknown"; 71 char *freepath = NULL; 72 struct vnode *textvp; 73 74 PROC_LOCK(p); 75 textvp = p->p_textvp; 76 vhold(textvp); 77 PROC_UNLOCK(p); 78 vn_fullpath(td, textvp, &fullpath, &freepath); 79 vdrop(textvp); 80 sbuf_printf(sb, "%s", fullpath); 81 if (freepath) 82 free(freepath, M_TEMP); 83 return (0); 84} 85 86/* 87 * Filler function for proc/curproc 88 */ 89int 90procfs_docurproc(PFS_FILL_ARGS) 91{ 92 sbuf_printf(sb, "%ld", (long)td->td_proc->p_pid); 93 return (0); 94} 95 96/* 97 * Adjust mode for some nodes that need it 98 */ 99int 100procfs_attr(PFS_ATTR_ARGS) 101{ 102 103 /* XXX inefficient, split into separate functions */ 104 if (strcmp(pn->pn_name, "ctl") == 0 || 105 strcmp(pn->pn_name, "note") == 0 || 106 strcmp(pn->pn_name, "notepg") == 0) 107 vap->va_mode = 0200; 108 else if (strcmp(pn->pn_name, "mem") == 0 || 109 strcmp(pn->pn_name, "regs") == 0 || 110 strcmp(pn->pn_name, "dbregs") == 0 ||
|
112 vap->va_mode = 0600; 113 114 if (p != NULL) { 115 PROC_LOCK_ASSERT(p, MA_OWNED); 116 117 if ((p->p_flag & P_SUGID) && pn->pn_type != pfstype_procdir) 118 vap->va_mode = 0; 119 } 120 121 return (0); 122} 123 124/* 125 * Visibility: some files only exist for non-system processes 126 * Non-static because linprocfs uses it. 127 */ 128int 129procfs_notsystem(PFS_VIS_ARGS) 130{ 131 PROC_LOCK_ASSERT(p, MA_OWNED); 132 return ((p->p_flag & P_SYSTEM) == 0); 133} 134 135/* 136 * Visibility: some files are only visible to process that can debug 137 * the target process. 138 */ 139int 140procfs_candebug(PFS_VIS_ARGS) 141{ 142 PROC_LOCK_ASSERT(p, MA_OWNED); 143 return ((p->p_flag & P_SYSTEM) == 0 && p_candebug(td, p) == 0); 144} 145 146/* 147 * Constructor 148 */ 149static int 150procfs_init(PFS_INIT_ARGS) 151{ 152 struct pfs_node *root; 153 struct pfs_node *dir; 154 struct pfs_node *node; 155 156 root = pi->pi_root; 157 158 pfs_create_link(root, "curproc", procfs_docurproc, 159 NULL, NULL, NULL, 0); 160 161 dir = pfs_create_dir(root, "pid", 162 procfs_attr, NULL, NULL, PFS_PROCDEP); 163 pfs_create_file(dir, "cmdline", procfs_doproccmdline, 164 NULL, NULL, NULL, PFS_RD); 165 pfs_create_file(dir, "ctl", procfs_doprocctl, 166 procfs_attr, NULL, NULL, PFS_WR); 167 pfs_create_file(dir, "dbregs", procfs_doprocdbregs, 168 procfs_attr, procfs_candebug, NULL, PFS_RDWR|PFS_RAW); 169 pfs_create_file(dir, "etype", procfs_doproctype, 170 NULL, NULL, NULL, PFS_RD); 171 pfs_create_file(dir, "fpregs", procfs_doprocfpregs, 172 procfs_attr, procfs_candebug, NULL, PFS_RDWR|PFS_RAW); 173 pfs_create_file(dir, "map", procfs_doprocmap, 174 NULL, procfs_notsystem, NULL, PFS_RD); 175 node = pfs_create_file(dir, "mem", procfs_doprocmem, 176 procfs_attr, procfs_candebug, NULL, PFS_RDWR|PFS_RAW); 177 node->pn_ioctl = procfs_ioctl; 178 node->pn_close = procfs_close; 179 pfs_create_file(dir, "note", procfs_doprocnote, 180 procfs_attr, procfs_candebug, NULL, PFS_WR); 181 pfs_create_file(dir, "notepg", procfs_doprocnote, 182 procfs_attr, procfs_candebug, NULL, PFS_WR); 183 pfs_create_file(dir, "regs", procfs_doprocregs, 184 procfs_attr, procfs_candebug, NULL, PFS_RDWR|PFS_RAW); 185 pfs_create_file(dir, "rlimit", procfs_doprocrlimit, 186 NULL, NULL, NULL, PFS_RD); 187 pfs_create_file(dir, "status", procfs_doprocstatus, 188 NULL, NULL, NULL, PFS_RD);
| 113 vap->va_mode = 0600; 114 115 if (p != NULL) { 116 PROC_LOCK_ASSERT(p, MA_OWNED); 117 118 if ((p->p_flag & P_SUGID) && pn->pn_type != pfstype_procdir) 119 vap->va_mode = 0; 120 } 121 122 return (0); 123} 124 125/* 126 * Visibility: some files only exist for non-system processes 127 * Non-static because linprocfs uses it. 128 */ 129int 130procfs_notsystem(PFS_VIS_ARGS) 131{ 132 PROC_LOCK_ASSERT(p, MA_OWNED); 133 return ((p->p_flag & P_SYSTEM) == 0); 134} 135 136/* 137 * Visibility: some files are only visible to process that can debug 138 * the target process. 139 */ 140int 141procfs_candebug(PFS_VIS_ARGS) 142{ 143 PROC_LOCK_ASSERT(p, MA_OWNED); 144 return ((p->p_flag & P_SYSTEM) == 0 && p_candebug(td, p) == 0); 145} 146 147/* 148 * Constructor 149 */ 150static int 151procfs_init(PFS_INIT_ARGS) 152{ 153 struct pfs_node *root; 154 struct pfs_node *dir; 155 struct pfs_node *node; 156 157 root = pi->pi_root; 158 159 pfs_create_link(root, "curproc", procfs_docurproc, 160 NULL, NULL, NULL, 0); 161 162 dir = pfs_create_dir(root, "pid", 163 procfs_attr, NULL, NULL, PFS_PROCDEP); 164 pfs_create_file(dir, "cmdline", procfs_doproccmdline, 165 NULL, NULL, NULL, PFS_RD); 166 pfs_create_file(dir, "ctl", procfs_doprocctl, 167 procfs_attr, NULL, NULL, PFS_WR); 168 pfs_create_file(dir, "dbregs", procfs_doprocdbregs, 169 procfs_attr, procfs_candebug, NULL, PFS_RDWR|PFS_RAW); 170 pfs_create_file(dir, "etype", procfs_doproctype, 171 NULL, NULL, NULL, PFS_RD); 172 pfs_create_file(dir, "fpregs", procfs_doprocfpregs, 173 procfs_attr, procfs_candebug, NULL, PFS_RDWR|PFS_RAW); 174 pfs_create_file(dir, "map", procfs_doprocmap, 175 NULL, procfs_notsystem, NULL, PFS_RD); 176 node = pfs_create_file(dir, "mem", procfs_doprocmem, 177 procfs_attr, procfs_candebug, NULL, PFS_RDWR|PFS_RAW); 178 node->pn_ioctl = procfs_ioctl; 179 node->pn_close = procfs_close; 180 pfs_create_file(dir, "note", procfs_doprocnote, 181 procfs_attr, procfs_candebug, NULL, PFS_WR); 182 pfs_create_file(dir, "notepg", procfs_doprocnote, 183 procfs_attr, procfs_candebug, NULL, PFS_WR); 184 pfs_create_file(dir, "regs", procfs_doprocregs, 185 procfs_attr, procfs_candebug, NULL, PFS_RDWR|PFS_RAW); 186 pfs_create_file(dir, "rlimit", procfs_doprocrlimit, 187 NULL, NULL, NULL, PFS_RD); 188 pfs_create_file(dir, "status", procfs_doprocstatus, 189 NULL, NULL, NULL, PFS_RD);
|