procfs_regs.c revision 330897
1/*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1993 Jan-Simon Pendry 5 * Copyright (c) 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by 9 * Jan-Simon Pendry. 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 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 * 35 * @(#)procfs_regs.c 8.4 (Berkeley) 6/15/94 36 * 37 * From: 38 * $Id: procfs_regs.c,v 3.2 1993/12/15 09:40:17 jsp Exp $ 39 * $FreeBSD: stable/11/sys/fs/procfs/procfs_regs.c 330897 2018-03-14 03:19:51Z eadler $ 40 */ 41 42#include "opt_compat.h" 43 44#include <sys/param.h> 45#include <sys/systm.h> 46#include <sys/lock.h> 47#include <sys/mutex.h> 48#include <sys/proc.h> 49#include <sys/ptrace.h> 50#include <sys/sysent.h> 51#include <sys/uio.h> 52 53#include <machine/reg.h> 54 55#include <fs/pseudofs/pseudofs.h> 56#include <fs/procfs/procfs.h> 57 58#ifdef COMPAT_FREEBSD32 59#include <sys/procfs.h> 60#include <machine/fpu.h> 61 62/* 63 * PROC(write, regs, td2, &r) becomes 64 * proc_write_regs(td2, &r) or 65 * proc_write_regs32(td2, &r32) 66 * 67 * UIOMOVE_FROMBUF(r, uio) becomes 68 * uiomove_frombuf(&r, sizeof(r), uio) or 69 * uiomove_frombuf(&r32, sizeof(r32), uio) 70 */ 71#define PROC(d, w, t, r) wrap32 ? \ 72 proc_ ## d ## _ ## w ## 32(t, r ## 32) : \ 73 proc_ ## d ## _ ## w(t, r) 74#define UIOMOVE_FROMBUF(k, u) wrap32 ? \ 75 uiomove_frombuf(& k ## 32, sizeof(k ## 32), u) : \ 76 uiomove_frombuf(& k, sizeof(k), u) 77#else 78#define PROC(d, w, t, r) proc_ ## d ## _ ## w(t, r) 79#define UIOMOVE_FROMBUF(k, u) uiomove_frombuf(& k, sizeof(k), u) 80#endif 81 82int 83procfs_doprocregs(PFS_FILL_ARGS) 84{ 85 int error; 86 struct reg r; 87 struct thread *td2; 88#ifdef COMPAT_FREEBSD32 89 struct reg32 r32; 90 int wrap32 = 0; 91#endif 92 93 if (uio->uio_offset != 0) 94 return (0); 95 96 PROC_LOCK(p); 97 PROC_ASSERT_HELD(p); 98 if (p_candebug(td, p)) { 99 PROC_UNLOCK(p); 100 return (EPERM); 101 } 102 if (!P_SHOULDSTOP(p)) { 103 PROC_UNLOCK(p); 104 return (EBUSY); 105 } 106 107 /* XXXKSE: */ 108 td2 = FIRST_THREAD_IN_PROC(p); 109#ifdef COMPAT_FREEBSD32 110 if (SV_CURPROC_FLAG(SV_ILP32)) { 111 if ((SV_PROC_FLAG(td2->td_proc, SV_ILP32)) == 0) { 112 PROC_UNLOCK(p); 113 return (EINVAL); 114 } 115 wrap32 = 1; 116 } 117#endif 118 error = PROC(read, regs, td2, &r); 119 if (error == 0) { 120 PROC_UNLOCK(p); 121 error = UIOMOVE_FROMBUF(r, uio); 122 PROC_LOCK(p); 123 } 124 if (error == 0 && uio->uio_rw == UIO_WRITE) { 125 if (!P_SHOULDSTOP(p)) 126 error = EBUSY; 127 else 128 /* XXXKSE: */ 129 error = PROC(write, regs, td2, &r); 130 } 131 PROC_UNLOCK(p); 132 133 return (error); 134} 135