procfs_cmdline.c revision 1.21.14.1
1 /* $NetBSD: procfs_cmdline.c,v 1.21.14.1 2006/11/17 16:34:40 ad Exp $ */ 2 3 /* 4 * Copyright (c) 1999 Jaromir Dolecek <dolecek (at) ics.muni.cz> 5 * Copyright (c) 1999 The NetBSD Foundation, Inc. 6 * All rights reserved. 7 * 8 * This code is derived from software contributed to The NetBSD Foundation 9 * by Jaromir Dolecek. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgement: 21 * This product includes software developed by the NetBSD 22 * Foundation, Inc. and its contributors. 23 * 4. Neither the name of The NetBSD Foundation nor the names of its 24 * contributors may be used to endorse or promote products derived 25 * from this software without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 29 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 30 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 31 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 32 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 35 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 37 * POSSIBILITY OF SUCH DAMAGE. 38 */ 39 40 #include <sys/cdefs.h> 41 __KERNEL_RCSID(0, "$NetBSD: procfs_cmdline.c,v 1.21.14.1 2006/11/17 16:34:40 ad Exp $"); 42 43 #include <sys/param.h> 44 #include <sys/systm.h> 45 #include <sys/syslimits.h> 46 #include <sys/proc.h> 47 #include <sys/vnode.h> 48 #include <sys/exec.h> 49 #include <sys/malloc.h> 50 #include <miscfs/procfs/procfs.h> 51 52 #include <uvm/uvm_extern.h> 53 54 /* 55 * code for returning process's command line arguments 56 */ 57 int 58 procfs_docmdline(curl, p, pfs, uio) 59 struct lwp *curl; 60 struct proc *p; 61 struct pfsnode *pfs; 62 struct uio *uio; 63 { 64 struct ps_strings pss; 65 int count, error; 66 size_t i, len, xlen, upper_bound; 67 struct uio auio; 68 struct iovec aiov; 69 struct vmspace *vm; 70 vaddr_t argv; 71 char *arg; 72 73 /* Don't allow writing. */ 74 if (uio->uio_rw != UIO_READ) 75 return (EOPNOTSUPP); 76 77 /* 78 * Allocate a temporary buffer to hold the arguments. 79 */ 80 arg = malloc(PAGE_SIZE, M_TEMP, M_WAITOK); 81 82 /* 83 * Zombies don't have a stack, so we can't read their psstrings. 84 * System processes also don't have a user stack. This is what 85 * ps(1) would display. 86 */ 87 if (P_ZOMBIE(p) || (p->p_flag & P_SYSTEM) != 0) { 88 len = snprintf(arg, PAGE_SIZE, "(%s)", p->p_comm); 89 error = uiomove_frombuf(arg, len, uio); 90 free(arg, M_TEMP); 91 return (error); 92 } 93 94 /* 95 * NOTE: Don't bother doing a process_checkioperm() here 96 * because the psstrings info is available by using ps(1), 97 * so it's not like there's anything to protect here. 98 */ 99 100 /* 101 * Lock the process down in memory. 102 */ 103 if ((error = proc_vmspace_getref(p, &vm)) != 0) { 104 free(arg, M_TEMP); 105 return (error); 106 } 107 108 /* 109 * Read in the ps_strings structure. 110 */ 111 aiov.iov_base = &pss; 112 aiov.iov_len = sizeof(pss); 113 auio.uio_iov = &aiov; 114 auio.uio_iovcnt = 1; 115 auio.uio_offset = (vaddr_t)p->p_psstr; 116 auio.uio_resid = sizeof(pss); 117 auio.uio_rw = UIO_READ; 118 UIO_SETUP_SYSSPACE(&auio); 119 error = uvm_io(&vm->vm_map, &auio); 120 if (error) 121 goto bad; 122 123 /* 124 * Now read the address of the argument vector. 125 */ 126 aiov.iov_base = &argv; 127 aiov.iov_len = sizeof(argv); 128 auio.uio_iov = &aiov; 129 auio.uio_iovcnt = 1; 130 auio.uio_offset = (vaddr_t)pss.ps_argvstr; 131 auio.uio_resid = sizeof(argv); 132 auio.uio_rw = UIO_READ; 133 UIO_SETUP_SYSSPACE(&auio); 134 error = uvm_io(&vm->vm_map, &auio); 135 if (error) 136 goto bad; 137 138 /* 139 * Now copy in the actual argument vector, one page at a time, 140 * since we don't know how long the vector is (though, we do 141 * know how many NUL-terminated strings are in the vector). 142 */ 143 len = 0; 144 count = pss.ps_nargvstr; 145 upper_bound = round_page(uio->uio_offset + uio->uio_resid); 146 for (; count && len < upper_bound; len += xlen) { 147 aiov.iov_base = arg; 148 aiov.iov_len = PAGE_SIZE; 149 auio.uio_iov = &aiov; 150 auio.uio_iovcnt = 1; 151 auio.uio_offset = argv + len; 152 xlen = PAGE_SIZE - ((argv + len) & PAGE_MASK); 153 auio.uio_resid = xlen; 154 auio.uio_rw = UIO_READ; 155 UIO_SETUP_SYSSPACE(&auio); 156 error = uvm_io(&vm->vm_map, &auio); 157 if (error) 158 goto bad; 159 160 for (i = 0; i < xlen && count != 0; i++) { 161 if (arg[i] == '\0') 162 count--; /* one full string */ 163 } 164 165 if (count == 0) 166 i--; /* exclude the final NUL */ 167 168 if (len + i > uio->uio_offset) { 169 /* Have data in this page, copy it out */ 170 error = uiomove(arg + uio->uio_offset - len, 171 i + len - uio->uio_offset, uio); 172 if (error || uio->uio_resid <= 0) 173 break; 174 } 175 } 176 177 bad: 178 /* 179 * Release the process. 180 */ 181 uvmspace_free(vm); 182 183 free(arg, M_TEMP); 184 return (error); 185 } 186
Indexes created Tue Sep 30 20:09:53 GMT 2025