ptrace.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757
  1. /*
  2. * arch/s390/kernel/ptrace.c
  3. *
  4. * S390 version
  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)
  8. *
  9. * Based on PowerPC version
  10. * Copyright (C) 1995-1996 Gary Thomas (gdt@linuxppc.org)
  11. *
  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
  16. *
  17. * Modified by Cort Dougan (cort@cs.nmt.edu)
  18. *
  19. *
  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.
  23. */
  24. #include <linux/kernel.h>
  25. #include <linux/sched.h>
  26. #include <linux/mm.h>
  27. #include <linux/smp.h>
  28. #include <linux/smp_lock.h>
  29. #include <linux/errno.h>
  30. #include <linux/ptrace.h>
  31. #include <linux/user.h>
  32. #include <linux/security.h>
  33. #include <linux/audit.h>
  34. #include <linux/signal.h>
  35. #include <asm/segment.h>
  36. #include <asm/page.h>
  37. #include <asm/pgtable.h>
  38. #include <asm/pgalloc.h>
  39. #include <asm/system.h>
  40. #include <asm/uaccess.h>
  41. #include <asm/unistd.h>
  42. #ifdef CONFIG_COMPAT
  43. #include "compat_ptrace.h"
  44. #endif
  45. static void
  46. FixPerRegisters(struct task_struct *task)
  47. {
  48. struct pt_regs *regs;
  49. per_struct *per_info;
  50. regs = task_pt_regs(task);
  51. per_info = (per_struct *) &task->thread.per_info;
  52. per_info->control_regs.bits.em_instruction_fetch =
  53. per_info->single_step | per_info->instruction_fetch;
  54. if (per_info->single_step) {
  55. per_info->control_regs.bits.starting_addr = 0;
  56. #ifdef CONFIG_COMPAT
  57. if (test_thread_flag(TIF_31BIT))
  58. per_info->control_regs.bits.ending_addr = 0x7fffffffUL;
  59. else
  60. #endif
  61. per_info->control_regs.bits.ending_addr = PSW_ADDR_INSN;
  62. } else {
  63. per_info->control_regs.bits.starting_addr =
  64. per_info->starting_addr;
  65. per_info->control_regs.bits.ending_addr =
  66. per_info->ending_addr;
  67. }
  68. /*
  69. * if any of the control reg tracing bits are on
  70. * we switch on per in the psw
  71. */
  72. if (per_info->control_regs.words.cr[0] & PER_EM_MASK)
  73. regs->psw.mask |= PSW_MASK_PER;
  74. else
  75. regs->psw.mask &= ~PSW_MASK_PER;
  76. if (per_info->control_regs.bits.em_storage_alteration)
  77. per_info->control_regs.bits.storage_alt_space_ctl = 1;
  78. else
  79. per_info->control_regs.bits.storage_alt_space_ctl = 0;
  80. }
  81. static void set_single_step(struct task_struct *task)
  82. {
  83. task->thread.per_info.single_step = 1;
  84. FixPerRegisters(task);
  85. }
  86. static void clear_single_step(struct task_struct *task)
  87. {
  88. task->thread.per_info.single_step = 0;
  89. FixPerRegisters(task);
  90. }
  91. /*
  92. * Called by kernel/ptrace.c when detaching..
  93. *
  94. * Make sure single step bits etc are not set.
  95. */
  96. void
  97. ptrace_disable(struct task_struct *child)
  98. {
  99. /* make sure the single step bit is not set. */
  100. clear_single_step(child);
  101. }
  102. #ifndef CONFIG_64BIT
  103. # define __ADDR_MASK 3
  104. #else
  105. # define __ADDR_MASK 7
  106. #endif
  107. /*
  108. * Read the word at offset addr from the user area of a process. The
  109. * trouble here is that the information is littered over different
  110. * locations. The process registers are found on the kernel stack,
  111. * the floating point stuff and the trace settings are stored in
  112. * the task structure. In addition the different structures in
  113. * struct user contain pad bytes that should be read as zeroes.
  114. * Lovely...
  115. */
  116. static int
  117. peek_user(struct task_struct *child, addr_t addr, addr_t data)
  118. {
  119. struct user *dummy = NULL;
  120. addr_t offset, tmp, mask;
  121. /*
  122. * Stupid gdb peeks/pokes the access registers in 64 bit with
  123. * an alignment of 4. Programmers from hell...
  124. */
  125. mask = __ADDR_MASK;
  126. #ifdef CONFIG_64BIT
  127. if (addr >= (addr_t) &dummy->regs.acrs &&
  128. addr < (addr_t) &dummy->regs.orig_gpr2)
  129. mask = 3;
  130. #endif
  131. if ((addr & mask) || addr > sizeof(struct user) - __ADDR_MASK)
  132. return -EIO;
  133. if (addr < (addr_t) &dummy->regs.acrs) {
  134. /*
  135. * psw and gprs are stored on the stack
  136. */
  137. tmp = *(addr_t *)((addr_t) &task_pt_regs(child)->psw + addr);
  138. if (addr == (addr_t) &dummy->regs.psw.mask)
  139. /* Remove per bit from user psw. */
  140. tmp &= ~PSW_MASK_PER;
  141. } else if (addr < (addr_t) &dummy->regs.orig_gpr2) {
  142. /*
  143. * access registers are stored in the thread structure
  144. */
  145. offset = addr - (addr_t) &dummy->regs.acrs;
  146. #ifdef CONFIG_64BIT
  147. /*
  148. * Very special case: old & broken 64 bit gdb reading
  149. * from acrs[15]. Result is a 64 bit value. Read the
  150. * 32 bit acrs[15] value and shift it by 32. Sick...
  151. */
  152. if (addr == (addr_t) &dummy->regs.acrs[15])
  153. tmp = ((unsigned long) child->thread.acrs[15]) << 32;
  154. else
  155. #endif
  156. tmp = *(addr_t *)((addr_t) &child->thread.acrs + offset);
  157. } else if (addr == (addr_t) &dummy->regs.orig_gpr2) {
  158. /*
  159. * orig_gpr2 is stored on the kernel stack
  160. */
  161. tmp = (addr_t) task_pt_regs(child)->orig_gpr2;
  162. } else if (addr < (addr_t) (&dummy->regs.fp_regs + 1)) {
  163. /*
  164. * floating point regs. are stored in the thread structure
  165. */
  166. offset = addr - (addr_t) &dummy->regs.fp_regs;
  167. tmp = *(addr_t *)((addr_t) &child->thread.fp_regs + offset);
  168. if (addr == (addr_t) &dummy->regs.fp_regs.fpc)
  169. tmp &= (unsigned long) FPC_VALID_MASK
  170. << (BITS_PER_LONG - 32);
  171. } else if (addr < (addr_t) (&dummy->regs.per_info + 1)) {
  172. /*
  173. * per_info is found in the thread structure
  174. */
  175. offset = addr - (addr_t) &dummy->regs.per_info;
  176. tmp = *(addr_t *)((addr_t) &child->thread.per_info + offset);
  177. } else
  178. tmp = 0;
  179. return put_user(tmp, (addr_t __user *) data);
  180. }
  181. /*
  182. * Write a word to the user area of a process at location addr. This
  183. * operation does have an additional problem compared to peek_user.
  184. * Stores to the program status word and on the floating point
  185. * control register needs to get checked for validity.
  186. */
  187. static int
  188. poke_user(struct task_struct *child, addr_t addr, addr_t data)
  189. {
  190. struct user *dummy = NULL;
  191. addr_t offset, mask;
  192. /*
  193. * Stupid gdb peeks/pokes the access registers in 64 bit with
  194. * an alignment of 4. Programmers from hell indeed...
  195. */
  196. mask = __ADDR_MASK;
  197. #ifdef CONFIG_64BIT
  198. if (addr >= (addr_t) &dummy->regs.acrs &&
  199. addr < (addr_t) &dummy->regs.orig_gpr2)
  200. mask = 3;
  201. #endif
  202. if ((addr & mask) || addr > sizeof(struct user) - __ADDR_MASK)
  203. return -EIO;
  204. if (addr < (addr_t) &dummy->regs.acrs) {
  205. /*
  206. * psw and gprs are stored on the stack
  207. */
  208. if (addr == (addr_t) &dummy->regs.psw.mask &&
  209. #ifdef CONFIG_COMPAT
  210. data != PSW_MASK_MERGE(psw_user32_bits, data) &&
  211. #endif
  212. data != PSW_MASK_MERGE(psw_user_bits, data))
  213. /* Invalid psw mask. */
  214. return -EINVAL;
  215. #ifndef CONFIG_64BIT
  216. if (addr == (addr_t) &dummy->regs.psw.addr)
  217. /* I'd like to reject addresses without the
  218. high order bit but older gdb's rely on it */
  219. data |= PSW_ADDR_AMODE;
  220. #endif
  221. *(addr_t *)((addr_t) &task_pt_regs(child)->psw + addr) = data;
  222. } else if (addr < (addr_t) (&dummy->regs.orig_gpr2)) {
  223. /*
  224. * access registers are stored in the thread structure
  225. */
  226. offset = addr - (addr_t) &dummy->regs.acrs;
  227. #ifdef CONFIG_64BIT
  228. /*
  229. * Very special case: old & broken 64 bit gdb writing
  230. * to acrs[15] with a 64 bit value. Ignore the lower
  231. * half of the value and write the upper 32 bit to
  232. * acrs[15]. Sick...
  233. */
  234. if (addr == (addr_t) &dummy->regs.acrs[15])
  235. child->thread.acrs[15] = (unsigned int) (data >> 32);
  236. else
  237. #endif
  238. *(addr_t *)((addr_t) &child->thread.acrs + offset) = data;
  239. } else if (addr == (addr_t) &dummy->regs.orig_gpr2) {
  240. /*
  241. * orig_gpr2 is stored on the kernel stack
  242. */
  243. task_pt_regs(child)->orig_gpr2 = data;
  244. } else if (addr < (addr_t) (&dummy->regs.fp_regs + 1)) {
  245. /*
  246. * floating point regs. are stored in the thread structure
  247. */
  248. if (addr == (addr_t) &dummy->regs.fp_regs.fpc &&
  249. (data & ~((unsigned long) FPC_VALID_MASK
  250. << (BITS_PER_LONG - 32))) != 0)
  251. return -EINVAL;
  252. offset = addr - (addr_t) &dummy->regs.fp_regs;
  253. *(addr_t *)((addr_t) &child->thread.fp_regs + offset) = data;
  254. } else if (addr < (addr_t) (&dummy->regs.per_info + 1)) {
  255. /*
  256. * per_info is found in the thread structure
  257. */
  258. offset = addr - (addr_t) &dummy->regs.per_info;
  259. *(addr_t *)((addr_t) &child->thread.per_info + offset) = data;
  260. }
  261. FixPerRegisters(child);
  262. return 0;
  263. }
  264. static int
  265. do_ptrace_normal(struct task_struct *child, long request, long addr, long data)
  266. {
  267. ptrace_area parea;
  268. int copied, ret;
  269. switch (request) {
  270. case PTRACE_PEEKTEXT:
  271. case PTRACE_PEEKDATA:
  272. /* Remove high order bit from address (only for 31 bit). */
  273. addr &= PSW_ADDR_INSN;
  274. /* read word at location addr. */
  275. return generic_ptrace_peekdata(child, addr, data);
  276. case PTRACE_PEEKUSR:
  277. /* read the word at location addr in the USER area. */
  278. return peek_user(child, addr, data);
  279. case PTRACE_POKETEXT:
  280. case PTRACE_POKEDATA:
  281. /* Remove high order bit from address (only for 31 bit). */
  282. addr &= PSW_ADDR_INSN;
  283. /* write the word at location addr. */
  284. return generic_ptrace_pokedata(child, addr, data);
  285. case PTRACE_POKEUSR:
  286. /* write the word at location addr in the USER area */
  287. return poke_user(child, addr, data);
  288. case PTRACE_PEEKUSR_AREA:
  289. case PTRACE_POKEUSR_AREA:
  290. if (copy_from_user(&parea, (void __force __user *) addr,
  291. sizeof(parea)))
  292. return -EFAULT;
  293. addr = parea.kernel_addr;
  294. data = parea.process_addr;
  295. copied = 0;
  296. while (copied < parea.len) {
  297. if (request == PTRACE_PEEKUSR_AREA)
  298. ret = peek_user(child, addr, data);
  299. else {
  300. addr_t utmp;
  301. if (get_user(utmp,
  302. (addr_t __force __user *) data))
  303. return -EFAULT;
  304. ret = poke_user(child, addr, utmp);
  305. }
  306. if (ret)
  307. return ret;
  308. addr += sizeof(unsigned long);
  309. data += sizeof(unsigned long);
  310. copied += sizeof(unsigned long);
  311. }
  312. return 0;
  313. }
  314. return ptrace_request(child, request, addr, data);
  315. }
  316. #ifdef CONFIG_COMPAT
  317. /*
  318. * Now the fun part starts... a 31 bit program running in the
  319. * 31 bit emulation tracing another program. PTRACE_PEEKTEXT,
  320. * PTRACE_PEEKDATA, PTRACE_POKETEXT and PTRACE_POKEDATA are easy
  321. * to handle, the difference to the 64 bit versions of the requests
  322. * is that the access is done in multiples of 4 byte instead of
  323. * 8 bytes (sizeof(unsigned long) on 31/64 bit).
  324. * The ugly part are PTRACE_PEEKUSR, PTRACE_PEEKUSR_AREA,
  325. * PTRACE_POKEUSR and PTRACE_POKEUSR_AREA. If the traced program
  326. * is a 31 bit program too, the content of struct user can be
  327. * emulated. A 31 bit program peeking into the struct user of
  328. * a 64 bit program is a no-no.
  329. */
  330. /*
  331. * Same as peek_user but for a 31 bit program.
  332. */
  333. static int
  334. peek_user_emu31(struct task_struct *child, addr_t addr, addr_t data)
  335. {
  336. struct user32 *dummy32 = NULL;
  337. per_struct32 *dummy_per32 = NULL;
  338. addr_t offset;
  339. __u32 tmp;
  340. if (!test_thread_flag(TIF_31BIT) ||
  341. (addr & 3) || addr > sizeof(struct user) - 3)
  342. return -EIO;
  343. if (addr < (addr_t) &dummy32->regs.acrs) {
  344. /*
  345. * psw and gprs are stored on the stack
  346. */
  347. if (addr == (addr_t) &dummy32->regs.psw.mask) {
  348. /* Fake a 31 bit psw mask. */
  349. tmp = (__u32)(task_pt_regs(child)->psw.mask >> 32);
  350. tmp = PSW32_MASK_MERGE(psw32_user_bits, tmp);
  351. } else if (addr == (addr_t) &dummy32->regs.psw.addr) {
  352. /* Fake a 31 bit psw address. */
  353. tmp = (__u32) task_pt_regs(child)->psw.addr |
  354. PSW32_ADDR_AMODE31;
  355. } else {
  356. /* gpr 0-15 */
  357. tmp = *(__u32 *)((addr_t) &task_pt_regs(child)->psw +
  358. addr*2 + 4);
  359. }
  360. } else if (addr < (addr_t) (&dummy32->regs.orig_gpr2)) {
  361. /*
  362. * access registers are stored in the thread structure
  363. */
  364. offset = addr - (addr_t) &dummy32->regs.acrs;
  365. tmp = *(__u32*)((addr_t) &child->thread.acrs + offset);
  366. } else if (addr == (addr_t) (&dummy32->regs.orig_gpr2)) {
  367. /*
  368. * orig_gpr2 is stored on the kernel stack
  369. */
  370. tmp = *(__u32*)((addr_t) &task_pt_regs(child)->orig_gpr2 + 4);
  371. } else if (addr < (addr_t) (&dummy32->regs.fp_regs + 1)) {
  372. /*
  373. * floating point regs. are stored in the thread structure
  374. */
  375. offset = addr - (addr_t) &dummy32->regs.fp_regs;
  376. tmp = *(__u32 *)((addr_t) &child->thread.fp_regs + offset);
  377. } else if (addr < (addr_t) (&dummy32->regs.per_info + 1)) {
  378. /*
  379. * per_info is found in the thread structure
  380. */
  381. offset = addr - (addr_t) &dummy32->regs.per_info;
  382. /* This is magic. See per_struct and per_struct32. */
  383. if ((offset >= (addr_t) &dummy_per32->control_regs &&
  384. offset < (addr_t) (&dummy_per32->control_regs + 1)) ||
  385. (offset >= (addr_t) &dummy_per32->starting_addr &&
  386. offset <= (addr_t) &dummy_per32->ending_addr) ||
  387. offset == (addr_t) &dummy_per32->lowcore.words.address)
  388. offset = offset*2 + 4;
  389. else
  390. offset = offset*2;
  391. tmp = *(__u32 *)((addr_t) &child->thread.per_info + offset);
  392. } else
  393. tmp = 0;
  394. return put_user(tmp, (__u32 __user *) data);
  395. }
  396. /*
  397. * Same as poke_user but for a 31 bit program.
  398. */
  399. static int
  400. poke_user_emu31(struct task_struct *child, addr_t addr, addr_t data)
  401. {
  402. struct user32 *dummy32 = NULL;
  403. per_struct32 *dummy_per32 = NULL;
  404. addr_t offset;
  405. __u32 tmp;
  406. if (!test_thread_flag(TIF_31BIT) ||
  407. (addr & 3) || addr > sizeof(struct user32) - 3)
  408. return -EIO;
  409. tmp = (__u32) data;
  410. if (addr < (addr_t) &dummy32->regs.acrs) {
  411. /*
  412. * psw, gprs, acrs and orig_gpr2 are stored on the stack
  413. */
  414. if (addr == (addr_t) &dummy32->regs.psw.mask) {
  415. /* Build a 64 bit psw mask from 31 bit mask. */
  416. if (tmp != PSW32_MASK_MERGE(psw32_user_bits, tmp))
  417. /* Invalid psw mask. */
  418. return -EINVAL;
  419. task_pt_regs(child)->psw.mask =
  420. PSW_MASK_MERGE(psw_user32_bits, (__u64) tmp << 32);
  421. } else if (addr == (addr_t) &dummy32->regs.psw.addr) {
  422. /* Build a 64 bit psw address from 31 bit address. */
  423. task_pt_regs(child)->psw.addr =
  424. (__u64) tmp & PSW32_ADDR_INSN;
  425. } else {
  426. /* gpr 0-15 */
  427. *(__u32*)((addr_t) &task_pt_regs(child)->psw
  428. + addr*2 + 4) = tmp;
  429. }
  430. } else if (addr < (addr_t) (&dummy32->regs.orig_gpr2)) {
  431. /*
  432. * access registers are stored in the thread structure
  433. */
  434. offset = addr - (addr_t) &dummy32->regs.acrs;
  435. *(__u32*)((addr_t) &child->thread.acrs + offset) = tmp;
  436. } else if (addr == (addr_t) (&dummy32->regs.orig_gpr2)) {
  437. /*
  438. * orig_gpr2 is stored on the kernel stack
  439. */
  440. *(__u32*)((addr_t) &task_pt_regs(child)->orig_gpr2 + 4) = tmp;
  441. } else if (addr < (addr_t) (&dummy32->regs.fp_regs + 1)) {
  442. /*
  443. * floating point regs. are stored in the thread structure
  444. */
  445. if (addr == (addr_t) &dummy32->regs.fp_regs.fpc &&
  446. (tmp & ~FPC_VALID_MASK) != 0)
  447. /* Invalid floating point control. */
  448. return -EINVAL;
  449. offset = addr - (addr_t) &dummy32->regs.fp_regs;
  450. *(__u32 *)((addr_t) &child->thread.fp_regs + offset) = tmp;
  451. } else if (addr < (addr_t) (&dummy32->regs.per_info + 1)) {
  452. /*
  453. * per_info is found in the thread structure.
  454. */
  455. offset = addr - (addr_t) &dummy32->regs.per_info;
  456. /*
  457. * This is magic. See per_struct and per_struct32.
  458. * By incident the offsets in per_struct are exactly
  459. * twice the offsets in per_struct32 for all fields.
  460. * The 8 byte fields need special handling though,
  461. * because the second half (bytes 4-7) is needed and
  462. * not the first half.
  463. */
  464. if ((offset >= (addr_t) &dummy_per32->control_regs &&
  465. offset < (addr_t) (&dummy_per32->control_regs + 1)) ||
  466. (offset >= (addr_t) &dummy_per32->starting_addr &&
  467. offset <= (addr_t) &dummy_per32->ending_addr) ||
  468. offset == (addr_t) &dummy_per32->lowcore.words.address)
  469. offset = offset*2 + 4;
  470. else
  471. offset = offset*2;
  472. *(__u32 *)((addr_t) &child->thread.per_info + offset) = tmp;
  473. }
  474. FixPerRegisters(child);
  475. return 0;
  476. }
  477. static int
  478. do_ptrace_emu31(struct task_struct *child, long request, long addr, long data)
  479. {
  480. unsigned int tmp; /* 4 bytes !! */
  481. ptrace_area_emu31 parea;
  482. int copied, ret;
  483. switch (request) {
  484. case PTRACE_PEEKTEXT:
  485. case PTRACE_PEEKDATA:
  486. /* read word at location addr. */
  487. copied = access_process_vm(child, addr, &tmp, sizeof(tmp), 0);
  488. if (copied != sizeof(tmp))
  489. return -EIO;
  490. return put_user(tmp, (unsigned int __force __user *) data);
  491. case PTRACE_PEEKUSR:
  492. /* read the word at location addr in the USER area. */
  493. return peek_user_emu31(child, addr, data);
  494. case PTRACE_POKETEXT:
  495. case PTRACE_POKEDATA:
  496. /* write the word at location addr. */
  497. tmp = data;
  498. copied = access_process_vm(child, addr, &tmp, sizeof(tmp), 1);
  499. if (copied != sizeof(tmp))
  500. return -EIO;
  501. return 0;
  502. case PTRACE_POKEUSR:
  503. /* write the word at location addr in the USER area */
  504. return poke_user_emu31(child, addr, data);
  505. case PTRACE_PEEKUSR_AREA:
  506. case PTRACE_POKEUSR_AREA:
  507. if (copy_from_user(&parea, (void __force __user *) addr,
  508. sizeof(parea)))
  509. return -EFAULT;
  510. addr = parea.kernel_addr;
  511. data = parea.process_addr;
  512. copied = 0;
  513. while (copied < parea.len) {
  514. if (request == PTRACE_PEEKUSR_AREA)
  515. ret = peek_user_emu31(child, addr, data);
  516. else {
  517. __u32 utmp;
  518. if (get_user(utmp,
  519. (__u32 __force __user *) data))
  520. return -EFAULT;
  521. ret = poke_user_emu31(child, addr, utmp);
  522. }
  523. if (ret)
  524. return ret;
  525. addr += sizeof(unsigned int);
  526. data += sizeof(unsigned int);
  527. copied += sizeof(unsigned int);
  528. }
  529. return 0;
  530. case PTRACE_GETEVENTMSG:
  531. return put_user((__u32) child->ptrace_message,
  532. (unsigned int __force __user *) data);
  533. case PTRACE_GETSIGINFO:
  534. if (child->last_siginfo == NULL)
  535. return -EINVAL;
  536. return copy_siginfo_to_user32((compat_siginfo_t
  537. __force __user *) data,
  538. child->last_siginfo);
  539. case PTRACE_SETSIGINFO:
  540. if (child->last_siginfo == NULL)
  541. return -EINVAL;
  542. return copy_siginfo_from_user32(child->last_siginfo,
  543. (compat_siginfo_t
  544. __force __user *) data);
  545. }
  546. return ptrace_request(child, request, addr, data);
  547. }
  548. #endif
  549. #define PT32_IEEE_IP 0x13c
  550. static int
  551. do_ptrace(struct task_struct *child, long request, long addr, long data)
  552. {
  553. int ret;
  554. if (request == PTRACE_ATTACH)
  555. return ptrace_attach(child);
  556. /*
  557. * Special cases to get/store the ieee instructions pointer.
  558. */
  559. if (child == current) {
  560. if (request == PTRACE_PEEKUSR && addr == PT_IEEE_IP)
  561. return peek_user(child, addr, data);
  562. if (request == PTRACE_POKEUSR && addr == PT_IEEE_IP)
  563. return poke_user(child, addr, data);
  564. #ifdef CONFIG_COMPAT
  565. if (request == PTRACE_PEEKUSR &&
  566. addr == PT32_IEEE_IP && test_thread_flag(TIF_31BIT))
  567. return peek_user_emu31(child, addr, data);
  568. if (request == PTRACE_POKEUSR &&
  569. addr == PT32_IEEE_IP && test_thread_flag(TIF_31BIT))
  570. return poke_user_emu31(child, addr, data);
  571. #endif
  572. }
  573. ret = ptrace_check_attach(child, request == PTRACE_KILL);
  574. if (ret < 0)
  575. return ret;
  576. switch (request) {
  577. case PTRACE_SYSCALL:
  578. /* continue and stop at next (return from) syscall */
  579. case PTRACE_CONT:
  580. /* restart after signal. */
  581. if (!valid_signal(data))
  582. return -EIO;
  583. if (request == PTRACE_SYSCALL)
  584. set_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  585. else
  586. clear_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  587. child->exit_code = data;
  588. /* make sure the single step bit is not set. */
  589. clear_single_step(child);
  590. wake_up_process(child);
  591. return 0;
  592. case PTRACE_KILL:
  593. /*
  594. * make the child exit. Best I can do is send it a sigkill.
  595. * perhaps it should be put in the status that it wants to
  596. * exit.
  597. */
  598. if (child->exit_state == EXIT_ZOMBIE) /* already dead */
  599. return 0;
  600. child->exit_code = SIGKILL;
  601. /* make sure the single step bit is not set. */
  602. clear_single_step(child);
  603. wake_up_process(child);
  604. return 0;
  605. case PTRACE_SINGLESTEP:
  606. /* set the trap flag. */
  607. if (!valid_signal(data))
  608. return -EIO;
  609. clear_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  610. child->exit_code = data;
  611. if (data)
  612. set_tsk_thread_flag(child, TIF_SINGLE_STEP);
  613. else
  614. set_single_step(child);
  615. /* give it a chance to run. */
  616. wake_up_process(child);
  617. return 0;
  618. /* Do requests that differ for 31/64 bit */
  619. default:
  620. #ifdef CONFIG_COMPAT
  621. if (test_thread_flag(TIF_31BIT))
  622. return do_ptrace_emu31(child, request, addr, data);
  623. #endif
  624. return do_ptrace_normal(child, request, addr, data);
  625. }
  626. /* Not reached. */
  627. return -EIO;
  628. }
  629. asmlinkage long
  630. sys_ptrace(long request, long pid, long addr, long data)
  631. {
  632. struct task_struct *child;
  633. int ret;
  634. lock_kernel();
  635. if (request == PTRACE_TRACEME) {
  636. ret = ptrace_traceme();
  637. goto out;
  638. }
  639. child = ptrace_get_task_struct(pid);
  640. if (IS_ERR(child)) {
  641. ret = PTR_ERR(child);
  642. goto out;
  643. }
  644. ret = do_ptrace(child, request, addr, data);
  645. put_task_struct(child);
  646. out:
  647. unlock_kernel();
  648. return ret;
  649. }
  650. asmlinkage void
  651. syscall_trace(struct pt_regs *regs, int entryexit)
  652. {
  653. if (unlikely(current->audit_context) && entryexit)
  654. audit_syscall_exit(AUDITSC_RESULT(regs->gprs[2]), regs->gprs[2]);
  655. if (!test_thread_flag(TIF_SYSCALL_TRACE))
  656. goto out;
  657. if (!(current->ptrace & PT_PTRACED))
  658. goto out;
  659. ptrace_notify(SIGTRAP | ((current->ptrace & PT_TRACESYSGOOD)
  660. ? 0x80 : 0));
  661. /*
  662. * If the debuffer has set an invalid system call number,
  663. * we prepare to skip the system call restart handling.
  664. */
  665. if (!entryexit && regs->gprs[2] >= NR_syscalls)
  666. regs->trap = -1;
  667. /*
  668. * this isn't the same as continuing with a signal, but it will do
  669. * for normal use. strace only continues with a signal if the
  670. * stopping signal is not SIGTRAP. -brl
  671. */
  672. if (current->exit_code) {
  673. send_sig(current->exit_code, current, 1);
  674. current->exit_code = 0;
  675. }
  676. out:
  677. if (unlikely(current->audit_context) && !entryexit)
  678. audit_syscall_entry(test_thread_flag(TIF_31BIT)?AUDIT_ARCH_S390:AUDIT_ARCH_S390X,
  679. regs->gprs[2], regs->orig_gpr2, regs->gprs[3],
  680. regs->gprs[4], regs->gprs[5]);
  681. }