2 * arch/s390/kernel/ptrace.c
5 * Copyright (C) 1999,2000 IBM Deutschland Entwicklung GmbH, IBM Corporation
6 * Author(s): Denis Joseph Barrow (djbarrow@de.ibm.com,barrow_dj@yahoo.com),
7 * Martin Schwidefsky (schwidefsky@de.ibm.com)
9 * Based on PowerPC version
10 * Copyright (C) 1995-1996 Gary Thomas (gdt@linuxppc.org)
12 * Derived from "arch/m68k/kernel/ptrace.c"
13 * Copyright (C) 1994 by Hamish Macdonald
14 * Taken from linux/kernel/ptrace.c and modified for M680x0.
15 * linux/kernel/ptrace.c is by Ross Biro 1/23/92, edited by Linus Torvalds
17 * Modified by Cort Dougan (cort@cs.nmt.edu)
20 * This file is subject to the terms and conditions of the GNU General
21 * Public License. See the file README.legal in the main directory of
22 * this archive for more details.
25 #include <linux/kernel.h>
26 #include <linux/sched.h>
28 #include <linux/smp.h>
29 #include <linux/smp_lock.h>
30 #include <linux/errno.h>
31 #include <linux/ptrace.h>
32 #include <linux/user.h>
33 #include <linux/security.h>
34 #include <linux/audit.h>
35 #include <linux/signal.h>
37 #include <asm/segment.h>
39 #include <asm/pgtable.h>
40 #include <asm/pgalloc.h>
41 #include <asm/system.h>
42 #include <asm/uaccess.h>
43 #include <asm/unistd.h>
47 #include "compat_ptrace.h"
51 FixPerRegisters(struct task_struct *task)
56 regs = task_pt_regs(task);
57 per_info = (per_struct *) &task->thread.per_info;
58 per_info->control_regs.bits.em_instruction_fetch =
59 per_info->single_step | per_info->instruction_fetch;
61 if (per_info->single_step) {
62 per_info->control_regs.bits.starting_addr = 0;
64 if (test_thread_flag(TIF_31BIT))
65 per_info->control_regs.bits.ending_addr = 0x7fffffffUL;
68 per_info->control_regs.bits.ending_addr = PSW_ADDR_INSN;
70 per_info->control_regs.bits.starting_addr =
71 per_info->starting_addr;
72 per_info->control_regs.bits.ending_addr =
73 per_info->ending_addr;
76 * if any of the control reg tracing bits are on
77 * we switch on per in the psw
79 if (per_info->control_regs.words.cr[0] & PER_EM_MASK)
80 regs->psw.mask |= PSW_MASK_PER;
82 regs->psw.mask &= ~PSW_MASK_PER;
84 if (per_info->control_regs.bits.em_storage_alteration)
85 per_info->control_regs.bits.storage_alt_space_ctl = 1;
87 per_info->control_regs.bits.storage_alt_space_ctl = 0;
90 void user_enable_single_step(struct task_struct *task)
92 task->thread.per_info.single_step = 1;
93 FixPerRegisters(task);
96 void user_disable_single_step(struct task_struct *task)
98 task->thread.per_info.single_step = 0;
99 FixPerRegisters(task);
103 * Called by kernel/ptrace.c when detaching..
105 * Make sure single step bits etc are not set.
108 ptrace_disable(struct task_struct *child)
110 /* make sure the single step bit is not set. */
111 user_disable_single_step(child);
115 # define __ADDR_MASK 3
117 # define __ADDR_MASK 7
121 * Read the word at offset addr from the user area of a process. The
122 * trouble here is that the information is littered over different
123 * locations. The process registers are found on the kernel stack,
124 * the floating point stuff and the trace settings are stored in
125 * the task structure. In addition the different structures in
126 * struct user contain pad bytes that should be read as zeroes.
130 peek_user(struct task_struct *child, addr_t addr, addr_t data)
132 struct user *dummy = NULL;
133 addr_t offset, tmp, mask;
136 * Stupid gdb peeks/pokes the access registers in 64 bit with
137 * an alignment of 4. Programmers from hell...
141 if (addr >= (addr_t) &dummy->regs.acrs &&
142 addr < (addr_t) &dummy->regs.orig_gpr2)
145 if ((addr & mask) || addr > sizeof(struct user) - __ADDR_MASK)
148 if (addr < (addr_t) &dummy->regs.acrs) {
150 * psw and gprs are stored on the stack
152 tmp = *(addr_t *)((addr_t) &task_pt_regs(child)->psw + addr);
153 if (addr == (addr_t) &dummy->regs.psw.mask)
154 /* Remove per bit from user psw. */
155 tmp &= ~PSW_MASK_PER;
157 } else if (addr < (addr_t) &dummy->regs.orig_gpr2) {
159 * access registers are stored in the thread structure
161 offset = addr - (addr_t) &dummy->regs.acrs;
164 * Very special case: old & broken 64 bit gdb reading
165 * from acrs[15]. Result is a 64 bit value. Read the
166 * 32 bit acrs[15] value and shift it by 32. Sick...
168 if (addr == (addr_t) &dummy->regs.acrs[15])
169 tmp = ((unsigned long) child->thread.acrs[15]) << 32;
172 tmp = *(addr_t *)((addr_t) &child->thread.acrs + offset);
174 } else if (addr == (addr_t) &dummy->regs.orig_gpr2) {
176 * orig_gpr2 is stored on the kernel stack
178 tmp = (addr_t) task_pt_regs(child)->orig_gpr2;
180 } else if (addr < (addr_t) (&dummy->regs.fp_regs + 1)) {
182 * floating point regs. are stored in the thread structure
184 offset = addr - (addr_t) &dummy->regs.fp_regs;
185 tmp = *(addr_t *)((addr_t) &child->thread.fp_regs + offset);
186 if (addr == (addr_t) &dummy->regs.fp_regs.fpc)
187 tmp &= (unsigned long) FPC_VALID_MASK
188 << (BITS_PER_LONG - 32);
190 } else if (addr < (addr_t) (&dummy->regs.per_info + 1)) {
192 * per_info is found in the thread structure
194 offset = addr - (addr_t) &dummy->regs.per_info;
195 tmp = *(addr_t *)((addr_t) &child->thread.per_info + offset);
200 return put_user(tmp, (addr_t __user *) data);
204 * Write a word to the user area of a process at location addr. This
205 * operation does have an additional problem compared to peek_user.
206 * Stores to the program status word and on the floating point
207 * control register needs to get checked for validity.
210 poke_user(struct task_struct *child, addr_t addr, addr_t data)
212 struct user *dummy = NULL;
216 * Stupid gdb peeks/pokes the access registers in 64 bit with
217 * an alignment of 4. Programmers from hell indeed...
221 if (addr >= (addr_t) &dummy->regs.acrs &&
222 addr < (addr_t) &dummy->regs.orig_gpr2)
225 if ((addr & mask) || addr > sizeof(struct user) - __ADDR_MASK)
228 if (addr < (addr_t) &dummy->regs.acrs) {
230 * psw and gprs are stored on the stack
232 if (addr == (addr_t) &dummy->regs.psw.mask &&
234 data != PSW_MASK_MERGE(psw_user32_bits, data) &&
236 data != PSW_MASK_MERGE(psw_user_bits, data))
237 /* Invalid psw mask. */
240 if (addr == (addr_t) &dummy->regs.psw.addr)
241 /* I'd like to reject addresses without the
242 high order bit but older gdb's rely on it */
243 data |= PSW_ADDR_AMODE;
245 *(addr_t *)((addr_t) &task_pt_regs(child)->psw + addr) = data;
247 } else if (addr < (addr_t) (&dummy->regs.orig_gpr2)) {
249 * access registers are stored in the thread structure
251 offset = addr - (addr_t) &dummy->regs.acrs;
254 * Very special case: old & broken 64 bit gdb writing
255 * to acrs[15] with a 64 bit value. Ignore the lower
256 * half of the value and write the upper 32 bit to
259 if (addr == (addr_t) &dummy->regs.acrs[15])
260 child->thread.acrs[15] = (unsigned int) (data >> 32);
263 *(addr_t *)((addr_t) &child->thread.acrs + offset) = data;
265 } else if (addr == (addr_t) &dummy->regs.orig_gpr2) {
267 * orig_gpr2 is stored on the kernel stack
269 task_pt_regs(child)->orig_gpr2 = data;
271 } else if (addr < (addr_t) (&dummy->regs.fp_regs + 1)) {
273 * floating point regs. are stored in the thread structure
275 if (addr == (addr_t) &dummy->regs.fp_regs.fpc &&
276 (data & ~((unsigned long) FPC_VALID_MASK
277 << (BITS_PER_LONG - 32))) != 0)
279 offset = addr - (addr_t) &dummy->regs.fp_regs;
280 *(addr_t *)((addr_t) &child->thread.fp_regs + offset) = data;
282 } else if (addr < (addr_t) (&dummy->regs.per_info + 1)) {
284 * per_info is found in the thread structure
286 offset = addr - (addr_t) &dummy->regs.per_info;
287 *(addr_t *)((addr_t) &child->thread.per_info + offset) = data;
291 FixPerRegisters(child);
296 do_ptrace_normal(struct task_struct *child, long request, long addr, long data)
302 case PTRACE_PEEKTEXT:
303 case PTRACE_PEEKDATA:
304 /* Remove high order bit from address (only for 31 bit). */
305 addr &= PSW_ADDR_INSN;
306 /* read word at location addr. */
307 return generic_ptrace_peekdata(child, addr, data);
310 /* read the word at location addr in the USER area. */
311 return peek_user(child, addr, data);
313 case PTRACE_POKETEXT:
314 case PTRACE_POKEDATA:
315 /* Remove high order bit from address (only for 31 bit). */
316 addr &= PSW_ADDR_INSN;
317 /* write the word at location addr. */
318 return generic_ptrace_pokedata(child, addr, data);
321 /* write the word at location addr in the USER area */
322 return poke_user(child, addr, data);
324 case PTRACE_PEEKUSR_AREA:
325 case PTRACE_POKEUSR_AREA:
326 if (copy_from_user(&parea, (void __force __user *) addr,
329 addr = parea.kernel_addr;
330 data = parea.process_addr;
332 while (copied < parea.len) {
333 if (request == PTRACE_PEEKUSR_AREA)
334 ret = peek_user(child, addr, data);
338 (addr_t __force __user *) data))
340 ret = poke_user(child, addr, utmp);
344 addr += sizeof(unsigned long);
345 data += sizeof(unsigned long);
346 copied += sizeof(unsigned long);
350 return ptrace_request(child, request, addr, data);
355 * Now the fun part starts... a 31 bit program running in the
356 * 31 bit emulation tracing another program. PTRACE_PEEKTEXT,
357 * PTRACE_PEEKDATA, PTRACE_POKETEXT and PTRACE_POKEDATA are easy
358 * to handle, the difference to the 64 bit versions of the requests
359 * is that the access is done in multiples of 4 byte instead of
360 * 8 bytes (sizeof(unsigned long) on 31/64 bit).
361 * The ugly part are PTRACE_PEEKUSR, PTRACE_PEEKUSR_AREA,
362 * PTRACE_POKEUSR and PTRACE_POKEUSR_AREA. If the traced program
363 * is a 31 bit program too, the content of struct user can be
364 * emulated. A 31 bit program peeking into the struct user of
365 * a 64 bit program is a no-no.
369 * Same as peek_user but for a 31 bit program.
372 peek_user_emu31(struct task_struct *child, addr_t addr, addr_t data)
374 struct user32 *dummy32 = NULL;
375 per_struct32 *dummy_per32 = NULL;
379 if (!test_thread_flag(TIF_31BIT) ||
380 (addr & 3) || addr > sizeof(struct user) - 3)
383 if (addr < (addr_t) &dummy32->regs.acrs) {
385 * psw and gprs are stored on the stack
387 if (addr == (addr_t) &dummy32->regs.psw.mask) {
388 /* Fake a 31 bit psw mask. */
389 tmp = (__u32)(task_pt_regs(child)->psw.mask >> 32);
390 tmp = PSW32_MASK_MERGE(psw32_user_bits, tmp);
391 } else if (addr == (addr_t) &dummy32->regs.psw.addr) {
392 /* Fake a 31 bit psw address. */
393 tmp = (__u32) task_pt_regs(child)->psw.addr |
397 tmp = *(__u32 *)((addr_t) &task_pt_regs(child)->psw +
400 } else if (addr < (addr_t) (&dummy32->regs.orig_gpr2)) {
402 * access registers are stored in the thread structure
404 offset = addr - (addr_t) &dummy32->regs.acrs;
405 tmp = *(__u32*)((addr_t) &child->thread.acrs + offset);
407 } else if (addr == (addr_t) (&dummy32->regs.orig_gpr2)) {
409 * orig_gpr2 is stored on the kernel stack
411 tmp = *(__u32*)((addr_t) &task_pt_regs(child)->orig_gpr2 + 4);
413 } else if (addr < (addr_t) (&dummy32->regs.fp_regs + 1)) {
415 * floating point regs. are stored in the thread structure
417 offset = addr - (addr_t) &dummy32->regs.fp_regs;
418 tmp = *(__u32 *)((addr_t) &child->thread.fp_regs + offset);
420 } else if (addr < (addr_t) (&dummy32->regs.per_info + 1)) {
422 * per_info is found in the thread structure
424 offset = addr - (addr_t) &dummy32->regs.per_info;
425 /* This is magic. See per_struct and per_struct32. */
426 if ((offset >= (addr_t) &dummy_per32->control_regs &&
427 offset < (addr_t) (&dummy_per32->control_regs + 1)) ||
428 (offset >= (addr_t) &dummy_per32->starting_addr &&
429 offset <= (addr_t) &dummy_per32->ending_addr) ||
430 offset == (addr_t) &dummy_per32->lowcore.words.address)
431 offset = offset*2 + 4;
434 tmp = *(__u32 *)((addr_t) &child->thread.per_info + offset);
439 return put_user(tmp, (__u32 __user *) data);
443 * Same as poke_user but for a 31 bit program.
446 poke_user_emu31(struct task_struct *child, addr_t addr, addr_t data)
448 struct user32 *dummy32 = NULL;
449 per_struct32 *dummy_per32 = NULL;
453 if (!test_thread_flag(TIF_31BIT) ||
454 (addr & 3) || addr > sizeof(struct user32) - 3)
459 if (addr < (addr_t) &dummy32->regs.acrs) {
461 * psw, gprs, acrs and orig_gpr2 are stored on the stack
463 if (addr == (addr_t) &dummy32->regs.psw.mask) {
464 /* Build a 64 bit psw mask from 31 bit mask. */
465 if (tmp != PSW32_MASK_MERGE(psw32_user_bits, tmp))
466 /* Invalid psw mask. */
468 task_pt_regs(child)->psw.mask =
469 PSW_MASK_MERGE(psw_user32_bits, (__u64) tmp << 32);
470 } else if (addr == (addr_t) &dummy32->regs.psw.addr) {
471 /* Build a 64 bit psw address from 31 bit address. */
472 task_pt_regs(child)->psw.addr =
473 (__u64) tmp & PSW32_ADDR_INSN;
476 *(__u32*)((addr_t) &task_pt_regs(child)->psw
479 } else if (addr < (addr_t) (&dummy32->regs.orig_gpr2)) {
481 * access registers are stored in the thread structure
483 offset = addr - (addr_t) &dummy32->regs.acrs;
484 *(__u32*)((addr_t) &child->thread.acrs + offset) = tmp;
486 } else if (addr == (addr_t) (&dummy32->regs.orig_gpr2)) {
488 * orig_gpr2 is stored on the kernel stack
490 *(__u32*)((addr_t) &task_pt_regs(child)->orig_gpr2 + 4) = tmp;
492 } else if (addr < (addr_t) (&dummy32->regs.fp_regs + 1)) {
494 * floating point regs. are stored in the thread structure
496 if (addr == (addr_t) &dummy32->regs.fp_regs.fpc &&
497 (tmp & ~FPC_VALID_MASK) != 0)
498 /* Invalid floating point control. */
500 offset = addr - (addr_t) &dummy32->regs.fp_regs;
501 *(__u32 *)((addr_t) &child->thread.fp_regs + offset) = tmp;
503 } else if (addr < (addr_t) (&dummy32->regs.per_info + 1)) {
505 * per_info is found in the thread structure.
507 offset = addr - (addr_t) &dummy32->regs.per_info;
509 * This is magic. See per_struct and per_struct32.
510 * By incident the offsets in per_struct are exactly
511 * twice the offsets in per_struct32 for all fields.
512 * The 8 byte fields need special handling though,
513 * because the second half (bytes 4-7) is needed and
514 * not the first half.
516 if ((offset >= (addr_t) &dummy_per32->control_regs &&
517 offset < (addr_t) (&dummy_per32->control_regs + 1)) ||
518 (offset >= (addr_t) &dummy_per32->starting_addr &&
519 offset <= (addr_t) &dummy_per32->ending_addr) ||
520 offset == (addr_t) &dummy_per32->lowcore.words.address)
521 offset = offset*2 + 4;
524 *(__u32 *)((addr_t) &child->thread.per_info + offset) = tmp;
528 FixPerRegisters(child);
533 do_ptrace_emu31(struct task_struct *child, long request, long addr, long data)
535 unsigned int tmp; /* 4 bytes !! */
536 ptrace_area_emu31 parea;
540 case PTRACE_PEEKTEXT:
541 case PTRACE_PEEKDATA:
542 /* read word at location addr. */
543 copied = access_process_vm(child, addr, &tmp, sizeof(tmp), 0);
544 if (copied != sizeof(tmp))
546 return put_user(tmp, (unsigned int __force __user *) data);
549 /* read the word at location addr in the USER area. */
550 return peek_user_emu31(child, addr, data);
552 case PTRACE_POKETEXT:
553 case PTRACE_POKEDATA:
554 /* write the word at location addr. */
556 copied = access_process_vm(child, addr, &tmp, sizeof(tmp), 1);
557 if (copied != sizeof(tmp))
562 /* write the word at location addr in the USER area */
563 return poke_user_emu31(child, addr, data);
565 case PTRACE_PEEKUSR_AREA:
566 case PTRACE_POKEUSR_AREA:
567 if (copy_from_user(&parea, (void __force __user *) addr,
570 addr = parea.kernel_addr;
571 data = parea.process_addr;
573 while (copied < parea.len) {
574 if (request == PTRACE_PEEKUSR_AREA)
575 ret = peek_user_emu31(child, addr, data);
579 (__u32 __force __user *) data))
581 ret = poke_user_emu31(child, addr, utmp);
585 addr += sizeof(unsigned int);
586 data += sizeof(unsigned int);
587 copied += sizeof(unsigned int);
590 case PTRACE_GETEVENTMSG:
591 return put_user((__u32) child->ptrace_message,
592 (unsigned int __force __user *) data);
593 case PTRACE_GETSIGINFO:
594 if (child->last_siginfo == NULL)
596 return copy_siginfo_to_user32((compat_siginfo_t
597 __force __user *) data,
598 child->last_siginfo);
599 case PTRACE_SETSIGINFO:
600 if (child->last_siginfo == NULL)
602 return copy_siginfo_from_user32(child->last_siginfo,
604 __force __user *) data);
606 return ptrace_request(child, request, addr, data);
610 long arch_ptrace(struct task_struct *child, long request, long addr, long data)
614 /* continue and stop at next (return from) syscall */
616 /* restart after signal. */
617 if (!valid_signal(data))
619 if (request == PTRACE_SYSCALL)
620 set_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
622 clear_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
623 child->exit_code = data;
624 /* make sure the single step bit is not set. */
625 user_disable_single_step(child);
626 wake_up_process(child);
631 * make the child exit. Best I can do is send it a sigkill.
632 * perhaps it should be put in the status that it wants to
635 if (child->exit_state == EXIT_ZOMBIE) /* already dead */
637 child->exit_code = SIGKILL;
638 /* make sure the single step bit is not set. */
639 user_disable_single_step(child);
640 wake_up_process(child);
643 case PTRACE_SINGLESTEP:
644 /* set the trap flag. */
645 if (!valid_signal(data))
647 clear_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
648 child->exit_code = data;
649 user_enable_single_step(child);
650 /* give it a chance to run. */
651 wake_up_process(child);
654 /* Do requests that differ for 31/64 bit */
657 if (test_thread_flag(TIF_31BIT))
658 return do_ptrace_emu31(child, request, addr, data);
660 return do_ptrace_normal(child, request, addr, data);
667 syscall_trace(struct pt_regs *regs, int entryexit)
669 if (unlikely(current->audit_context) && entryexit)
670 audit_syscall_exit(AUDITSC_RESULT(regs->gprs[2]), regs->gprs[2]);
672 if (!test_thread_flag(TIF_SYSCALL_TRACE))
674 if (!(current->ptrace & PT_PTRACED))
676 ptrace_notify(SIGTRAP | ((current->ptrace & PT_TRACESYSGOOD)
680 * If the debuffer has set an invalid system call number,
681 * we prepare to skip the system call restart handling.
683 if (!entryexit && regs->gprs[2] >= NR_syscalls)
687 * this isn't the same as continuing with a signal, but it will do
688 * for normal use. strace only continues with a signal if the
689 * stopping signal is not SIGTRAP. -brl
691 if (current->exit_code) {
692 send_sig(current->exit_code, current, 1);
693 current->exit_code = 0;
696 if (unlikely(current->audit_context) && !entryexit)
697 audit_syscall_entry(test_thread_flag(TIF_31BIT)?AUDIT_ARCH_S390:AUDIT_ARCH_S390X,
698 regs->gprs[2], regs->orig_gpr2, regs->gprs[3],
699 regs->gprs[4], regs->gprs[5]);