ptrace.c 21 KB

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