License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license of the kernel, which is GPL version 2.
Update the files which contain no license information with the 'GPL-2.0'
SPDX license identifier. The SPDX identifier is a legally binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the use cases:
- file had no licensing information it it.
- file was a */uapi/* one with no licensing information in it,
- file was a */uapi/* one with existing licensing information,
Further patches will be generated in subsequent months to fix up cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base worksheet, and did an initial spot review of a few 1000 files.
The 4.13 kernel was the starting point of the analysis with 60,537 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately clear with lawyers working with the Linux Foundation.
Criteria used to select files for SPDX license identifier tagging was:
- Files considered eligible had to be source code files.
- Make and config files were included as candidates if they contained >5
lines of source
- File already had some variant of a license header in it (even if <5
lines).
All documentation files were explicitly excluded.
The following heuristics were used to determine which SPDX license
identifiers to apply.
- when both scanners couldn't find any license traces, file was
considered to have no license information in it, and the top level
COPYING file license applied.
For non */uapi/* files that summary was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 11139
and resulted in the first patch in this series.
If that file was a */uapi/* path one, it was "GPL-2.0 WITH
Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 WITH Linux-syscall-note 930
and resulted in the second patch in this series.
- if a file had some form of licensing information in it, and was one
of the */uapi/* ones, it was denoted with the Linux-syscall-note if
any GPL family license was found in the file or had no licensing in
it (per prior point). Results summary:
SPDX license identifier # files
---------------------------------------------------|------
GPL-2.0 WITH Linux-syscall-note 270
GPL-2.0+ WITH Linux-syscall-note 169
((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21
((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17
LGPL-2.1+ WITH Linux-syscall-note 15
GPL-1.0+ WITH Linux-syscall-note 14
((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5
LGPL-2.0+ WITH Linux-syscall-note 4
LGPL-2.1 WITH Linux-syscall-note 3
((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3
((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1
and that resulted in the third patch in this series.
- when the two scanners agreed on the detected license(s), that became
the concluded license(s).
- when there was disagreement between the two scanners (one detected a
license but the other didn't, or they both detected different
licenses) a manual inspection of the file occurred.
- In most cases a manual inspection of the information in the file
resulted in a clear resolution of the license that should apply (and
which scanner probably needed to revisit its heuristics).
- When it was not immediately clear, the license identifier was
confirmed with lawyers working with the Linux Foundation.
- If there was any question as to the appropriate license identifier,
the file was flagged for further research and to be revisited later
in time.
In total, over 70 hours of logged manual review was done on the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version early this week with:
- a full scancode scan run, collecting the matched texts, detected
license ids and scores
- reviewing anything where there was a license detected (about 500+
files) to ensure that the applied SPDX license was correct
- reviewing anything where there was no detection but the patch license
was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied
SPDX license was correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 14:07:57 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
2011-01-05 11:48:10 +00:00
|
|
|
* Ptrace user space interface.
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
2012-07-20 09:15:04 +00:00
|
|
|
* Copyright IBM Corp. 1999, 2010
|
2011-01-05 11:48:10 +00:00
|
|
|
* Author(s): Denis Joseph Barrow
|
2005-04-16 22:20:36 +00:00
|
|
|
* Martin Schwidefsky (schwidefsky@de.ibm.com)
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
|
#include <linux/sched.h>
|
2017-02-08 17:51:37 +00:00
|
|
|
#include <linux/sched/task_stack.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/mm.h>
|
|
|
|
|
#include <linux/smp.h>
|
|
|
|
|
#include <linux/errno.h>
|
|
|
|
|
#include <linux/ptrace.h>
|
|
|
|
|
#include <linux/user.h>
|
|
|
|
|
#include <linux/security.h>
|
|
|
|
|
#include <linux/audit.h>
|
2005-05-01 15:59:14 +00:00
|
|
|
#include <linux/signal.h>
|
2008-07-14 07:58:54 +00:00
|
|
|
#include <linux/elf.h>
|
|
|
|
|
#include <linux/regset.h>
|
2008-10-10 19:33:20 +00:00
|
|
|
#include <linux/tracehook.h>
|
2009-06-12 08:26:26 +00:00
|
|
|
#include <linux/seccomp.h>
|
2012-02-27 09:01:52 +00:00
|
|
|
#include <linux/compat.h>
|
2009-06-12 08:26:47 +00:00
|
|
|
#include <trace/syscall.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <asm/segment.h>
|
|
|
|
|
#include <asm/page.h>
|
|
|
|
|
#include <asm/pgtable.h>
|
|
|
|
|
#include <asm/pgalloc.h>
|
2016-12-24 19:46:01 +00:00
|
|
|
#include <linux/uaccess.h>
|
2005-06-04 22:43:30 +00:00
|
|
|
#include <asm/unistd.h>
|
2012-03-28 17:30:02 +00:00
|
|
|
#include <asm/switch_to.h>
|
2008-04-17 05:46:26 +00:00
|
|
|
#include "entry.h"
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2006-01-06 08:19:28 +00:00
|
|
|
#ifdef CONFIG_COMPAT
|
2005-04-16 22:20:36 +00:00
|
|
|
#include "compat_ptrace.h"
|
|
|
|
|
#endif
|
|
|
|
|
|
2009-08-24 21:43:14 +00:00
|
|
|
#define CREATE_TRACE_POINTS
|
|
|
|
|
#include <trace/events/syscalls.h>
|
2009-08-18 08:41:57 +00:00
|
|
|
|
2013-07-02 20:58:26 +00:00
|
|
|
void update_cr_regs(struct task_struct *task)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2011-01-05 11:48:10 +00:00
|
|
|
struct pt_regs *regs = task_pt_regs(task);
|
|
|
|
|
struct thread_struct *thread = &task->thread;
|
2011-10-30 14:16:07 +00:00
|
|
|
struct per_regs old, new;
|
2016-01-26 13:10:34 +00:00
|
|
|
unsigned long cr0_old, cr0_new;
|
|
|
|
|
unsigned long cr2_old, cr2_new;
|
|
|
|
|
int cr0_changed, cr2_changed;
|
|
|
|
|
|
|
|
|
|
__ctl_store(cr0_old, 0, 0);
|
|
|
|
|
__ctl_store(cr2_old, 2, 2);
|
|
|
|
|
cr0_new = cr0_old;
|
|
|
|
|
cr2_new = cr2_old;
|
2012-07-31 09:03:04 +00:00
|
|
|
/* Take care of the enable/disable of transactional execution. */
|
s390/kernel: lazy restore fpu registers
Improve the save and restore behavior of FPU register contents to use the
vector extension within the kernel.
The kernel does not use floating-point or vector registers and, therefore,
saving and restoring the FPU register contents are performed for handling
signals or switching processes only. To prepare for using vector
instructions and vector registers within the kernel, enhance the save
behavior and implement a lazy restore at return to user space from a
system call or interrupt.
To implement the lazy restore, the save_fpu_regs() sets a CPU information
flag, CIF_FPU, to indicate that the FPU registers must be restored.
Saving and setting CIF_FPU is performed in an atomic fashion to be
interrupt-safe. When the kernel wants to use the vector extension or
wants to change the FPU register state for a task during signal handling,
the save_fpu_regs() must be called first. The CIF_FPU flag is also set at
process switch. At return to user space, the FPU state is restored. In
particular, the FPU state includes the floating-point or vector register
contents, as well as, vector-enablement and floating-point control. The
FPU state restore and clearing CIF_FPU is also performed in an atomic
fashion.
For KVM, the restore of the FPU register state is performed when restoring
the general-purpose guest registers before the SIE instructions is started.
Because the path towards the SIE instruction is interruptible, the CIF_FPU
flag must be checked again right before going into SIE. If set, the guest
registers must be reloaded again by re-entering the outer SIE loop. This
is the same behavior as if the SIE critical section is interrupted.
Signed-off-by: Hendrik Brueckner <brueckner@linux.vnet.ibm.com>
Signed-off-by: Martin Schwidefsky <schwidefsky@de.ibm.com>
2015-06-10 10:53:42 +00:00
|
|
|
if (MACHINE_HAS_TE) {
|
|
|
|
|
/* Set or clear transaction execution TXC bit 8. */
|
2016-01-26 13:10:34 +00:00
|
|
|
cr0_new |= (1UL << 55);
|
s390/kernel: lazy restore fpu registers
Improve the save and restore behavior of FPU register contents to use the
vector extension within the kernel.
The kernel does not use floating-point or vector registers and, therefore,
saving and restoring the FPU register contents are performed for handling
signals or switching processes only. To prepare for using vector
instructions and vector registers within the kernel, enhance the save
behavior and implement a lazy restore at return to user space from a
system call or interrupt.
To implement the lazy restore, the save_fpu_regs() sets a CPU information
flag, CIF_FPU, to indicate that the FPU registers must be restored.
Saving and setting CIF_FPU is performed in an atomic fashion to be
interrupt-safe. When the kernel wants to use the vector extension or
wants to change the FPU register state for a task during signal handling,
the save_fpu_regs() must be called first. The CIF_FPU flag is also set at
process switch. At return to user space, the FPU state is restored. In
particular, the FPU state includes the floating-point or vector register
contents, as well as, vector-enablement and floating-point control. The
FPU state restore and clearing CIF_FPU is also performed in an atomic
fashion.
For KVM, the restore of the FPU register state is performed when restoring
the general-purpose guest registers before the SIE instructions is started.
Because the path towards the SIE instruction is interruptible, the CIF_FPU
flag must be checked again right before going into SIE. If set, the guest
registers must be reloaded again by re-entering the outer SIE loop. This
is the same behavior as if the SIE critical section is interrupted.
Signed-off-by: Hendrik Brueckner <brueckner@linux.vnet.ibm.com>
Signed-off-by: Martin Schwidefsky <schwidefsky@de.ibm.com>
2015-06-10 10:53:42 +00:00
|
|
|
if (task->thread.per_flags & PER_FLAG_NO_TE)
|
2016-01-26 13:10:34 +00:00
|
|
|
cr0_new &= ~(1UL << 55);
|
s390/kernel: lazy restore fpu registers
Improve the save and restore behavior of FPU register contents to use the
vector extension within the kernel.
The kernel does not use floating-point or vector registers and, therefore,
saving and restoring the FPU register contents are performed for handling
signals or switching processes only. To prepare for using vector
instructions and vector registers within the kernel, enhance the save
behavior and implement a lazy restore at return to user space from a
system call or interrupt.
To implement the lazy restore, the save_fpu_regs() sets a CPU information
flag, CIF_FPU, to indicate that the FPU registers must be restored.
Saving and setting CIF_FPU is performed in an atomic fashion to be
interrupt-safe. When the kernel wants to use the vector extension or
wants to change the FPU register state for a task during signal handling,
the save_fpu_regs() must be called first. The CIF_FPU flag is also set at
process switch. At return to user space, the FPU state is restored. In
particular, the FPU state includes the floating-point or vector register
contents, as well as, vector-enablement and floating-point control. The
FPU state restore and clearing CIF_FPU is also performed in an atomic
fashion.
For KVM, the restore of the FPU register state is performed when restoring
the general-purpose guest registers before the SIE instructions is started.
Because the path towards the SIE instruction is interruptible, the CIF_FPU
flag must be checked again right before going into SIE. If set, the guest
registers must be reloaded again by re-entering the outer SIE loop. This
is the same behavior as if the SIE critical section is interrupted.
Signed-off-by: Hendrik Brueckner <brueckner@linux.vnet.ibm.com>
Signed-off-by: Martin Schwidefsky <schwidefsky@de.ibm.com>
2015-06-10 10:53:42 +00:00
|
|
|
/* Set or clear transaction execution TDC bits 62 and 63. */
|
2016-01-26 13:10:34 +00:00
|
|
|
cr2_new &= ~3UL;
|
s390/kernel: lazy restore fpu registers
Improve the save and restore behavior of FPU register contents to use the
vector extension within the kernel.
The kernel does not use floating-point or vector registers and, therefore,
saving and restoring the FPU register contents are performed for handling
signals or switching processes only. To prepare for using vector
instructions and vector registers within the kernel, enhance the save
behavior and implement a lazy restore at return to user space from a
system call or interrupt.
To implement the lazy restore, the save_fpu_regs() sets a CPU information
flag, CIF_FPU, to indicate that the FPU registers must be restored.
Saving and setting CIF_FPU is performed in an atomic fashion to be
interrupt-safe. When the kernel wants to use the vector extension or
wants to change the FPU register state for a task during signal handling,
the save_fpu_regs() must be called first. The CIF_FPU flag is also set at
process switch. At return to user space, the FPU state is restored. In
particular, the FPU state includes the floating-point or vector register
contents, as well as, vector-enablement and floating-point control. The
FPU state restore and clearing CIF_FPU is also performed in an atomic
fashion.
For KVM, the restore of the FPU register state is performed when restoring
the general-purpose guest registers before the SIE instructions is started.
Because the path towards the SIE instruction is interruptible, the CIF_FPU
flag must be checked again right before going into SIE. If set, the guest
registers must be reloaded again by re-entering the outer SIE loop. This
is the same behavior as if the SIE critical section is interrupted.
Signed-off-by: Hendrik Brueckner <brueckner@linux.vnet.ibm.com>
Signed-off-by: Martin Schwidefsky <schwidefsky@de.ibm.com>
2015-06-10 10:53:42 +00:00
|
|
|
if (task->thread.per_flags & PER_FLAG_TE_ABORT_RAND) {
|
|
|
|
|
if (task->thread.per_flags & PER_FLAG_TE_ABORT_RAND_TEND)
|
2016-01-26 13:10:34 +00:00
|
|
|
cr2_new |= 1UL;
|
s390/kernel: lazy restore fpu registers
Improve the save and restore behavior of FPU register contents to use the
vector extension within the kernel.
The kernel does not use floating-point or vector registers and, therefore,
saving and restoring the FPU register contents are performed for handling
signals or switching processes only. To prepare for using vector
instructions and vector registers within the kernel, enhance the save
behavior and implement a lazy restore at return to user space from a
system call or interrupt.
To implement the lazy restore, the save_fpu_regs() sets a CPU information
flag, CIF_FPU, to indicate that the FPU registers must be restored.
Saving and setting CIF_FPU is performed in an atomic fashion to be
interrupt-safe. When the kernel wants to use the vector extension or
wants to change the FPU register state for a task during signal handling,
the save_fpu_regs() must be called first. The CIF_FPU flag is also set at
process switch. At return to user space, the FPU state is restored. In
particular, the FPU state includes the floating-point or vector register
contents, as well as, vector-enablement and floating-point control. The
FPU state restore and clearing CIF_FPU is also performed in an atomic
fashion.
For KVM, the restore of the FPU register state is performed when restoring
the general-purpose guest registers before the SIE instructions is started.
Because the path towards the SIE instruction is interruptible, the CIF_FPU
flag must be checked again right before going into SIE. If set, the guest
registers must be reloaded again by re-entering the outer SIE loop. This
is the same behavior as if the SIE critical section is interrupted.
Signed-off-by: Hendrik Brueckner <brueckner@linux.vnet.ibm.com>
Signed-off-by: Martin Schwidefsky <schwidefsky@de.ibm.com>
2015-06-10 10:53:42 +00:00
|
|
|
else
|
2016-01-26 13:10:34 +00:00
|
|
|
cr2_new |= 2UL;
|
2013-07-02 20:58:26 +00:00
|
|
|
}
|
2012-07-31 09:03:04 +00:00
|
|
|
}
|
2016-01-26 13:10:34 +00:00
|
|
|
/* Take care of enable/disable of guarded storage. */
|
|
|
|
|
if (MACHINE_HAS_GS) {
|
|
|
|
|
cr2_new &= ~(1UL << 4);
|
|
|
|
|
if (task->thread.gs_cb)
|
|
|
|
|
cr2_new |= (1UL << 4);
|
|
|
|
|
}
|
|
|
|
|
/* Load control register 0/2 iff changed */
|
|
|
|
|
cr0_changed = cr0_new != cr0_old;
|
|
|
|
|
cr2_changed = cr2_new != cr2_old;
|
|
|
|
|
if (cr0_changed)
|
|
|
|
|
__ctl_load(cr0_new, 0, 0);
|
|
|
|
|
if (cr2_changed)
|
|
|
|
|
__ctl_load(cr2_new, 2, 2);
|
2011-10-30 14:16:07 +00:00
|
|
|
/* Copy user specified PER registers */
|
|
|
|
|
new.control = thread->per_user.control;
|
|
|
|
|
new.start = thread->per_user.start;
|
|
|
|
|
new.end = thread->per_user.end;
|
|
|
|
|
|
|
|
|
|
/* merge TIF_SINGLE_STEP into user specified PER registers. */
|
2014-09-22 14:39:06 +00:00
|
|
|
if (test_tsk_thread_flag(task, TIF_SINGLE_STEP) ||
|
|
|
|
|
test_tsk_thread_flag(task, TIF_UPROBE_SINGLESTEP)) {
|
2014-03-14 11:01:08 +00:00
|
|
|
if (test_tsk_thread_flag(task, TIF_BLOCK_STEP))
|
|
|
|
|
new.control |= PER_EVENT_BRANCH;
|
|
|
|
|
else
|
|
|
|
|
new.control |= PER_EVENT_IFETCH;
|
2012-07-31 09:03:04 +00:00
|
|
|
new.control |= PER_CONTROL_SUSPENSION;
|
|
|
|
|
new.control |= PER_EVENT_TRANSACTION_END;
|
2014-09-22 14:39:06 +00:00
|
|
|
if (test_tsk_thread_flag(task, TIF_UPROBE_SINGLESTEP))
|
|
|
|
|
new.control |= PER_EVENT_IFETCH;
|
2011-10-30 14:16:07 +00:00
|
|
|
new.start = 0;
|
2016-01-18 12:12:19 +00:00
|
|
|
new.end = -1UL;
|
2011-10-30 14:16:07 +00:00
|
|
|
}
|
2011-01-05 11:48:10 +00:00
|
|
|
|
|
|
|
|
/* Take care of the PER enablement bit in the PSW. */
|
2011-10-30 14:16:07 +00:00
|
|
|
if (!(new.control & PER_EVENT_MASK)) {
|
2005-04-16 22:20:36 +00:00
|
|
|
regs->psw.mask &= ~PSW_MASK_PER;
|
2011-01-05 11:48:10 +00:00
|
|
|
return;
|
2010-01-13 19:44:25 +00:00
|
|
|
}
|
2011-01-05 11:48:10 +00:00
|
|
|
regs->psw.mask |= PSW_MASK_PER;
|
|
|
|
|
__ctl_store(old, 9, 11);
|
2011-10-30 14:16:07 +00:00
|
|
|
if (memcmp(&new, &old, sizeof(struct per_regs)) != 0)
|
|
|
|
|
__ctl_load(new, 9, 11);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
2008-01-26 13:11:22 +00:00
|
|
|
void user_enable_single_step(struct task_struct *task)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2014-03-14 11:01:08 +00:00
|
|
|
clear_tsk_thread_flag(task, TIF_BLOCK_STEP);
|
2011-01-05 11:48:10 +00:00
|
|
|
set_tsk_thread_flag(task, TIF_SINGLE_STEP);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
2008-01-26 13:11:22 +00:00
|
|
|
void user_disable_single_step(struct task_struct *task)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2014-03-14 11:01:08 +00:00
|
|
|
clear_tsk_thread_flag(task, TIF_BLOCK_STEP);
|
2011-01-05 11:48:10 +00:00
|
|
|
clear_tsk_thread_flag(task, TIF_SINGLE_STEP);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
2014-03-14 11:01:08 +00:00
|
|
|
void user_enable_block_step(struct task_struct *task)
|
|
|
|
|
{
|
|
|
|
|
set_tsk_thread_flag(task, TIF_SINGLE_STEP);
|
|
|
|
|
set_tsk_thread_flag(task, TIF_BLOCK_STEP);
|
|
|
|
|
}
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
|
* Called by kernel/ptrace.c when detaching..
|
|
|
|
|
*
|
2011-01-05 11:48:10 +00:00
|
|
|
* Clear all debugging related fields.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2011-01-05 11:48:10 +00:00
|
|
|
void ptrace_disable(struct task_struct *task)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2011-01-05 11:48:10 +00:00
|
|
|
memset(&task->thread.per_user, 0, sizeof(task->thread.per_user));
|
|
|
|
|
memset(&task->thread.per_event, 0, sizeof(task->thread.per_event));
|
|
|
|
|
clear_tsk_thread_flag(task, TIF_SINGLE_STEP);
|
2014-04-15 10:55:07 +00:00
|
|
|
clear_pt_regs_flag(task_pt_regs(task), PIF_PER_TRAP);
|
2012-07-31 09:03:04 +00:00
|
|
|
task->thread.per_flags = 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
2015-02-12 12:08:27 +00:00
|
|
|
#define __ADDR_MASK 7
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2011-01-05 11:48:10 +00:00
|
|
|
static inline unsigned long __peek_user_per(struct task_struct *child,
|
|
|
|
|
addr_t addr)
|
|
|
|
|
{
|
|
|
|
|
struct per_struct_kernel *dummy = NULL;
|
|
|
|
|
|
|
|
|
|
if (addr == (addr_t) &dummy->cr9)
|
|
|
|
|
/* Control bits of the active per set. */
|
|
|
|
|
return test_thread_flag(TIF_SINGLE_STEP) ?
|
|
|
|
|
PER_EVENT_IFETCH : child->thread.per_user.control;
|
|
|
|
|
else if (addr == (addr_t) &dummy->cr10)
|
|
|
|
|
/* Start address of the active per set. */
|
|
|
|
|
return test_thread_flag(TIF_SINGLE_STEP) ?
|
|
|
|
|
0 : child->thread.per_user.start;
|
|
|
|
|
else if (addr == (addr_t) &dummy->cr11)
|
|
|
|
|
/* End address of the active per set. */
|
|
|
|
|
return test_thread_flag(TIF_SINGLE_STEP) ?
|
2016-01-18 12:12:19 +00:00
|
|
|
-1UL : child->thread.per_user.end;
|
2011-01-05 11:48:10 +00:00
|
|
|
else if (addr == (addr_t) &dummy->bits)
|
|
|
|
|
/* Single-step bit. */
|
|
|
|
|
return test_thread_flag(TIF_SINGLE_STEP) ?
|
|
|
|
|
(1UL << (BITS_PER_LONG - 1)) : 0;
|
|
|
|
|
else if (addr == (addr_t) &dummy->starting_addr)
|
|
|
|
|
/* Start address of the user specified per set. */
|
|
|
|
|
return child->thread.per_user.start;
|
|
|
|
|
else if (addr == (addr_t) &dummy->ending_addr)
|
|
|
|
|
/* End address of the user specified per set. */
|
|
|
|
|
return child->thread.per_user.end;
|
|
|
|
|
else if (addr == (addr_t) &dummy->perc_atmid)
|
|
|
|
|
/* PER code, ATMID and AI of the last PER trap */
|
|
|
|
|
return (unsigned long)
|
|
|
|
|
child->thread.per_event.cause << (BITS_PER_LONG - 16);
|
|
|
|
|
else if (addr == (addr_t) &dummy->address)
|
|
|
|
|
/* Address of the last PER trap */
|
|
|
|
|
return child->thread.per_event.address;
|
|
|
|
|
else if (addr == (addr_t) &dummy->access_id)
|
|
|
|
|
/* Access id of the last PER trap */
|
|
|
|
|
return (unsigned long)
|
|
|
|
|
child->thread.per_event.paid << (BITS_PER_LONG - 8);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
|
* Read the word at offset addr from the user area of a process. The
|
|
|
|
|
* trouble here is that the information is littered over different
|
|
|
|
|
* locations. The process registers are found on the kernel stack,
|
|
|
|
|
* the floating point stuff and the trace settings are stored in
|
|
|
|
|
* the task structure. In addition the different structures in
|
|
|
|
|
* struct user contain pad bytes that should be read as zeroes.
|
|
|
|
|
* Lovely...
|
|
|
|
|
*/
|
2008-07-14 07:58:54 +00:00
|
|
|
static unsigned long __peek_user(struct task_struct *child, addr_t addr)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
|
struct user *dummy = NULL;
|
2008-07-14 07:58:54 +00:00
|
|
|
addr_t offset, tmp;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
if (addr < (addr_t) &dummy->regs.acrs) {
|
|
|
|
|
/*
|
|
|
|
|
* psw and gprs are stored on the stack
|
|
|
|
|
*/
|
2006-01-12 09:05:49 +00:00
|
|
|
tmp = *(addr_t *)((addr_t) &task_pt_regs(child)->psw + addr);
|
2013-10-16 07:58:01 +00:00
|
|
|
if (addr == (addr_t) &dummy->regs.psw.mask) {
|
2011-10-30 14:16:50 +00:00
|
|
|
/* Return a clean psw mask. */
|
2013-10-16 07:58:01 +00:00
|
|
|
tmp &= PSW_MASK_USER | PSW_MASK_RI;
|
|
|
|
|
tmp |= PSW_USER_BITS;
|
|
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
} else if (addr < (addr_t) &dummy->regs.orig_gpr2) {
|
|
|
|
|
/*
|
|
|
|
|
* access registers are stored in the thread structure
|
|
|
|
|
*/
|
|
|
|
|
offset = addr - (addr_t) &dummy->regs.acrs;
|
2005-06-04 22:43:30 +00:00
|
|
|
/*
|
|
|
|
|
* Very special case: old & broken 64 bit gdb reading
|
|
|
|
|
* from acrs[15]. Result is a 64 bit value. Read the
|
|
|
|
|
* 32 bit acrs[15] value and shift it by 32. Sick...
|
|
|
|
|
*/
|
|
|
|
|
if (addr == (addr_t) &dummy->regs.acrs[15])
|
|
|
|
|
tmp = ((unsigned long) child->thread.acrs[15]) << 32;
|
|
|
|
|
else
|
2015-02-12 12:08:27 +00:00
|
|
|
tmp = *(addr_t *)((addr_t) &child->thread.acrs + offset);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
} else if (addr == (addr_t) &dummy->regs.orig_gpr2) {
|
|
|
|
|
/*
|
|
|
|
|
* orig_gpr2 is stored on the kernel stack
|
|
|
|
|
*/
|
2006-01-12 09:05:49 +00:00
|
|
|
tmp = (addr_t) task_pt_regs(child)->orig_gpr2;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
[S390] CVE-2008-1514: prevent ptrace padding area read/write in 31-bit mode
When running a 31-bit ptrace, on either an s390 or s390x kernel,
reads and writes into a padding area in struct user_regs_struct32
will result in a kernel panic.
This is also known as CVE-2008-1514.
Test case available here:
http://sources.redhat.com/cgi-bin/cvsweb.cgi/~checkout~/tests/ptrace-tests/tests/user-area-padding.c?cvsroot=systemtap
Steps to reproduce:
1) wget the above
2) gcc -o user-area-padding-31bit user-area-padding.c -Wall -ggdb2 -D_GNU_SOURCE -m31
3) ./user-area-padding-31bit
<panic>
Test status
-----------
Without patch, both s390 and s390x kernels panic. With patch, the test case,
as well as the gdb testsuite, pass without incident, padding area reads
returning zero, writes ignored.
Nb: original version returned -EINVAL on write attempts, which broke the
gdb test and made the test case slightly unhappy, Jan Kratochvil suggested
the change to return 0 on write attempts.
Signed-off-by: Jarod Wilson <jarod@redhat.com>
Tested-by: Jan Kratochvil <jan.kratochvil@redhat.com>
Signed-off-by: Martin Schwidefsky <schwidefsky@de.ibm.com>
2008-09-09 10:38:56 +00:00
|
|
|
} else if (addr < (addr_t) &dummy->regs.fp_regs) {
|
|
|
|
|
/*
|
|
|
|
|
* prevent reads of padding hole between
|
|
|
|
|
* orig_gpr2 and fp_regs on s390.
|
|
|
|
|
*/
|
|
|
|
|
tmp = 0;
|
|
|
|
|
|
2014-11-14 15:37:47 +00:00
|
|
|
} else if (addr == (addr_t) &dummy->regs.fp_regs.fpc) {
|
|
|
|
|
/*
|
|
|
|
|
* floating point control reg. is in the thread structure
|
|
|
|
|
*/
|
2015-06-11 13:33:54 +00:00
|
|
|
tmp = child->thread.fpu.fpc;
|
2014-11-14 15:37:47 +00:00
|
|
|
tmp <<= BITS_PER_LONG - 32;
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
} else if (addr < (addr_t) (&dummy->regs.fp_regs + 1)) {
|
2014-11-14 15:37:47 +00:00
|
|
|
/*
|
2015-06-11 13:33:54 +00:00
|
|
|
* floating point regs. are either in child->thread.fpu
|
|
|
|
|
* or the child->thread.fpu.vxrs array
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2014-11-14 15:37:47 +00:00
|
|
|
offset = addr - (addr_t) &dummy->regs.fp_regs.fprs;
|
2015-09-29 08:04:41 +00:00
|
|
|
if (MACHINE_HAS_VX)
|
2014-11-14 15:37:47 +00:00
|
|
|
tmp = *(addr_t *)
|
2015-06-11 13:33:54 +00:00
|
|
|
((addr_t) child->thread.fpu.vxrs + 2*offset);
|
2014-11-14 15:37:47 +00:00
|
|
|
else
|
|
|
|
|
tmp = *(addr_t *)
|
2015-10-27 12:13:38 +00:00
|
|
|
((addr_t) child->thread.fpu.fprs + offset);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
} else if (addr < (addr_t) (&dummy->regs.per_info + 1)) {
|
|
|
|
|
/*
|
2011-01-05 11:48:10 +00:00
|
|
|
* Handle access to the per_info structure.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2011-01-05 11:48:10 +00:00
|
|
|
addr -= (addr_t) &dummy->regs.per_info;
|
|
|
|
|
tmp = __peek_user_per(child, addr);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
} else
|
|
|
|
|
tmp = 0;
|
|
|
|
|
|
2008-07-14 07:58:54 +00:00
|
|
|
return tmp;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int
|
2008-07-14 07:58:54 +00:00
|
|
|
peek_user(struct task_struct *child, addr_t addr, addr_t data)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2008-07-14 07:58:54 +00:00
|
|
|
addr_t tmp, mask;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Stupid gdb peeks/pokes the access registers in 64 bit with
|
2008-07-14 07:58:54 +00:00
|
|
|
* an alignment of 4. Programmers from hell...
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2005-06-04 22:43:30 +00:00
|
|
|
mask = __ADDR_MASK;
|
2008-12-25 12:39:00 +00:00
|
|
|
if (addr >= (addr_t) &((struct user *) NULL)->regs.acrs &&
|
|
|
|
|
addr < (addr_t) &((struct user *) NULL)->regs.orig_gpr2)
|
2005-06-04 22:43:30 +00:00
|
|
|
mask = 3;
|
|
|
|
|
if ((addr & mask) || addr > sizeof(struct user) - __ADDR_MASK)
|
2005-04-16 22:20:36 +00:00
|
|
|
return -EIO;
|
|
|
|
|
|
2008-07-14 07:58:54 +00:00
|
|
|
tmp = __peek_user(child, addr);
|
|
|
|
|
return put_user(tmp, (addr_t __user *) data);
|
|
|
|
|
}
|
|
|
|
|
|
2011-01-05 11:48:10 +00:00
|
|
|
static inline void __poke_user_per(struct task_struct *child,
|
|
|
|
|
addr_t addr, addr_t data)
|
|
|
|
|
{
|
|
|
|
|
struct per_struct_kernel *dummy = NULL;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* There are only three fields in the per_info struct that the
|
|
|
|
|
* debugger user can write to.
|
|
|
|
|
* 1) cr9: the debugger wants to set a new PER event mask
|
|
|
|
|
* 2) starting_addr: the debugger wants to set a new starting
|
|
|
|
|
* address to use with the PER event mask.
|
|
|
|
|
* 3) ending_addr: the debugger wants to set a new ending
|
|
|
|
|
* address to use with the PER event mask.
|
|
|
|
|
* The user specified PER event mask and the start and end
|
|
|
|
|
* addresses are used only if single stepping is not in effect.
|
|
|
|
|
* Writes to any other field in per_info are ignored.
|
|
|
|
|
*/
|
|
|
|
|
if (addr == (addr_t) &dummy->cr9)
|
|
|
|
|
/* PER event mask of the user specified per set. */
|
|
|
|
|
child->thread.per_user.control =
|
|
|
|
|
data & (PER_EVENT_MASK | PER_CONTROL_MASK);
|
|
|
|
|
else if (addr == (addr_t) &dummy->starting_addr)
|
|
|
|
|
/* Starting address of the user specified per set. */
|
|
|
|
|
child->thread.per_user.start = data;
|
|
|
|
|
else if (addr == (addr_t) &dummy->ending_addr)
|
|
|
|
|
/* Ending address of the user specified per set. */
|
|
|
|
|
child->thread.per_user.end = data;
|
|
|
|
|
}
|
|
|
|
|
|
2008-07-14 07:58:54 +00:00
|
|
|
/*
|
|
|
|
|
* Write a word to the user area of a process at location addr. This
|
|
|
|
|
* operation does have an additional problem compared to peek_user.
|
|
|
|
|
* Stores to the program status word and on the floating point
|
|
|
|
|
* control register needs to get checked for validity.
|
|
|
|
|
*/
|
|
|
|
|
static int __poke_user(struct task_struct *child, addr_t addr, addr_t data)
|
|
|
|
|
{
|
|
|
|
|
struct user *dummy = NULL;
|
2011-10-30 14:16:51 +00:00
|
|
|
addr_t offset;
|
2008-07-14 07:58:54 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
if (addr < (addr_t) &dummy->regs.acrs) {
|
|
|
|
|
/*
|
|
|
|
|
* psw and gprs are stored on the stack
|
|
|
|
|
*/
|
2013-10-16 07:58:01 +00:00
|
|
|
if (addr == (addr_t) &dummy->regs.psw.mask) {
|
|
|
|
|
unsigned long mask = PSW_MASK_USER;
|
|
|
|
|
|
|
|
|
|
mask |= is_ri_task(child) ? PSW_MASK_RI : 0;
|
2014-06-23 13:29:40 +00:00
|
|
|
if ((data ^ PSW_USER_BITS) & ~mask)
|
|
|
|
|
/* Invalid psw mask. */
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
if ((data & PSW_MASK_ASC) == PSW_ASC_HOME)
|
|
|
|
|
/* Invalid address-space-control bits */
|
2013-10-16 07:58:01 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
if ((data & PSW_MASK_EA) && !(data & PSW_MASK_BA))
|
2014-06-23 13:29:40 +00:00
|
|
|
/* Invalid addressing mode bits */
|
2013-10-16 07:58:01 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
}
|
2006-01-12 09:05:49 +00:00
|
|
|
*(addr_t *)((addr_t) &task_pt_regs(child)->psw + addr) = data;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
} else if (addr < (addr_t) (&dummy->regs.orig_gpr2)) {
|
|
|
|
|
/*
|
|
|
|
|
* access registers are stored in the thread structure
|
|
|
|
|
*/
|
|
|
|
|
offset = addr - (addr_t) &dummy->regs.acrs;
|
2005-06-04 22:43:30 +00:00
|
|
|
/*
|
|
|
|
|
* Very special case: old & broken 64 bit gdb writing
|
|
|
|
|
* to acrs[15] with a 64 bit value. Ignore the lower
|
|
|
|
|
* half of the value and write the upper 32 bit to
|
|
|
|
|
* acrs[15]. Sick...
|
|
|
|
|
*/
|
|
|
|
|
if (addr == (addr_t) &dummy->regs.acrs[15])
|
|
|
|
|
child->thread.acrs[15] = (unsigned int) (data >> 32);
|
|
|
|
|
else
|
2015-02-12 12:08:27 +00:00
|
|
|
*(addr_t *)((addr_t) &child->thread.acrs + offset) = data;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
} else if (addr == (addr_t) &dummy->regs.orig_gpr2) {
|
|
|
|
|
/*
|
|
|
|
|
* orig_gpr2 is stored on the kernel stack
|
|
|
|
|
*/
|
2006-01-12 09:05:49 +00:00
|
|
|
task_pt_regs(child)->orig_gpr2 = data;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
[S390] CVE-2008-1514: prevent ptrace padding area read/write in 31-bit mode
When running a 31-bit ptrace, on either an s390 or s390x kernel,
reads and writes into a padding area in struct user_regs_struct32
will result in a kernel panic.
This is also known as CVE-2008-1514.
Test case available here:
http://sources.redhat.com/cgi-bin/cvsweb.cgi/~checkout~/tests/ptrace-tests/tests/user-area-padding.c?cvsroot=systemtap
Steps to reproduce:
1) wget the above
2) gcc -o user-area-padding-31bit user-area-padding.c -Wall -ggdb2 -D_GNU_SOURCE -m31
3) ./user-area-padding-31bit
<panic>
Test status
-----------
Without patch, both s390 and s390x kernels panic. With patch, the test case,
as well as the gdb testsuite, pass without incident, padding area reads
returning zero, writes ignored.
Nb: original version returned -EINVAL on write attempts, which broke the
gdb test and made the test case slightly unhappy, Jan Kratochvil suggested
the change to return 0 on write attempts.
Signed-off-by: Jarod Wilson <jarod@redhat.com>
Tested-by: Jan Kratochvil <jan.kratochvil@redhat.com>
Signed-off-by: Martin Schwidefsky <schwidefsky@de.ibm.com>
2008-09-09 10:38:56 +00:00
|
|
|
} else if (addr < (addr_t) &dummy->regs.fp_regs) {
|
|
|
|
|
/*
|
|
|
|
|
* prevent writes of padding hole between
|
|
|
|
|
* orig_gpr2 and fp_regs on s390.
|
|
|
|
|
*/
|
|
|
|
|
return 0;
|
|
|
|
|
|
2014-11-14 15:37:47 +00:00
|
|
|
} else if (addr == (addr_t) &dummy->regs.fp_regs.fpc) {
|
|
|
|
|
/*
|
|
|
|
|
* floating point control reg. is in the thread structure
|
|
|
|
|
*/
|
|
|
|
|
if ((unsigned int) data != 0 ||
|
|
|
|
|
test_fp_ctl(data >> (BITS_PER_LONG - 32)))
|
|
|
|
|
return -EINVAL;
|
2015-06-11 13:33:54 +00:00
|
|
|
child->thread.fpu.fpc = data >> (BITS_PER_LONG - 32);
|
2014-11-14 15:37:47 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
} else if (addr < (addr_t) (&dummy->regs.fp_regs + 1)) {
|
|
|
|
|
/*
|
2015-06-11 13:33:54 +00:00
|
|
|
* floating point regs. are either in child->thread.fpu
|
|
|
|
|
* or the child->thread.fpu.vxrs array
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2014-11-14 15:37:47 +00:00
|
|
|
offset = addr - (addr_t) &dummy->regs.fp_regs.fprs;
|
2015-09-29 08:04:41 +00:00
|
|
|
if (MACHINE_HAS_VX)
|
2014-11-14 15:37:47 +00:00
|
|
|
*(addr_t *)((addr_t)
|
2015-06-11 13:33:54 +00:00
|
|
|
child->thread.fpu.vxrs + 2*offset) = data;
|
2014-11-14 15:37:47 +00:00
|
|
|
else
|
|
|
|
|
*(addr_t *)((addr_t)
|
2015-10-27 12:13:38 +00:00
|
|
|
child->thread.fpu.fprs + offset) = data;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
} else if (addr < (addr_t) (&dummy->regs.per_info + 1)) {
|
|
|
|
|
/*
|
2011-01-05 11:48:10 +00:00
|
|
|
* Handle access to the per_info structure.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2011-01-05 11:48:10 +00:00
|
|
|
addr -= (addr_t) &dummy->regs.per_info;
|
|
|
|
|
__poke_user_per(child, addr, data);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2011-01-05 11:48:10 +00:00
|
|
|
static int poke_user(struct task_struct *child, addr_t addr, addr_t data)
|
2008-07-14 07:58:54 +00:00
|
|
|
{
|
|
|
|
|
addr_t mask;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Stupid gdb peeks/pokes the access registers in 64 bit with
|
|
|
|
|
* an alignment of 4. Programmers from hell indeed...
|
|
|
|
|
*/
|
|
|
|
|
mask = __ADDR_MASK;
|
2008-12-25 12:39:00 +00:00
|
|
|
if (addr >= (addr_t) &((struct user *) NULL)->regs.acrs &&
|
|
|
|
|
addr < (addr_t) &((struct user *) NULL)->regs.orig_gpr2)
|
2008-07-14 07:58:54 +00:00
|
|
|
mask = 3;
|
|
|
|
|
if ((addr & mask) || addr > sizeof(struct user) - __ADDR_MASK)
|
|
|
|
|
return -EIO;
|
|
|
|
|
|
|
|
|
|
return __poke_user(child, addr, data);
|
|
|
|
|
}
|
|
|
|
|
|
2010-10-27 22:33:47 +00:00
|
|
|
long arch_ptrace(struct task_struct *child, long request,
|
|
|
|
|
unsigned long addr, unsigned long data)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
|
ptrace_area parea;
|
|
|
|
|
int copied, ret;
|
|
|
|
|
|
|
|
|
|
switch (request) {
|
|
|
|
|
case PTRACE_PEEKUSR:
|
|
|
|
|
/* read the word at location addr in the USER area. */
|
|
|
|
|
return peek_user(child, addr, data);
|
|
|
|
|
|
|
|
|
|
case PTRACE_POKEUSR:
|
|
|
|
|
/* write the word at location addr in the USER area */
|
|
|
|
|
return poke_user(child, addr, data);
|
|
|
|
|
|
|
|
|
|
case PTRACE_PEEKUSR_AREA:
|
|
|
|
|
case PTRACE_POKEUSR_AREA:
|
2007-02-05 20:16:47 +00:00
|
|
|
if (copy_from_user(&parea, (void __force __user *) addr,
|
2005-04-16 22:20:36 +00:00
|
|
|
sizeof(parea)))
|
|
|
|
|
return -EFAULT;
|
|
|
|
|
addr = parea.kernel_addr;
|
|
|
|
|
data = parea.process_addr;
|
|
|
|
|
copied = 0;
|
|
|
|
|
while (copied < parea.len) {
|
|
|
|
|
if (request == PTRACE_PEEKUSR_AREA)
|
|
|
|
|
ret = peek_user(child, addr, data);
|
|
|
|
|
else {
|
2007-02-05 20:16:47 +00:00
|
|
|
addr_t utmp;
|
|
|
|
|
if (get_user(utmp,
|
|
|
|
|
(addr_t __force __user *) data))
|
2005-04-16 22:20:36 +00:00
|
|
|
return -EFAULT;
|
2007-02-05 20:16:47 +00:00
|
|
|
ret = poke_user(child, addr, utmp);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
if (ret)
|
|
|
|
|
return ret;
|
|
|
|
|
addr += sizeof(unsigned long);
|
|
|
|
|
data += sizeof(unsigned long);
|
|
|
|
|
copied += sizeof(unsigned long);
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
2010-05-17 08:00:05 +00:00
|
|
|
case PTRACE_GET_LAST_BREAK:
|
2016-11-08 11:33:38 +00:00
|
|
|
put_user(child->thread.last_break,
|
2010-05-17 08:00:05 +00:00
|
|
|
(unsigned long __user *) data);
|
|
|
|
|
return 0;
|
2012-07-31 09:03:04 +00:00
|
|
|
case PTRACE_ENABLE_TE:
|
|
|
|
|
if (!MACHINE_HAS_TE)
|
|
|
|
|
return -EIO;
|
|
|
|
|
child->thread.per_flags &= ~PER_FLAG_NO_TE;
|
|
|
|
|
return 0;
|
|
|
|
|
case PTRACE_DISABLE_TE:
|
|
|
|
|
if (!MACHINE_HAS_TE)
|
|
|
|
|
return -EIO;
|
|
|
|
|
child->thread.per_flags |= PER_FLAG_NO_TE;
|
2013-07-02 20:58:26 +00:00
|
|
|
child->thread.per_flags &= ~PER_FLAG_TE_ABORT_RAND;
|
|
|
|
|
return 0;
|
|
|
|
|
case PTRACE_TE_ABORT_RAND:
|
|
|
|
|
if (!MACHINE_HAS_TE || (child->thread.per_flags & PER_FLAG_NO_TE))
|
|
|
|
|
return -EIO;
|
|
|
|
|
switch (data) {
|
|
|
|
|
case 0UL:
|
|
|
|
|
child->thread.per_flags &= ~PER_FLAG_TE_ABORT_RAND;
|
|
|
|
|
break;
|
|
|
|
|
case 1UL:
|
|
|
|
|
child->thread.per_flags |= PER_FLAG_TE_ABORT_RAND;
|
|
|
|
|
child->thread.per_flags |= PER_FLAG_TE_ABORT_RAND_TEND;
|
|
|
|
|
break;
|
|
|
|
|
case 2UL:
|
|
|
|
|
child->thread.per_flags |= PER_FLAG_TE_ABORT_RAND;
|
|
|
|
|
child->thread.per_flags &= ~PER_FLAG_TE_ABORT_RAND_TEND;
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
}
|
2012-07-31 09:03:04 +00:00
|
|
|
return 0;
|
2009-09-22 20:58:48 +00:00
|
|
|
default:
|
|
|
|
|
return ptrace_request(child, request, addr, data);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2006-01-06 08:19:28 +00:00
|
|
|
#ifdef CONFIG_COMPAT
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
|
* Now the fun part starts... a 31 bit program running in the
|
|
|
|
|
* 31 bit emulation tracing another program. PTRACE_PEEKTEXT,
|
|
|
|
|
* PTRACE_PEEKDATA, PTRACE_POKETEXT and PTRACE_POKEDATA are easy
|
|
|
|
|
* to handle, the difference to the 64 bit versions of the requests
|
|
|
|
|
* is that the access is done in multiples of 4 byte instead of
|
|
|
|
|
* 8 bytes (sizeof(unsigned long) on 31/64 bit).
|
|
|
|
|
* The ugly part are PTRACE_PEEKUSR, PTRACE_PEEKUSR_AREA,
|
|
|
|
|
* PTRACE_POKEUSR and PTRACE_POKEUSR_AREA. If the traced program
|
|
|
|
|
* is a 31 bit program too, the content of struct user can be
|
|
|
|
|
* emulated. A 31 bit program peeking into the struct user of
|
|
|
|
|
* a 64 bit program is a no-no.
|
|
|
|
|
*/
|
|
|
|
|
|
2011-01-05 11:48:10 +00:00
|
|
|
/*
|
|
|
|
|
* Same as peek_user_per but for a 31 bit program.
|
|
|
|
|
*/
|
|
|
|
|
static inline __u32 __peek_user_per_compat(struct task_struct *child,
|
|
|
|
|
addr_t addr)
|
|
|
|
|
{
|
|
|
|
|
struct compat_per_struct_kernel *dummy32 = NULL;
|
|
|
|
|
|
|
|
|
|
if (addr == (addr_t) &dummy32->cr9)
|
|
|
|
|
/* Control bits of the active per set. */
|
|
|
|
|
return (__u32) test_thread_flag(TIF_SINGLE_STEP) ?
|
|
|
|
|
PER_EVENT_IFETCH : child->thread.per_user.control;
|
|
|
|
|
else if (addr == (addr_t) &dummy32->cr10)
|
|
|
|
|
/* Start address of the active per set. */
|
|
|
|
|
return (__u32) test_thread_flag(TIF_SINGLE_STEP) ?
|
|
|
|
|
0 : child->thread.per_user.start;
|
|
|
|
|
else if (addr == (addr_t) &dummy32->cr11)
|
|
|
|
|
/* End address of the active per set. */
|
|
|
|
|
return test_thread_flag(TIF_SINGLE_STEP) ?
|
|
|
|
|
PSW32_ADDR_INSN : child->thread.per_user.end;
|
|
|
|
|
else if (addr == (addr_t) &dummy32->bits)
|
|
|
|
|
/* Single-step bit. */
|
|
|
|
|
return (__u32) test_thread_flag(TIF_SINGLE_STEP) ?
|
|
|
|
|
0x80000000 : 0;
|
|
|
|
|
else if (addr == (addr_t) &dummy32->starting_addr)
|
|
|
|
|
/* Start address of the user specified per set. */
|
|
|
|
|
return (__u32) child->thread.per_user.start;
|
|
|
|
|
else if (addr == (addr_t) &dummy32->ending_addr)
|
|
|
|
|
/* End address of the user specified per set. */
|
|
|
|
|
return (__u32) child->thread.per_user.end;
|
|
|
|
|
else if (addr == (addr_t) &dummy32->perc_atmid)
|
|
|
|
|
/* PER code, ATMID and AI of the last PER trap */
|
|
|
|
|
return (__u32) child->thread.per_event.cause << 16;
|
|
|
|
|
else if (addr == (addr_t) &dummy32->address)
|
|
|
|
|
/* Address of the last PER trap */
|
|
|
|
|
return (__u32) child->thread.per_event.address;
|
|
|
|
|
else if (addr == (addr_t) &dummy32->access_id)
|
|
|
|
|
/* Access id of the last PER trap */
|
|
|
|
|
return (__u32) child->thread.per_event.paid << 24;
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
|
* Same as peek_user but for a 31 bit program.
|
|
|
|
|
*/
|
2008-07-14 07:58:54 +00:00
|
|
|
static u32 __peek_user_compat(struct task_struct *child, addr_t addr)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2011-01-05 11:48:10 +00:00
|
|
|
struct compat_user *dummy32 = NULL;
|
2005-04-16 22:20:36 +00:00
|
|
|
addr_t offset;
|
|
|
|
|
__u32 tmp;
|
|
|
|
|
|
|
|
|
|
if (addr < (addr_t) &dummy32->regs.acrs) {
|
2011-10-30 14:16:50 +00:00
|
|
|
struct pt_regs *regs = task_pt_regs(child);
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
|
* psw and gprs are stored on the stack
|
|
|
|
|
*/
|
|
|
|
|
if (addr == (addr_t) &dummy32->regs.psw.mask) {
|
|
|
|
|
/* Fake a 31 bit psw mask. */
|
2011-10-30 14:16:50 +00:00
|
|
|
tmp = (__u32)(regs->psw.mask >> 32);
|
2013-10-16 07:58:01 +00:00
|
|
|
tmp &= PSW32_MASK_USER | PSW32_MASK_RI;
|
2013-10-16 12:17:29 +00:00
|
|
|
tmp |= PSW32_USER_BITS;
|
2005-04-16 22:20:36 +00:00
|
|
|
} else if (addr == (addr_t) &dummy32->regs.psw.addr) {
|
|
|
|
|
/* Fake a 31 bit psw address. */
|
2011-10-30 14:16:51 +00:00
|
|
|
tmp = (__u32) regs->psw.addr |
|
|
|
|
|
(__u32)(regs->psw.mask & PSW_MASK_BA);
|
2005-04-16 22:20:36 +00:00
|
|
|
} else {
|
|
|
|
|
/* gpr 0-15 */
|
2011-10-30 14:16:50 +00:00
|
|
|
tmp = *(__u32 *)((addr_t) ®s->psw + addr*2 + 4);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
} else if (addr < (addr_t) (&dummy32->regs.orig_gpr2)) {
|
|
|
|
|
/*
|
|
|
|
|
* access registers are stored in the thread structure
|
|
|
|
|
*/
|
|
|
|
|
offset = addr - (addr_t) &dummy32->regs.acrs;
|
|
|
|
|
tmp = *(__u32*)((addr_t) &child->thread.acrs + offset);
|
|
|
|
|
|
|
|
|
|
} else if (addr == (addr_t) (&dummy32->regs.orig_gpr2)) {
|
|
|
|
|
/*
|
|
|
|
|
* orig_gpr2 is stored on the kernel stack
|
|
|
|
|
*/
|
2006-01-12 09:05:49 +00:00
|
|
|
tmp = *(__u32*)((addr_t) &task_pt_regs(child)->orig_gpr2 + 4);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
[S390] CVE-2008-1514: prevent ptrace padding area read/write in 31-bit mode
When running a 31-bit ptrace, on either an s390 or s390x kernel,
reads and writes into a padding area in struct user_regs_struct32
will result in a kernel panic.
This is also known as CVE-2008-1514.
Test case available here:
http://sources.redhat.com/cgi-bin/cvsweb.cgi/~checkout~/tests/ptrace-tests/tests/user-area-padding.c?cvsroot=systemtap
Steps to reproduce:
1) wget the above
2) gcc -o user-area-padding-31bit user-area-padding.c -Wall -ggdb2 -D_GNU_SOURCE -m31
3) ./user-area-padding-31bit
<panic>
Test status
-----------
Without patch, both s390 and s390x kernels panic. With patch, the test case,
as well as the gdb testsuite, pass without incident, padding area reads
returning zero, writes ignored.
Nb: original version returned -EINVAL on write attempts, which broke the
gdb test and made the test case slightly unhappy, Jan Kratochvil suggested
the change to return 0 on write attempts.
Signed-off-by: Jarod Wilson <jarod@redhat.com>
Tested-by: Jan Kratochvil <jan.kratochvil@redhat.com>
Signed-off-by: Martin Schwidefsky <schwidefsky@de.ibm.com>
2008-09-09 10:38:56 +00:00
|
|
|
} else if (addr < (addr_t) &dummy32->regs.fp_regs) {
|
|
|
|
|
/*
|
|
|
|
|
* prevent reads of padding hole between
|
|
|
|
|
* orig_gpr2 and fp_regs on s390.
|
|
|
|
|
*/
|
|
|
|
|
tmp = 0;
|
|
|
|
|
|
2014-11-14 15:37:47 +00:00
|
|
|
} else if (addr == (addr_t) &dummy32->regs.fp_regs.fpc) {
|
|
|
|
|
/*
|
|
|
|
|
* floating point control reg. is in the thread structure
|
|
|
|
|
*/
|
2015-06-11 13:33:54 +00:00
|
|
|
tmp = child->thread.fpu.fpc;
|
2014-11-14 15:37:47 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
} else if (addr < (addr_t) (&dummy32->regs.fp_regs + 1)) {
|
|
|
|
|
/*
|
2015-06-11 13:33:54 +00:00
|
|
|
* floating point regs. are either in child->thread.fpu
|
|
|
|
|
* or the child->thread.fpu.vxrs array
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2014-11-14 15:37:47 +00:00
|
|
|
offset = addr - (addr_t) &dummy32->regs.fp_regs.fprs;
|
2015-09-29 08:04:41 +00:00
|
|
|
if (MACHINE_HAS_VX)
|
2014-11-14 15:37:47 +00:00
|
|
|
tmp = *(__u32 *)
|
2015-06-11 13:33:54 +00:00
|
|
|
((addr_t) child->thread.fpu.vxrs + 2*offset);
|
2014-11-14 15:37:47 +00:00
|
|
|
else
|
|
|
|
|
tmp = *(__u32 *)
|
2015-10-27 12:13:38 +00:00
|
|
|
((addr_t) child->thread.fpu.fprs + offset);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
} else if (addr < (addr_t) (&dummy32->regs.per_info + 1)) {
|
|
|
|
|
/*
|
2011-01-05 11:48:10 +00:00
|
|
|
* Handle access to the per_info structure.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2011-01-05 11:48:10 +00:00
|
|
|
addr -= (addr_t) &dummy32->regs.per_info;
|
|
|
|
|
tmp = __peek_user_per_compat(child, addr);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
} else
|
|
|
|
|
tmp = 0;
|
|
|
|
|
|
2008-07-14 07:58:54 +00:00
|
|
|
return tmp;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int peek_user_compat(struct task_struct *child,
|
|
|
|
|
addr_t addr, addr_t data)
|
|
|
|
|
{
|
|
|
|
|
__u32 tmp;
|
|
|
|
|
|
2009-06-12 08:26:25 +00:00
|
|
|
if (!is_compat_task() || (addr & 3) || addr > sizeof(struct user) - 3)
|
2008-07-14 07:58:54 +00:00
|
|
|
return -EIO;
|
|
|
|
|
|
|
|
|
|
tmp = __peek_user_compat(child, addr);
|
2005-04-16 22:20:36 +00:00
|
|
|
return put_user(tmp, (__u32 __user *) data);
|
|
|
|
|
}
|
|
|
|
|
|
2011-01-05 11:48:10 +00:00
|
|
|
/*
|
|
|
|
|
* Same as poke_user_per but for a 31 bit program.
|
|
|
|
|
*/
|
|
|
|
|
static inline void __poke_user_per_compat(struct task_struct *child,
|
|
|
|
|
addr_t addr, __u32 data)
|
|
|
|
|
{
|
|
|
|
|
struct compat_per_struct_kernel *dummy32 = NULL;
|
|
|
|
|
|
|
|
|
|
if (addr == (addr_t) &dummy32->cr9)
|
|
|
|
|
/* PER event mask of the user specified per set. */
|
|
|
|
|
child->thread.per_user.control =
|
|
|
|
|
data & (PER_EVENT_MASK | PER_CONTROL_MASK);
|
|
|
|
|
else if (addr == (addr_t) &dummy32->starting_addr)
|
|
|
|
|
/* Starting address of the user specified per set. */
|
|
|
|
|
child->thread.per_user.start = data;
|
|
|
|
|
else if (addr == (addr_t) &dummy32->ending_addr)
|
|
|
|
|
/* Ending address of the user specified per set. */
|
|
|
|
|
child->thread.per_user.end = data;
|
|
|
|
|
}
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
|
* Same as poke_user but for a 31 bit program.
|
|
|
|
|
*/
|
2008-07-14 07:58:54 +00:00
|
|
|
static int __poke_user_compat(struct task_struct *child,
|
|
|
|
|
addr_t addr, addr_t data)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2011-01-05 11:48:10 +00:00
|
|
|
struct compat_user *dummy32 = NULL;
|
2008-07-14 07:58:54 +00:00
|
|
|
__u32 tmp = (__u32) data;
|
2005-04-16 22:20:36 +00:00
|
|
|
addr_t offset;
|
|
|
|
|
|
|
|
|
|
if (addr < (addr_t) &dummy32->regs.acrs) {
|
2011-10-30 14:16:50 +00:00
|
|
|
struct pt_regs *regs = task_pt_regs(child);
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
|
* psw, gprs, acrs and orig_gpr2 are stored on the stack
|
|
|
|
|
*/
|
|
|
|
|
if (addr == (addr_t) &dummy32->regs.psw.mask) {
|
2013-10-16 07:58:01 +00:00
|
|
|
__u32 mask = PSW32_MASK_USER;
|
|
|
|
|
|
|
|
|
|
mask |= is_ri_task(child) ? PSW32_MASK_RI : 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
/* Build a 64 bit psw mask from 31 bit mask. */
|
2014-06-23 13:29:40 +00:00
|
|
|
if ((tmp ^ PSW32_USER_BITS) & ~mask)
|
2005-04-16 22:20:36 +00:00
|
|
|
/* Invalid psw mask. */
|
|
|
|
|
return -EINVAL;
|
2014-06-23 13:29:40 +00:00
|
|
|
if ((data & PSW32_MASK_ASC) == PSW32_ASC_HOME)
|
|
|
|
|
/* Invalid address-space-control bits */
|
|
|
|
|
return -EINVAL;
|
2011-10-30 14:16:50 +00:00
|
|
|
regs->psw.mask = (regs->psw.mask & ~PSW_MASK_USER) |
|
2011-10-30 14:16:51 +00:00
|
|
|
(regs->psw.mask & PSW_MASK_BA) |
|
2013-10-16 07:58:01 +00:00
|
|
|
(__u64)(tmp & mask) << 32;
|
2005-04-16 22:20:36 +00:00
|
|
|
} else if (addr == (addr_t) &dummy32->regs.psw.addr) {
|
|
|
|
|
/* Build a 64 bit psw address from 31 bit address. */
|
2011-10-30 14:16:50 +00:00
|
|
|
regs->psw.addr = (__u64) tmp & PSW32_ADDR_INSN;
|
2011-10-30 14:16:51 +00:00
|
|
|
/* Transfer 31 bit amode bit to psw mask. */
|
|
|
|
|
regs->psw.mask = (regs->psw.mask & ~PSW_MASK_BA) |
|
|
|
|
|
(__u64)(tmp & PSW32_ADDR_AMODE);
|
2005-04-16 22:20:36 +00:00
|
|
|
} else {
|
|
|
|
|
/* gpr 0-15 */
|
2011-10-30 14:16:50 +00:00
|
|
|
*(__u32*)((addr_t) ®s->psw + addr*2 + 4) = tmp;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
} else if (addr < (addr_t) (&dummy32->regs.orig_gpr2)) {
|
|
|
|
|
/*
|
|
|
|
|
* access registers are stored in the thread structure
|
|
|
|
|
*/
|
|
|
|
|
offset = addr - (addr_t) &dummy32->regs.acrs;
|
|
|
|
|
*(__u32*)((addr_t) &child->thread.acrs + offset) = tmp;
|
|
|
|
|
|
|
|
|
|
} else if (addr == (addr_t) (&dummy32->regs.orig_gpr2)) {
|
|
|
|
|
/*
|
|
|
|
|
* orig_gpr2 is stored on the kernel stack
|
|
|
|
|
*/
|
2006-01-12 09:05:49 +00:00
|
|
|
*(__u32*)((addr_t) &task_pt_regs(child)->orig_gpr2 + 4) = tmp;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
[S390] CVE-2008-1514: prevent ptrace padding area read/write in 31-bit mode
When running a 31-bit ptrace, on either an s390 or s390x kernel,
reads and writes into a padding area in struct user_regs_struct32
will result in a kernel panic.
This is also known as CVE-2008-1514.
Test case available here:
http://sources.redhat.com/cgi-bin/cvsweb.cgi/~checkout~/tests/ptrace-tests/tests/user-area-padding.c?cvsroot=systemtap
Steps to reproduce:
1) wget the above
2) gcc -o user-area-padding-31bit user-area-padding.c -Wall -ggdb2 -D_GNU_SOURCE -m31
3) ./user-area-padding-31bit
<panic>
Test status
-----------
Without patch, both s390 and s390x kernels panic. With patch, the test case,
as well as the gdb testsuite, pass without incident, padding area reads
returning zero, writes ignored.
Nb: original version returned -EINVAL on write attempts, which broke the
gdb test and made the test case slightly unhappy, Jan Kratochvil suggested
the change to return 0 on write attempts.
Signed-off-by: Jarod Wilson <jarod@redhat.com>
Tested-by: Jan Kratochvil <jan.kratochvil@redhat.com>
Signed-off-by: Martin Schwidefsky <schwidefsky@de.ibm.com>
2008-09-09 10:38:56 +00:00
|
|
|
} else if (addr < (addr_t) &dummy32->regs.fp_regs) {
|
|
|
|
|
/*
|
|
|
|
|
* prevent writess of padding hole between
|
|
|
|
|
* orig_gpr2 and fp_regs on s390.
|
|
|
|
|
*/
|
|
|
|
|
return 0;
|
|
|
|
|
|
2014-11-14 15:37:47 +00:00
|
|
|
} else if (addr == (addr_t) &dummy32->regs.fp_regs.fpc) {
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
2014-11-14 15:37:47 +00:00
|
|
|
* floating point control reg. is in the thread structure
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2014-11-14 15:37:47 +00:00
|
|
|
if (test_fp_ctl(tmp))
|
2005-04-16 22:20:36 +00:00
|
|
|
return -EINVAL;
|
2015-06-11 13:33:54 +00:00
|
|
|
child->thread.fpu.fpc = data;
|
2014-11-14 15:37:47 +00:00
|
|
|
|
|
|
|
|
} else if (addr < (addr_t) (&dummy32->regs.fp_regs + 1)) {
|
|
|
|
|
/*
|
2015-06-11 13:33:54 +00:00
|
|
|
* floating point regs. are either in child->thread.fpu
|
|
|
|
|
* or the child->thread.fpu.vxrs array
|
2014-11-14 15:37:47 +00:00
|
|
|
*/
|
|
|
|
|
offset = addr - (addr_t) &dummy32->regs.fp_regs.fprs;
|
2015-09-29 08:04:41 +00:00
|
|
|
if (MACHINE_HAS_VX)
|
2014-11-14 15:37:47 +00:00
|
|
|
*(__u32 *)((addr_t)
|
2015-06-11 13:33:54 +00:00
|
|
|
child->thread.fpu.vxrs + 2*offset) = tmp;
|
2014-11-14 15:37:47 +00:00
|
|
|
else
|
|
|
|
|
*(__u32 *)((addr_t)
|
2015-10-27 12:13:38 +00:00
|
|
|
child->thread.fpu.fprs + offset) = tmp;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
} else if (addr < (addr_t) (&dummy32->regs.per_info + 1)) {
|
|
|
|
|
/*
|
2011-01-05 11:48:10 +00:00
|
|
|
* Handle access to the per_info structure.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2011-01-05 11:48:10 +00:00
|
|
|
addr -= (addr_t) &dummy32->regs.per_info;
|
|
|
|
|
__poke_user_per_compat(child, addr, data);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2008-07-14 07:58:54 +00:00
|
|
|
static int poke_user_compat(struct task_struct *child,
|
|
|
|
|
addr_t addr, addr_t data)
|
|
|
|
|
{
|
2011-01-05 11:48:10 +00:00
|
|
|
if (!is_compat_task() || (addr & 3) ||
|
|
|
|
|
addr > sizeof(struct compat_user) - 3)
|
2008-07-14 07:58:54 +00:00
|
|
|
return -EIO;
|
|
|
|
|
|
|
|
|
|
return __poke_user_compat(child, addr, data);
|
|
|
|
|
}
|
|
|
|
|
|
2008-05-07 07:22:57 +00:00
|
|
|
long compat_arch_ptrace(struct task_struct *child, compat_long_t request,
|
|
|
|
|
compat_ulong_t caddr, compat_ulong_t cdata)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2008-05-07 07:22:57 +00:00
|
|
|
unsigned long addr = caddr;
|
|
|
|
|
unsigned long data = cdata;
|
2011-01-05 11:48:10 +00:00
|
|
|
compat_ptrace_area parea;
|
2005-04-16 22:20:36 +00:00
|
|
|
int copied, ret;
|
|
|
|
|
|
|
|
|
|
switch (request) {
|
|
|
|
|
case PTRACE_PEEKUSR:
|
|
|
|
|
/* read the word at location addr in the USER area. */
|
2008-07-14 07:58:54 +00:00
|
|
|
return peek_user_compat(child, addr, data);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
case PTRACE_POKEUSR:
|
|
|
|
|
/* write the word at location addr in the USER area */
|
2008-07-14 07:58:54 +00:00
|
|
|
return poke_user_compat(child, addr, data);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
case PTRACE_PEEKUSR_AREA:
|
|
|
|
|
case PTRACE_POKEUSR_AREA:
|
2007-02-05 20:16:47 +00:00
|
|
|
if (copy_from_user(&parea, (void __force __user *) addr,
|
2005-04-16 22:20:36 +00:00
|
|
|
sizeof(parea)))
|
|
|
|
|
return -EFAULT;
|
|
|
|
|
addr = parea.kernel_addr;
|
|
|
|
|
data = parea.process_addr;
|
|
|
|
|
copied = 0;
|
|
|
|
|
while (copied < parea.len) {
|
|
|
|
|
if (request == PTRACE_PEEKUSR_AREA)
|
2008-07-14 07:58:54 +00:00
|
|
|
ret = peek_user_compat(child, addr, data);
|
2005-04-16 22:20:36 +00:00
|
|
|
else {
|
2007-02-05 20:16:47 +00:00
|
|
|
__u32 utmp;
|
|
|
|
|
if (get_user(utmp,
|
|
|
|
|
(__u32 __force __user *) data))
|
2005-04-16 22:20:36 +00:00
|
|
|
return -EFAULT;
|
2008-07-14 07:58:54 +00:00
|
|
|
ret = poke_user_compat(child, addr, utmp);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
if (ret)
|
|
|
|
|
return ret;
|
|
|
|
|
addr += sizeof(unsigned int);
|
|
|
|
|
data += sizeof(unsigned int);
|
|
|
|
|
copied += sizeof(unsigned int);
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
2010-05-17 08:00:05 +00:00
|
|
|
case PTRACE_GET_LAST_BREAK:
|
2016-11-08 11:33:38 +00:00
|
|
|
put_user(child->thread.last_break,
|
2010-05-17 08:00:05 +00:00
|
|
|
(unsigned int __user *) data);
|
|
|
|
|
return 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2008-05-07 07:22:57 +00:00
|
|
|
return compat_ptrace_request(child, request, addr, data);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
2008-10-10 19:33:20 +00:00
|
|
|
asmlinkage long do_syscall_trace_enter(struct pt_regs *regs)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2016-06-22 20:40:07 +00:00
|
|
|
unsigned long mask = -1UL;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
[PATCH] s390: uml ptrace fixes
To make UML build and run on s390, I needed to do these two little
changes:
1) UML includes some of the subarch's (s390) headers. I had to
change one of them with the following one-liner, to make this
compile. AFAICS, this change doesn't break compilation of s390
itself.
2) UML needs to intercept syscalls via ptrace to invalidate the syscall,
read syscall's parameters and write the result with the result of
UML's syscall processing. Also, UML needs to make sure, that the host
does no syscall restart processing. On i386 for example, this can be
done by writing -1 to orig_eax on the 2nd syscall interception
(orig_eax is the syscall number, which after the interception is used
as a "interrupt was a syscall" flag only.
Unfortunately, s390 holds syscall number and syscall result in gpr2 and
its "interrupt was a syscall" flag (trap) is unreachable via ptrace.
So I changed the host to set trap to -1, if the syscall number is changed
to an invalid value on the first syscall interception.
Signed-off-by: Martin Schwidefsky <schwidefsky@de.ibm.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-04 22:43:32 +00:00
|
|
|
/*
|
2008-10-10 19:33:20 +00:00
|
|
|
* The sysc_tracesys code in entry.S stored the system
|
|
|
|
|
* call number to gprs[2].
|
[PATCH] s390: uml ptrace fixes
To make UML build and run on s390, I needed to do these two little
changes:
1) UML includes some of the subarch's (s390) headers. I had to
change one of them with the following one-liner, to make this
compile. AFAICS, this change doesn't break compilation of s390
itself.
2) UML needs to intercept syscalls via ptrace to invalidate the syscall,
read syscall's parameters and write the result with the result of
UML's syscall processing. Also, UML needs to make sure, that the host
does no syscall restart processing. On i386 for example, this can be
done by writing -1 to orig_eax on the 2nd syscall interception
(orig_eax is the syscall number, which after the interception is used
as a "interrupt was a syscall" flag only.
Unfortunately, s390 holds syscall number and syscall result in gpr2 and
its "interrupt was a syscall" flag (trap) is unreachable via ptrace.
So I changed the host to set trap to -1, if the syscall number is changed
to an invalid value on the first syscall interception.
Signed-off-by: Martin Schwidefsky <schwidefsky@de.ibm.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-04 22:43:32 +00:00
|
|
|
*/
|
2008-10-10 19:33:20 +00:00
|
|
|
if (test_thread_flag(TIF_SYSCALL_TRACE) &&
|
|
|
|
|
(tracehook_report_syscall_entry(regs) ||
|
|
|
|
|
regs->gprs[2] >= NR_syscalls)) {
|
|
|
|
|
/*
|
|
|
|
|
* Tracing decided this syscall should not happen or the
|
|
|
|
|
* debugger stored an invalid system call number. Skip
|
|
|
|
|
* the system call and the system call restart handling.
|
|
|
|
|
*/
|
2014-04-15 10:55:07 +00:00
|
|
|
clear_pt_regs_flag(regs, PIF_SYSCALL);
|
2016-06-02 20:19:36 +00:00
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Do the secure computing check after ptrace. */
|
|
|
|
|
if (secure_computing(NULL)) {
|
|
|
|
|
/* seccomp failures shouldn't expose any additional code. */
|
|
|
|
|
return -1;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2008-10-10 19:33:20 +00:00
|
|
|
|
2009-08-24 21:43:11 +00:00
|
|
|
if (unlikely(test_thread_flag(TIF_SYSCALL_TRACEPOINT)))
|
2009-08-24 21:43:14 +00:00
|
|
|
trace_sys_enter(regs, regs->gprs[2]);
|
2009-06-12 08:26:47 +00:00
|
|
|
|
2016-06-22 20:40:07 +00:00
|
|
|
if (is_compat_task())
|
|
|
|
|
mask = 0xffffffff;
|
|
|
|
|
|
|
|
|
|
audit_syscall_entry(regs->gprs[2], regs->orig_gpr2 & mask,
|
2016-07-30 00:54:17 +00:00
|
|
|
regs->gprs[3] &mask, regs->gprs[4] &mask,
|
|
|
|
|
regs->gprs[5] &mask);
|
2016-06-02 20:19:36 +00:00
|
|
|
|
|
|
|
|
return regs->gprs[2];
|
2008-10-10 19:33:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
asmlinkage void do_syscall_trace_exit(struct pt_regs *regs)
|
|
|
|
|
{
|
2012-01-03 19:23:06 +00:00
|
|
|
audit_syscall_exit(regs);
|
2008-10-10 19:33:20 +00:00
|
|
|
|
2009-08-24 21:43:11 +00:00
|
|
|
if (unlikely(test_thread_flag(TIF_SYSCALL_TRACEPOINT)))
|
2009-08-24 21:43:14 +00:00
|
|
|
trace_sys_exit(regs, regs->gprs[2]);
|
2009-06-12 08:26:47 +00:00
|
|
|
|
2008-10-10 19:33:20 +00:00
|
|
|
if (test_thread_flag(TIF_SYSCALL_TRACE))
|
|
|
|
|
tracehook_report_syscall_exit(regs, 0);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2008-07-14 07:58:54 +00:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* user_regset definitions.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
static int s390_regs_get(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
void *kbuf, void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
if (target == current)
|
|
|
|
|
save_access_regs(target->thread.acrs);
|
|
|
|
|
|
|
|
|
|
if (kbuf) {
|
|
|
|
|
unsigned long *k = kbuf;
|
|
|
|
|
while (count > 0) {
|
|
|
|
|
*k++ = __peek_user(target, pos);
|
|
|
|
|
count -= sizeof(*k);
|
|
|
|
|
pos += sizeof(*k);
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
unsigned long __user *u = ubuf;
|
|
|
|
|
while (count > 0) {
|
|
|
|
|
if (__put_user(__peek_user(target, pos), u++))
|
|
|
|
|
return -EFAULT;
|
|
|
|
|
count -= sizeof(*u);
|
|
|
|
|
pos += sizeof(*u);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int s390_regs_set(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
const void *kbuf, const void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
int rc = 0;
|
|
|
|
|
|
|
|
|
|
if (target == current)
|
|
|
|
|
save_access_regs(target->thread.acrs);
|
|
|
|
|
|
|
|
|
|
if (kbuf) {
|
|
|
|
|
const unsigned long *k = kbuf;
|
|
|
|
|
while (count > 0 && !rc) {
|
|
|
|
|
rc = __poke_user(target, pos, *k++);
|
|
|
|
|
count -= sizeof(*k);
|
|
|
|
|
pos += sizeof(*k);
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
const unsigned long __user *u = ubuf;
|
|
|
|
|
while (count > 0 && !rc) {
|
|
|
|
|
unsigned long word;
|
|
|
|
|
rc = __get_user(word, u++);
|
|
|
|
|
if (rc)
|
|
|
|
|
break;
|
|
|
|
|
rc = __poke_user(target, pos, word);
|
|
|
|
|
count -= sizeof(*u);
|
|
|
|
|
pos += sizeof(*u);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (rc == 0 && target == current)
|
|
|
|
|
restore_access_regs(target->thread.acrs);
|
|
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int s390_fpregs_get(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset, unsigned int pos,
|
|
|
|
|
unsigned int count, void *kbuf, void __user *ubuf)
|
|
|
|
|
{
|
2015-06-11 13:33:54 +00:00
|
|
|
_s390_fp_regs fp_regs;
|
|
|
|
|
|
|
|
|
|
if (target == current)
|
2015-06-29 14:43:06 +00:00
|
|
|
save_fpu_regs();
|
2015-06-11 13:33:54 +00:00
|
|
|
|
|
|
|
|
fp_regs.fpc = target->thread.fpu.fpc;
|
|
|
|
|
fpregs_store(&fp_regs, &target->thread.fpu);
|
2008-07-14 07:58:54 +00:00
|
|
|
|
|
|
|
|
return user_regset_copyout(&pos, &count, &kbuf, &ubuf,
|
2015-06-11 13:33:54 +00:00
|
|
|
&fp_regs, 0, -1);
|
2008-07-14 07:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int s390_fpregs_set(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset, unsigned int pos,
|
|
|
|
|
unsigned int count, const void *kbuf,
|
|
|
|
|
const void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
int rc = 0;
|
2015-06-11 13:33:54 +00:00
|
|
|
freg_t fprs[__NUM_FPRS];
|
2008-07-14 07:58:54 +00:00
|
|
|
|
2015-06-11 13:33:54 +00:00
|
|
|
if (target == current)
|
2015-06-29 14:43:06 +00:00
|
|
|
save_fpu_regs();
|
2008-07-14 07:58:54 +00:00
|
|
|
|
2017-01-24 07:05:52 +00:00
|
|
|
if (MACHINE_HAS_VX)
|
|
|
|
|
convert_vx_to_fp(fprs, target->thread.fpu.vxrs);
|
|
|
|
|
else
|
|
|
|
|
memcpy(&fprs, target->thread.fpu.fprs, sizeof(fprs));
|
|
|
|
|
|
2008-07-14 07:58:54 +00:00
|
|
|
/* If setting FPC, must validate it first. */
|
|
|
|
|
if (count > 0 && pos < offsetof(s390_fp_regs, fprs)) {
|
2015-06-11 13:33:54 +00:00
|
|
|
u32 ufpc[2] = { target->thread.fpu.fpc, 0 };
|
2013-10-15 14:08:34 +00:00
|
|
|
rc = user_regset_copyin(&pos, &count, &kbuf, &ubuf, &ufpc,
|
2008-07-14 07:58:54 +00:00
|
|
|
0, offsetof(s390_fp_regs, fprs));
|
|
|
|
|
if (rc)
|
|
|
|
|
return rc;
|
2013-10-15 14:08:34 +00:00
|
|
|
if (ufpc[1] != 0 || test_fp_ctl(ufpc[0]))
|
2008-07-14 07:58:54 +00:00
|
|
|
return -EINVAL;
|
2015-06-11 13:33:54 +00:00
|
|
|
target->thread.fpu.fpc = ufpc[0];
|
2008-07-14 07:58:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (rc == 0 && count > 0)
|
|
|
|
|
rc = user_regset_copyin(&pos, &count, &kbuf, &ubuf,
|
2015-06-11 13:33:54 +00:00
|
|
|
fprs, offsetof(s390_fp_regs, fprs), -1);
|
|
|
|
|
if (rc)
|
|
|
|
|
return rc;
|
2008-07-14 07:58:54 +00:00
|
|
|
|
2015-09-29 08:04:41 +00:00
|
|
|
if (MACHINE_HAS_VX)
|
2015-06-11 13:33:54 +00:00
|
|
|
convert_fp_to_vx(target->thread.fpu.vxrs, fprs);
|
|
|
|
|
else
|
|
|
|
|
memcpy(target->thread.fpu.fprs, &fprs, sizeof(fprs));
|
|
|
|
|
|
2008-07-14 07:58:54 +00:00
|
|
|
return rc;
|
|
|
|
|
}
|
|
|
|
|
|
2010-05-17 08:00:05 +00:00
|
|
|
static int s390_last_break_get(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
void *kbuf, void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
if (count > 0) {
|
|
|
|
|
if (kbuf) {
|
|
|
|
|
unsigned long *k = kbuf;
|
2016-11-08 11:33:38 +00:00
|
|
|
*k = target->thread.last_break;
|
2010-05-17 08:00:05 +00:00
|
|
|
} else {
|
|
|
|
|
unsigned long __user *u = ubuf;
|
2016-11-08 11:33:38 +00:00
|
|
|
if (__put_user(target->thread.last_break, u))
|
2010-05-17 08:00:05 +00:00
|
|
|
return -EFAULT;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2011-12-01 12:32:17 +00:00
|
|
|
static int s390_last_break_set(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
const void *kbuf, const void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2012-07-31 09:03:04 +00:00
|
|
|
static int s390_tdb_get(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
void *kbuf, void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
struct pt_regs *regs = task_pt_regs(target);
|
|
|
|
|
unsigned char *data;
|
|
|
|
|
|
|
|
|
|
if (!(regs->int_code & 0x200))
|
|
|
|
|
return -ENODATA;
|
|
|
|
|
data = target->thread.trap_tdb;
|
|
|
|
|
return user_regset_copyout(&pos, &count, &kbuf, &ubuf, data, 0, 256);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int s390_tdb_set(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
const void *kbuf, const void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2014-10-06 15:53:53 +00:00
|
|
|
static int s390_vxrs_low_get(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
void *kbuf, void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
__u64 vxrs[__NUM_VXRS_LOW];
|
|
|
|
|
int i;
|
|
|
|
|
|
2014-12-02 15:07:12 +00:00
|
|
|
if (!MACHINE_HAS_VX)
|
|
|
|
|
return -ENODEV;
|
2015-09-29 08:04:41 +00:00
|
|
|
if (target == current)
|
|
|
|
|
save_fpu_regs();
|
|
|
|
|
for (i = 0; i < __NUM_VXRS_LOW; i++)
|
|
|
|
|
vxrs[i] = *((__u64 *)(target->thread.fpu.vxrs + i) + 1);
|
2014-10-06 15:53:53 +00:00
|
|
|
return user_regset_copyout(&pos, &count, &kbuf, &ubuf, vxrs, 0, -1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int s390_vxrs_low_set(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
const void *kbuf, const void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
__u64 vxrs[__NUM_VXRS_LOW];
|
|
|
|
|
int i, rc;
|
|
|
|
|
|
2014-12-02 15:07:12 +00:00
|
|
|
if (!MACHINE_HAS_VX)
|
|
|
|
|
return -ENODEV;
|
2015-09-29 08:04:41 +00:00
|
|
|
if (target == current)
|
2015-06-29 14:43:06 +00:00
|
|
|
save_fpu_regs();
|
2014-10-06 15:53:53 +00:00
|
|
|
|
2017-01-24 07:05:52 +00:00
|
|
|
for (i = 0; i < __NUM_VXRS_LOW; i++)
|
|
|
|
|
vxrs[i] = *((__u64 *)(target->thread.fpu.vxrs + i) + 1);
|
|
|
|
|
|
2014-10-06 15:53:53 +00:00
|
|
|
rc = user_regset_copyin(&pos, &count, &kbuf, &ubuf, vxrs, 0, -1);
|
s390/kernel: lazy restore fpu registers
Improve the save and restore behavior of FPU register contents to use the
vector extension within the kernel.
The kernel does not use floating-point or vector registers and, therefore,
saving and restoring the FPU register contents are performed for handling
signals or switching processes only. To prepare for using vector
instructions and vector registers within the kernel, enhance the save
behavior and implement a lazy restore at return to user space from a
system call or interrupt.
To implement the lazy restore, the save_fpu_regs() sets a CPU information
flag, CIF_FPU, to indicate that the FPU registers must be restored.
Saving and setting CIF_FPU is performed in an atomic fashion to be
interrupt-safe. When the kernel wants to use the vector extension or
wants to change the FPU register state for a task during signal handling,
the save_fpu_regs() must be called first. The CIF_FPU flag is also set at
process switch. At return to user space, the FPU state is restored. In
particular, the FPU state includes the floating-point or vector register
contents, as well as, vector-enablement and floating-point control. The
FPU state restore and clearing CIF_FPU is also performed in an atomic
fashion.
For KVM, the restore of the FPU register state is performed when restoring
the general-purpose guest registers before the SIE instructions is started.
Because the path towards the SIE instruction is interruptible, the CIF_FPU
flag must be checked again right before going into SIE. If set, the guest
registers must be reloaded again by re-entering the outer SIE loop. This
is the same behavior as if the SIE critical section is interrupted.
Signed-off-by: Hendrik Brueckner <brueckner@linux.vnet.ibm.com>
Signed-off-by: Martin Schwidefsky <schwidefsky@de.ibm.com>
2015-06-10 10:53:42 +00:00
|
|
|
if (rc == 0)
|
2014-10-06 15:53:53 +00:00
|
|
|
for (i = 0; i < __NUM_VXRS_LOW; i++)
|
2015-06-11 13:33:54 +00:00
|
|
|
*((__u64 *)(target->thread.fpu.vxrs + i) + 1) = vxrs[i];
|
2014-10-06 15:53:53 +00:00
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int s390_vxrs_high_get(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
void *kbuf, void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
__vector128 vxrs[__NUM_VXRS_HIGH];
|
|
|
|
|
|
2014-12-02 15:07:12 +00:00
|
|
|
if (!MACHINE_HAS_VX)
|
|
|
|
|
return -ENODEV;
|
2015-09-29 08:04:41 +00:00
|
|
|
if (target == current)
|
|
|
|
|
save_fpu_regs();
|
|
|
|
|
memcpy(vxrs, target->thread.fpu.vxrs + __NUM_VXRS_LOW, sizeof(vxrs));
|
|
|
|
|
|
2014-10-06 15:53:53 +00:00
|
|
|
return user_regset_copyout(&pos, &count, &kbuf, &ubuf, vxrs, 0, -1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int s390_vxrs_high_set(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
const void *kbuf, const void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
int rc;
|
|
|
|
|
|
2014-12-02 15:07:12 +00:00
|
|
|
if (!MACHINE_HAS_VX)
|
|
|
|
|
return -ENODEV;
|
2015-09-29 08:04:41 +00:00
|
|
|
if (target == current)
|
2015-06-29 14:43:06 +00:00
|
|
|
save_fpu_regs();
|
2014-10-06 15:53:53 +00:00
|
|
|
|
|
|
|
|
rc = user_regset_copyin(&pos, &count, &kbuf, &ubuf,
|
2015-06-11 13:33:54 +00:00
|
|
|
target->thread.fpu.vxrs + __NUM_VXRS_LOW, 0, -1);
|
2014-10-06 15:53:53 +00:00
|
|
|
return rc;
|
|
|
|
|
}
|
|
|
|
|
|
2011-10-30 14:16:47 +00:00
|
|
|
static int s390_system_call_get(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
void *kbuf, void __user *ubuf)
|
|
|
|
|
{
|
2016-11-08 10:11:02 +00:00
|
|
|
unsigned int *data = &target->thread.system_call;
|
2011-10-30 14:16:47 +00:00
|
|
|
return user_regset_copyout(&pos, &count, &kbuf, &ubuf,
|
|
|
|
|
data, 0, sizeof(unsigned int));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int s390_system_call_set(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
const void *kbuf, const void __user *ubuf)
|
|
|
|
|
{
|
2016-11-08 10:11:02 +00:00
|
|
|
unsigned int *data = &target->thread.system_call;
|
2011-10-30 14:16:47 +00:00
|
|
|
return user_regset_copyin(&pos, &count, &kbuf, &ubuf,
|
|
|
|
|
data, 0, sizeof(unsigned int));
|
|
|
|
|
}
|
|
|
|
|
|
2016-01-26 13:10:34 +00:00
|
|
|
static int s390_gs_cb_get(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
void *kbuf, void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
struct gs_cb *data = target->thread.gs_cb;
|
|
|
|
|
|
|
|
|
|
if (!MACHINE_HAS_GS)
|
|
|
|
|
return -ENODEV;
|
|
|
|
|
if (!data)
|
|
|
|
|
return -ENODATA;
|
2017-05-19 13:32:09 +00:00
|
|
|
if (target == current)
|
|
|
|
|
save_gs_cb(data);
|
2016-01-26 13:10:34 +00:00
|
|
|
return user_regset_copyout(&pos, &count, &kbuf, &ubuf,
|
|
|
|
|
data, 0, sizeof(struct gs_cb));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int s390_gs_cb_set(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
const void *kbuf, const void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
struct gs_cb *data = target->thread.gs_cb;
|
2017-05-19 13:32:09 +00:00
|
|
|
int rc;
|
2016-01-26 13:10:34 +00:00
|
|
|
|
2017-04-20 11:54:11 +00:00
|
|
|
if (!MACHINE_HAS_GS)
|
|
|
|
|
return -ENODEV;
|
|
|
|
|
if (!data) {
|
|
|
|
|
data = kzalloc(sizeof(*data), GFP_KERNEL);
|
|
|
|
|
if (!data)
|
|
|
|
|
return -ENOMEM;
|
2017-05-19 13:32:09 +00:00
|
|
|
data->gsd = 25;
|
2017-04-20 11:54:11 +00:00
|
|
|
target->thread.gs_cb = data;
|
2017-05-19 13:32:09 +00:00
|
|
|
if (target == current)
|
|
|
|
|
__ctl_set_bit(2, 4);
|
|
|
|
|
} else if (target == current) {
|
|
|
|
|
save_gs_cb(data);
|
2017-04-20 11:54:11 +00:00
|
|
|
}
|
2017-05-19 13:32:09 +00:00
|
|
|
rc = user_regset_copyin(&pos, &count, &kbuf, &ubuf,
|
|
|
|
|
data, 0, sizeof(struct gs_cb));
|
|
|
|
|
if (target == current)
|
|
|
|
|
restore_gs_cb(data);
|
|
|
|
|
return rc;
|
2017-04-20 11:54:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int s390_gs_bc_get(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
void *kbuf, void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
struct gs_cb *data = target->thread.gs_bc_cb;
|
|
|
|
|
|
2016-01-26 13:10:34 +00:00
|
|
|
if (!MACHINE_HAS_GS)
|
|
|
|
|
return -ENODEV;
|
|
|
|
|
if (!data)
|
|
|
|
|
return -ENODATA;
|
2017-04-20 11:54:11 +00:00
|
|
|
return user_regset_copyout(&pos, &count, &kbuf, &ubuf,
|
|
|
|
|
data, 0, sizeof(struct gs_cb));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int s390_gs_bc_set(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
const void *kbuf, const void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
struct gs_cb *data = target->thread.gs_bc_cb;
|
|
|
|
|
|
|
|
|
|
if (!MACHINE_HAS_GS)
|
|
|
|
|
return -ENODEV;
|
|
|
|
|
if (!data) {
|
|
|
|
|
data = kzalloc(sizeof(*data), GFP_KERNEL);
|
|
|
|
|
if (!data)
|
|
|
|
|
return -ENOMEM;
|
|
|
|
|
target->thread.gs_bc_cb = data;
|
|
|
|
|
}
|
2016-01-26 13:10:34 +00:00
|
|
|
return user_regset_copyin(&pos, &count, &kbuf, &ubuf,
|
|
|
|
|
data, 0, sizeof(struct gs_cb));
|
|
|
|
|
}
|
|
|
|
|
|
2008-07-14 07:58:54 +00:00
|
|
|
static const struct user_regset s390_regsets[] = {
|
2014-10-06 15:53:53 +00:00
|
|
|
{
|
2008-07-14 07:58:54 +00:00
|
|
|
.core_note_type = NT_PRSTATUS,
|
|
|
|
|
.n = sizeof(s390_regs) / sizeof(long),
|
|
|
|
|
.size = sizeof(long),
|
|
|
|
|
.align = sizeof(long),
|
|
|
|
|
.get = s390_regs_get,
|
|
|
|
|
.set = s390_regs_set,
|
|
|
|
|
},
|
2014-10-06 15:53:53 +00:00
|
|
|
{
|
2008-07-14 07:58:54 +00:00
|
|
|
.core_note_type = NT_PRFPREG,
|
|
|
|
|
.n = sizeof(s390_fp_regs) / sizeof(long),
|
|
|
|
|
.size = sizeof(long),
|
|
|
|
|
.align = sizeof(long),
|
|
|
|
|
.get = s390_fpregs_get,
|
|
|
|
|
.set = s390_fpregs_set,
|
|
|
|
|
},
|
2014-10-06 15:53:53 +00:00
|
|
|
{
|
|
|
|
|
.core_note_type = NT_S390_SYSTEM_CALL,
|
|
|
|
|
.n = 1,
|
|
|
|
|
.size = sizeof(unsigned int),
|
|
|
|
|
.align = sizeof(unsigned int),
|
|
|
|
|
.get = s390_system_call_get,
|
|
|
|
|
.set = s390_system_call_set,
|
|
|
|
|
},
|
|
|
|
|
{
|
2010-05-17 08:00:05 +00:00
|
|
|
.core_note_type = NT_S390_LAST_BREAK,
|
|
|
|
|
.n = 1,
|
|
|
|
|
.size = sizeof(long),
|
|
|
|
|
.align = sizeof(long),
|
|
|
|
|
.get = s390_last_break_get,
|
2011-12-01 12:32:17 +00:00
|
|
|
.set = s390_last_break_set,
|
2010-05-17 08:00:05 +00:00
|
|
|
},
|
2014-10-06 15:53:53 +00:00
|
|
|
{
|
2012-07-31 09:03:04 +00:00
|
|
|
.core_note_type = NT_S390_TDB,
|
|
|
|
|
.n = 1,
|
|
|
|
|
.size = 256,
|
|
|
|
|
.align = 1,
|
|
|
|
|
.get = s390_tdb_get,
|
|
|
|
|
.set = s390_tdb_set,
|
|
|
|
|
},
|
2014-10-06 15:53:53 +00:00
|
|
|
{
|
|
|
|
|
.core_note_type = NT_S390_VXRS_LOW,
|
|
|
|
|
.n = __NUM_VXRS_LOW,
|
|
|
|
|
.size = sizeof(__u64),
|
|
|
|
|
.align = sizeof(__u64),
|
|
|
|
|
.get = s390_vxrs_low_get,
|
|
|
|
|
.set = s390_vxrs_low_set,
|
2011-10-30 14:16:47 +00:00
|
|
|
},
|
2014-10-06 15:53:53 +00:00
|
|
|
{
|
|
|
|
|
.core_note_type = NT_S390_VXRS_HIGH,
|
|
|
|
|
.n = __NUM_VXRS_HIGH,
|
|
|
|
|
.size = sizeof(__vector128),
|
|
|
|
|
.align = sizeof(__vector128),
|
|
|
|
|
.get = s390_vxrs_high_get,
|
|
|
|
|
.set = s390_vxrs_high_set,
|
2011-10-30 14:16:47 +00:00
|
|
|
},
|
2016-01-26 13:10:34 +00:00
|
|
|
{
|
|
|
|
|
.core_note_type = NT_S390_GS_CB,
|
|
|
|
|
.n = sizeof(struct gs_cb) / sizeof(__u64),
|
|
|
|
|
.size = sizeof(__u64),
|
|
|
|
|
.align = sizeof(__u64),
|
|
|
|
|
.get = s390_gs_cb_get,
|
|
|
|
|
.set = s390_gs_cb_set,
|
|
|
|
|
},
|
2017-04-20 11:54:11 +00:00
|
|
|
{
|
|
|
|
|
.core_note_type = NT_S390_GS_BC,
|
|
|
|
|
.n = sizeof(struct gs_cb) / sizeof(__u64),
|
|
|
|
|
.size = sizeof(__u64),
|
|
|
|
|
.align = sizeof(__u64),
|
|
|
|
|
.get = s390_gs_bc_get,
|
|
|
|
|
.set = s390_gs_bc_set,
|
|
|
|
|
},
|
2008-07-14 07:58:54 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static const struct user_regset_view user_s390_view = {
|
|
|
|
|
.name = UTS_MACHINE,
|
|
|
|
|
.e_machine = EM_S390,
|
|
|
|
|
.regsets = s390_regsets,
|
|
|
|
|
.n = ARRAY_SIZE(s390_regsets)
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#ifdef CONFIG_COMPAT
|
|
|
|
|
static int s390_compat_regs_get(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
void *kbuf, void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
if (target == current)
|
|
|
|
|
save_access_regs(target->thread.acrs);
|
|
|
|
|
|
|
|
|
|
if (kbuf) {
|
|
|
|
|
compat_ulong_t *k = kbuf;
|
|
|
|
|
while (count > 0) {
|
|
|
|
|
*k++ = __peek_user_compat(target, pos);
|
|
|
|
|
count -= sizeof(*k);
|
|
|
|
|
pos += sizeof(*k);
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
compat_ulong_t __user *u = ubuf;
|
|
|
|
|
while (count > 0) {
|
|
|
|
|
if (__put_user(__peek_user_compat(target, pos), u++))
|
|
|
|
|
return -EFAULT;
|
|
|
|
|
count -= sizeof(*u);
|
|
|
|
|
pos += sizeof(*u);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int s390_compat_regs_set(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
const void *kbuf, const void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
int rc = 0;
|
|
|
|
|
|
|
|
|
|
if (target == current)
|
|
|
|
|
save_access_regs(target->thread.acrs);
|
|
|
|
|
|
|
|
|
|
if (kbuf) {
|
|
|
|
|
const compat_ulong_t *k = kbuf;
|
|
|
|
|
while (count > 0 && !rc) {
|
|
|
|
|
rc = __poke_user_compat(target, pos, *k++);
|
|
|
|
|
count -= sizeof(*k);
|
|
|
|
|
pos += sizeof(*k);
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
const compat_ulong_t __user *u = ubuf;
|
|
|
|
|
while (count > 0 && !rc) {
|
|
|
|
|
compat_ulong_t word;
|
|
|
|
|
rc = __get_user(word, u++);
|
|
|
|
|
if (rc)
|
|
|
|
|
break;
|
|
|
|
|
rc = __poke_user_compat(target, pos, word);
|
|
|
|
|
count -= sizeof(*u);
|
|
|
|
|
pos += sizeof(*u);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (rc == 0 && target == current)
|
|
|
|
|
restore_access_regs(target->thread.acrs);
|
|
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
|
}
|
|
|
|
|
|
2009-10-06 08:34:13 +00:00
|
|
|
static int s390_compat_regs_high_get(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
void *kbuf, void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
compat_ulong_t *gprs_high;
|
|
|
|
|
|
|
|
|
|
gprs_high = (compat_ulong_t *)
|
|
|
|
|
&task_pt_regs(target)->gprs[pos / sizeof(compat_ulong_t)];
|
|
|
|
|
if (kbuf) {
|
|
|
|
|
compat_ulong_t *k = kbuf;
|
|
|
|
|
while (count > 0) {
|
|
|
|
|
*k++ = *gprs_high;
|
|
|
|
|
gprs_high += 2;
|
|
|
|
|
count -= sizeof(*k);
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
compat_ulong_t __user *u = ubuf;
|
|
|
|
|
while (count > 0) {
|
|
|
|
|
if (__put_user(*gprs_high, u++))
|
|
|
|
|
return -EFAULT;
|
|
|
|
|
gprs_high += 2;
|
|
|
|
|
count -= sizeof(*u);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int s390_compat_regs_high_set(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
const void *kbuf, const void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
compat_ulong_t *gprs_high;
|
|
|
|
|
int rc = 0;
|
|
|
|
|
|
|
|
|
|
gprs_high = (compat_ulong_t *)
|
|
|
|
|
&task_pt_regs(target)->gprs[pos / sizeof(compat_ulong_t)];
|
|
|
|
|
if (kbuf) {
|
|
|
|
|
const compat_ulong_t *k = kbuf;
|
|
|
|
|
while (count > 0) {
|
|
|
|
|
*gprs_high = *k++;
|
|
|
|
|
*gprs_high += 2;
|
|
|
|
|
count -= sizeof(*k);
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
const compat_ulong_t __user *u = ubuf;
|
|
|
|
|
while (count > 0 && !rc) {
|
|
|
|
|
unsigned long word;
|
|
|
|
|
rc = __get_user(word, u++);
|
|
|
|
|
if (rc)
|
|
|
|
|
break;
|
|
|
|
|
*gprs_high = word;
|
|
|
|
|
*gprs_high += 2;
|
|
|
|
|
count -= sizeof(*u);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
|
}
|
|
|
|
|
|
2010-05-17 08:00:05 +00:00
|
|
|
static int s390_compat_last_break_get(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
void *kbuf, void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
compat_ulong_t last_break;
|
|
|
|
|
|
|
|
|
|
if (count > 0) {
|
2016-11-08 11:33:38 +00:00
|
|
|
last_break = target->thread.last_break;
|
2010-05-17 08:00:05 +00:00
|
|
|
if (kbuf) {
|
|
|
|
|
unsigned long *k = kbuf;
|
|
|
|
|
*k = last_break;
|
|
|
|
|
} else {
|
|
|
|
|
unsigned long __user *u = ubuf;
|
|
|
|
|
if (__put_user(last_break, u))
|
|
|
|
|
return -EFAULT;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2011-12-01 12:32:17 +00:00
|
|
|
static int s390_compat_last_break_set(struct task_struct *target,
|
|
|
|
|
const struct user_regset *regset,
|
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
|
const void *kbuf, const void __user *ubuf)
|
|
|
|
|
{
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2008-07-14 07:58:54 +00:00
|
|
|
static const struct user_regset s390_compat_regsets[] = {
|
2014-10-06 15:53:53 +00:00
|
|
|
{
|
2008-07-14 07:58:54 +00:00
|
|
|
.core_note_type = NT_PRSTATUS,
|
|
|
|
|
.n = sizeof(s390_compat_regs) / sizeof(compat_long_t),
|
|
|
|
|
.size = sizeof(compat_long_t),
|
|
|
|
|
.align = sizeof(compat_long_t),
|
|
|
|
|
.get = s390_compat_regs_get,
|
|
|
|
|
.set = s390_compat_regs_set,
|
|
|
|
|
},
|
2014-10-06 15:53:53 +00:00
|
|
|
{
|
2008-07-14 07:58:54 +00:00
|
|
|
.core_note_type = NT_PRFPREG,
|
|
|
|
|
.n = sizeof(s390_fp_regs) / sizeof(compat_long_t),
|
|
|
|
|
.size = sizeof(compat_long_t),
|
|
|
|
|
.align = sizeof(compat_long_t),
|
|
|
|
|
.get = s390_fpregs_get,
|
|
|
|
|
.set = s390_fpregs_set,
|
|
|
|
|
},
|
2014-10-06 15:53:53 +00:00
|
|
|
{
|
|
|
|
|
.core_note_type = NT_S390_SYSTEM_CALL,
|
|
|
|
|
.n = 1,
|
|
|
|
|
.size = sizeof(compat_uint_t),
|
|
|
|
|
.align = sizeof(compat_uint_t),
|
|
|
|
|
.get = s390_system_call_get,
|
|
|
|
|
.set = s390_system_call_set,
|
|
|
|
|
},
|
|
|
|
|
{
|
2010-05-17 08:00:05 +00:00
|
|
|
.core_note_type = NT_S390_LAST_BREAK,
|
|
|
|
|
.n = 1,
|
|
|
|
|
.size = sizeof(long),
|
|
|
|
|
.align = sizeof(long),
|
|
|
|
|
.get = s390_compat_last_break_get,
|
2011-12-01 12:32:17 +00:00
|
|
|
.set = s390_compat_last_break_set,
|
2010-05-17 08:00:05 +00:00
|
|
|
},
|
2014-10-06 15:53:53 +00:00
|
|
|
{
|
2012-07-31 09:03:04 +00:00
|
|
|
.core_note_type = NT_S390_TDB,
|
|
|
|
|
.n = 1,
|
|
|
|
|
.size = 256,
|
|
|
|
|
.align = 1,
|
|
|
|
|
.get = s390_tdb_get,
|
|
|
|
|
.set = s390_tdb_set,
|
|
|
|
|
},
|
2014-10-06 15:53:53 +00:00
|
|
|
{
|
|
|
|
|
.core_note_type = NT_S390_VXRS_LOW,
|
|
|
|
|
.n = __NUM_VXRS_LOW,
|
|
|
|
|
.size = sizeof(__u64),
|
|
|
|
|
.align = sizeof(__u64),
|
|
|
|
|
.get = s390_vxrs_low_get,
|
|
|
|
|
.set = s390_vxrs_low_set,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
.core_note_type = NT_S390_VXRS_HIGH,
|
|
|
|
|
.n = __NUM_VXRS_HIGH,
|
|
|
|
|
.size = sizeof(__vector128),
|
|
|
|
|
.align = sizeof(__vector128),
|
|
|
|
|
.get = s390_vxrs_high_get,
|
|
|
|
|
.set = s390_vxrs_high_set,
|
2011-10-30 14:16:47 +00:00
|
|
|
},
|
2014-10-06 15:53:53 +00:00
|
|
|
{
|
2009-12-18 16:43:20 +00:00
|
|
|
.core_note_type = NT_S390_HIGH_GPRS,
|
2009-10-06 08:34:13 +00:00
|
|
|
.n = sizeof(s390_compat_regs_high) / sizeof(compat_long_t),
|
|
|
|
|
.size = sizeof(compat_long_t),
|
|
|
|
|
.align = sizeof(compat_long_t),
|
|
|
|
|
.get = s390_compat_regs_high_get,
|
|
|
|
|
.set = s390_compat_regs_high_set,
|
|
|
|
|
},
|
2016-01-26 13:10:34 +00:00
|
|
|
{
|
|
|
|
|
.core_note_type = NT_S390_GS_CB,
|
|
|
|
|
.n = sizeof(struct gs_cb) / sizeof(__u64),
|
|
|
|
|
.size = sizeof(__u64),
|
|
|
|
|
.align = sizeof(__u64),
|
|
|
|
|
.get = s390_gs_cb_get,
|
|
|
|
|
.set = s390_gs_cb_set,
|
|
|
|
|
},
|
2008-07-14 07:58:54 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static const struct user_regset_view user_s390_compat_view = {
|
|
|
|
|
.name = "s390",
|
|
|
|
|
.e_machine = EM_S390,
|
|
|
|
|
.regsets = s390_compat_regsets,
|
|
|
|
|
.n = ARRAY_SIZE(s390_compat_regsets)
|
|
|
|
|
};
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
const struct user_regset_view *task_user_regset_view(struct task_struct *task)
|
|
|
|
|
{
|
|
|
|
|
#ifdef CONFIG_COMPAT
|
|
|
|
|
if (test_tsk_thread_flag(task, TIF_31BIT))
|
|
|
|
|
return &user_s390_compat_view;
|
|
|
|
|
#endif
|
|
|
|
|
return &user_s390_view;
|
|
|
|
|
}
|
2010-02-12 12:38:40 +00:00
|
|
|
|
|
|
|
|
static const char *gpr_names[NUM_GPRS] = {
|
|
|
|
|
"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7",
|
|
|
|
|
"r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15",
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
unsigned long regs_get_register(struct pt_regs *regs, unsigned int offset)
|
|
|
|
|
{
|
|
|
|
|
if (offset >= NUM_GPRS)
|
|
|
|
|
return 0;
|
|
|
|
|
return regs->gprs[offset];
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int regs_query_register_offset(const char *name)
|
|
|
|
|
{
|
|
|
|
|
unsigned long offset;
|
|
|
|
|
|
|
|
|
|
if (!name || *name != 'r')
|
|
|
|
|
return -EINVAL;
|
2013-07-22 04:43:57 +00:00
|
|
|
if (kstrtoul(name + 1, 10, &offset))
|
2010-02-12 12:38:40 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
if (offset >= NUM_GPRS)
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
return offset;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const char *regs_query_register_name(unsigned int offset)
|
|
|
|
|
{
|
|
|
|
|
if (offset >= NUM_GPRS)
|
|
|
|
|
return NULL;
|
|
|
|
|
return gpr_names[offset];
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int regs_within_kernel_stack(struct pt_regs *regs, unsigned long addr)
|
|
|
|
|
{
|
|
|
|
|
unsigned long ksp = kernel_stack_pointer(regs);
|
|
|
|
|
|
|
|
|
|
return (addr & ~(THREAD_SIZE - 1)) == (ksp & ~(THREAD_SIZE - 1));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* regs_get_kernel_stack_nth() - get Nth entry of the stack
|
|
|
|
|
* @regs:pt_regs which contains kernel stack pointer.
|
|
|
|
|
* @n:stack entry number.
|
|
|
|
|
*
|
|
|
|
|
* regs_get_kernel_stack_nth() returns @n th entry of the kernel stack which
|
|
|
|
|
* is specifined by @regs. If the @n th entry is NOT in the kernel stack,
|
|
|
|
|
* this returns 0.
|
|
|
|
|
*/
|
|
|
|
|
unsigned long regs_get_kernel_stack_nth(struct pt_regs *regs, unsigned int n)
|
|
|
|
|
{
|
|
|
|
|
unsigned long addr;
|
|
|
|
|
|
|
|
|
|
addr = kernel_stack_pointer(regs) + n * sizeof(long);
|
|
|
|
|
if (!regs_within_kernel_stack(regs, addr))
|
|
|
|
|
return 0;
|
|
|
|
|
return *(unsigned long *)addr;
|
|
|
|
|
}
|
