ptrace.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440
  1. /*
  2. * File: arch/blackfin/kernel/ptrace.c
  3. * Based on: Taken from linux/kernel/ptrace.c
  4. * Author: linux/kernel/ptrace.c is by Ross Biro 1/23/92, edited by Linus Torvalds
  5. *
  6. * Created: 1/23/92
  7. * Description:
  8. *
  9. * Modified:
  10. * Copyright 2004-2006 Analog Devices Inc.
  11. *
  12. * Bugs: Enter bugs at http://blackfin.uclinux.org/
  13. *
  14. * This program is free software; you can redistribute it and/or modify
  15. * it under the terms of the GNU General Public License as published by
  16. * the Free Software Foundation; either version 2 of the License, or
  17. * (at your option) any later version.
  18. *
  19. * This program is distributed in the hope that it will be useful,
  20. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  21. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  22. * GNU General Public License for more details.
  23. *
  24. * You should have received a copy of the GNU General Public License
  25. * along with this program; if not, see the file COPYING, or write
  26. * to the Free Software Foundation, Inc.,
  27. * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  28. */
  29. #include <linux/kernel.h>
  30. #include <linux/sched.h>
  31. #include <linux/mm.h>
  32. #include <linux/smp.h>
  33. #include <linux/smp_lock.h>
  34. #include <linux/errno.h>
  35. #include <linux/ptrace.h>
  36. #include <linux/user.h>
  37. #include <linux/signal.h>
  38. #include <linux/uaccess.h>
  39. #include <asm/page.h>
  40. #include <asm/pgtable.h>
  41. #include <asm/system.h>
  42. #include <asm/processor.h>
  43. #include <asm/asm-offsets.h>
  44. #include <asm/dma.h>
  45. #include <asm/fixed_code.h>
  46. #define TEXT_OFFSET 0
  47. /*
  48. * does not yet catch signals sent when the child dies.
  49. * in exit.c or in signal.c.
  50. */
  51. /* determines which bits in the SYSCFG reg the user has access to. */
  52. /* 1 = access 0 = no access */
  53. #define SYSCFG_MASK 0x0007 /* SYSCFG reg */
  54. /* sets the trace bits. */
  55. #define TRACE_BITS 0x0001
  56. /* Find the stack offset for a register, relative to thread.esp0. */
  57. #define PT_REG(reg) ((long)&((struct pt_regs *)0)->reg)
  58. /*
  59. * Get the address of the live pt_regs for the specified task.
  60. * These are saved onto the top kernel stack when the process
  61. * is not running.
  62. *
  63. * Note: if a user thread is execve'd from kernel space, the
  64. * kernel stack will not be empty on entry to the kernel, so
  65. * ptracing these tasks will fail.
  66. */
  67. static inline struct pt_regs *get_user_regs(struct task_struct *task)
  68. {
  69. return (struct pt_regs *)
  70. ((unsigned long)task_stack_page(task) +
  71. (THREAD_SIZE - sizeof(struct pt_regs)));
  72. }
  73. /*
  74. * Get all user integer registers.
  75. */
  76. static inline int ptrace_getregs(struct task_struct *tsk, void __user *uregs)
  77. {
  78. struct pt_regs regs;
  79. memcpy(&regs, get_user_regs(tsk), sizeof(regs));
  80. regs.usp = tsk->thread.usp;
  81. return copy_to_user(uregs, &regs, sizeof(struct pt_regs)) ? -EFAULT : 0;
  82. }
  83. /* Mapping from PT_xxx to the stack offset at which the register is
  84. * saved. Notice that usp has no stack-slot and needs to be treated
  85. * specially (see get_reg/put_reg below).
  86. */
  87. /*
  88. * Get contents of register REGNO in task TASK.
  89. */
  90. static inline long get_reg(struct task_struct *task, int regno)
  91. {
  92. unsigned char *reg_ptr;
  93. struct pt_regs *regs =
  94. (struct pt_regs *)((unsigned long)task_stack_page(task) +
  95. (THREAD_SIZE - sizeof(struct pt_regs)));
  96. reg_ptr = (char *)regs;
  97. switch (regno) {
  98. case PT_USP:
  99. return task->thread.usp;
  100. default:
  101. if (regno <= 216)
  102. return *(long *)(reg_ptr + regno);
  103. }
  104. /* slight mystery ... never seems to come here but kernel misbehaves without this code! */
  105. printk(KERN_WARNING "Request to get for unknown register %d\n", regno);
  106. return 0;
  107. }
  108. /*
  109. * Write contents of register REGNO in task TASK.
  110. */
  111. static inline int
  112. put_reg(struct task_struct *task, int regno, unsigned long data)
  113. {
  114. char *reg_ptr;
  115. struct pt_regs *regs =
  116. (struct pt_regs *)((unsigned long)task_stack_page(task) +
  117. (THREAD_SIZE - sizeof(struct pt_regs)));
  118. reg_ptr = (char *)regs;
  119. switch (regno) {
  120. case PT_PC:
  121. /*********************************************************************/
  122. /* At this point the kernel is most likely in exception. */
  123. /* The RETX register will be used to populate the pc of the process. */
  124. /*********************************************************************/
  125. regs->retx = data;
  126. regs->pc = data;
  127. break;
  128. case PT_RETX:
  129. break; /* regs->retx = data; break; */
  130. case PT_USP:
  131. regs->usp = data;
  132. task->thread.usp = data;
  133. break;
  134. default:
  135. if (regno <= 216)
  136. *(long *)(reg_ptr + regno) = data;
  137. }
  138. return 0;
  139. }
  140. /*
  141. * check that an address falls within the bounds of the target process's memory mappings
  142. */
  143. static inline int is_user_addr_valid(struct task_struct *child,
  144. unsigned long start, unsigned long len)
  145. {
  146. struct vm_list_struct *vml;
  147. struct sram_list_struct *sraml;
  148. /* overflow */
  149. if (start + len < start)
  150. return -EIO;
  151. for (vml = child->mm->context.vmlist; vml; vml = vml->next)
  152. if (start >= vml->vma->vm_start && start + len < vml->vma->vm_end)
  153. return 0;
  154. for (sraml = child->mm->context.sram_list; sraml; sraml = sraml->next)
  155. if (start >= (unsigned long)sraml->addr
  156. && start + len < (unsigned long)sraml->addr + sraml->length)
  157. return 0;
  158. if (start >= FIXED_CODE_START && start + len < FIXED_CODE_END)
  159. return 0;
  160. return -EIO;
  161. }
  162. void ptrace_enable(struct task_struct *child)
  163. {
  164. unsigned long tmp;
  165. tmp = get_reg(child, PT_SYSCFG) | (TRACE_BITS);
  166. put_reg(child, PT_SYSCFG, tmp);
  167. }
  168. /*
  169. * Called by kernel/ptrace.c when detaching..
  170. *
  171. * Make sure the single step bit is not set.
  172. */
  173. void ptrace_disable(struct task_struct *child)
  174. {
  175. unsigned long tmp;
  176. /* make sure the single step bit is not set. */
  177. tmp = get_reg(child, PT_SYSCFG) & ~TRACE_BITS;
  178. put_reg(child, PT_SYSCFG, tmp);
  179. }
  180. long arch_ptrace(struct task_struct *child, long request, long addr, long data)
  181. {
  182. int ret;
  183. unsigned long __user *datap = (unsigned long __user *)data;
  184. switch (request) {
  185. /* when I and D space are separate, these will need to be fixed. */
  186. case PTRACE_PEEKDATA:
  187. pr_debug("ptrace: PEEKDATA\n");
  188. /* fall through */
  189. case PTRACE_PEEKTEXT: /* read word at location addr. */
  190. {
  191. unsigned long tmp = 0;
  192. int copied;
  193. ret = -EIO;
  194. pr_debug("ptrace: PEEKTEXT at addr 0x%08lx + %ld\n", addr, sizeof(data));
  195. if (is_user_addr_valid(child, addr, sizeof(tmp)) < 0)
  196. break;
  197. pr_debug("ptrace: user address is valid\n");
  198. if (L1_CODE_LENGTH != 0 && addr >= get_l1_code_start()
  199. && addr + sizeof(tmp) <= get_l1_code_start() + L1_CODE_LENGTH) {
  200. safe_dma_memcpy (&tmp, (const void *)(addr), sizeof(tmp));
  201. copied = sizeof(tmp);
  202. } else if (L1_DATA_A_LENGTH != 0 && addr >= L1_DATA_A_START
  203. && addr + sizeof(tmp) <= L1_DATA_A_START + L1_DATA_A_LENGTH) {
  204. memcpy(&tmp, (const void *)(addr), sizeof(tmp));
  205. copied = sizeof(tmp);
  206. } else if (L1_DATA_B_LENGTH != 0 && addr >= L1_DATA_B_START
  207. && addr + sizeof(tmp) <= L1_DATA_B_START + L1_DATA_B_LENGTH) {
  208. memcpy(&tmp, (const void *)(addr), sizeof(tmp));
  209. copied = sizeof(tmp);
  210. } else if (addr >= FIXED_CODE_START
  211. && addr + sizeof(tmp) <= FIXED_CODE_END) {
  212. memcpy(&tmp, (const void *)(addr), sizeof(tmp));
  213. copied = sizeof(tmp);
  214. } else
  215. copied = access_process_vm(child, addr, &tmp,
  216. sizeof(tmp), 0);
  217. pr_debug("ptrace: copied size %d [0x%08lx]\n", copied, tmp);
  218. if (copied != sizeof(tmp))
  219. break;
  220. ret = put_user(tmp, datap);
  221. break;
  222. }
  223. /* read the word at location addr in the USER area. */
  224. case PTRACE_PEEKUSR:
  225. {
  226. unsigned long tmp;
  227. ret = -EIO;
  228. tmp = 0;
  229. if ((addr & 3) || (addr > (sizeof(struct pt_regs) + 16))) {
  230. printk(KERN_WARNING "ptrace error : PEEKUSR : temporarily returning "
  231. "0 - %x sizeof(pt_regs) is %lx\n",
  232. (int)addr, sizeof(struct pt_regs));
  233. break;
  234. }
  235. if (addr == sizeof(struct pt_regs)) {
  236. /* PT_TEXT_ADDR */
  237. tmp = child->mm->start_code + TEXT_OFFSET;
  238. } else if (addr == (sizeof(struct pt_regs) + 4)) {
  239. /* PT_TEXT_END_ADDR */
  240. tmp = child->mm->end_code;
  241. } else if (addr == (sizeof(struct pt_regs) + 8)) {
  242. /* PT_DATA_ADDR */
  243. tmp = child->mm->start_data;
  244. #ifdef CONFIG_BINFMT_ELF_FDPIC
  245. } else if (addr == (sizeof(struct pt_regs) + 12)) {
  246. tmp = child->mm->context.exec_fdpic_loadmap;
  247. } else if (addr == (sizeof(struct pt_regs) + 16)) {
  248. tmp = child->mm->context.interp_fdpic_loadmap;
  249. #endif
  250. } else {
  251. tmp = get_reg(child, addr);
  252. }
  253. ret = put_user(tmp, datap);
  254. break;
  255. }
  256. /* when I and D space are separate, this will have to be fixed. */
  257. case PTRACE_POKEDATA:
  258. pr_debug("ptrace: PTRACE_PEEKDATA\n");
  259. /* fall through */
  260. case PTRACE_POKETEXT: /* write the word at location addr. */
  261. {
  262. int copied;
  263. ret = -EIO;
  264. pr_debug("ptrace: POKETEXT at addr 0x%08lx + %ld bytes %lx\n",
  265. addr, sizeof(data), data);
  266. if (is_user_addr_valid(child, addr, sizeof(data)) < 0)
  267. break;
  268. pr_debug("ptrace: user address is valid\n");
  269. if (L1_CODE_LENGTH != 0 && addr >= get_l1_code_start()
  270. && addr + sizeof(data) <= get_l1_code_start() + L1_CODE_LENGTH) {
  271. safe_dma_memcpy ((void *)(addr), &data, sizeof(data));
  272. copied = sizeof(data);
  273. } else if (L1_DATA_A_LENGTH != 0 && addr >= L1_DATA_A_START
  274. && addr + sizeof(data) <= L1_DATA_A_START + L1_DATA_A_LENGTH) {
  275. memcpy((void *)(addr), &data, sizeof(data));
  276. copied = sizeof(data);
  277. } else if (L1_DATA_B_LENGTH != 0 && addr >= L1_DATA_B_START
  278. && addr + sizeof(data) <= L1_DATA_B_START + L1_DATA_B_LENGTH) {
  279. memcpy((void *)(addr), &data, sizeof(data));
  280. copied = sizeof(data);
  281. } else if (addr >= FIXED_CODE_START
  282. && addr + sizeof(data) <= FIXED_CODE_END) {
  283. memcpy((void *)(addr), &data, sizeof(data));
  284. copied = sizeof(data);
  285. } else
  286. copied = access_process_vm(child, addr, &data,
  287. sizeof(data), 1);
  288. pr_debug("ptrace: copied size %d\n", copied);
  289. if (copied != sizeof(data))
  290. break;
  291. ret = 0;
  292. break;
  293. }
  294. case PTRACE_POKEUSR: /* write the word at location addr in the USER area */
  295. ret = -EIO;
  296. if ((addr & 3) || (addr > (sizeof(struct pt_regs) + 16))) {
  297. printk(KERN_WARNING "ptrace error : POKEUSR: temporarily returning 0\n");
  298. break;
  299. }
  300. if (addr >= (sizeof(struct pt_regs))) {
  301. ret = 0;
  302. break;
  303. }
  304. if (addr == PT_SYSCFG) {
  305. data &= SYSCFG_MASK;
  306. data |= get_reg(child, PT_SYSCFG);
  307. }
  308. ret = put_reg(child, addr, data);
  309. break;
  310. case PTRACE_SYSCALL: /* continue and stop at next (return from) syscall */
  311. case PTRACE_CONT: /* restart after signal. */
  312. pr_debug("ptrace: syscall/cont\n");
  313. ret = -EIO;
  314. if (!valid_signal(data))
  315. break;
  316. if (request == PTRACE_SYSCALL)
  317. set_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  318. else
  319. clear_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  320. child->exit_code = data;
  321. ptrace_disable(child);
  322. pr_debug("ptrace: before wake_up_process\n");
  323. wake_up_process(child);
  324. ret = 0;
  325. break;
  326. /*
  327. * make the child exit. Best I can do is send it a sigkill.
  328. * perhaps it should be put in the status that it wants to
  329. * exit.
  330. */
  331. case PTRACE_KILL:
  332. ret = 0;
  333. if (child->exit_state == EXIT_ZOMBIE) /* already dead */
  334. break;
  335. child->exit_code = SIGKILL;
  336. ptrace_disable(child);
  337. wake_up_process(child);
  338. break;
  339. case PTRACE_SINGLESTEP: /* set the trap flag. */
  340. pr_debug("ptrace: single step\n");
  341. ret = -EIO;
  342. if (!valid_signal(data))
  343. break;
  344. clear_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  345. ptrace_enable(child);
  346. child->exit_code = data;
  347. wake_up_process(child);
  348. ret = 0;
  349. break;
  350. case PTRACE_GETREGS:
  351. /* Get all gp regs from the child. */
  352. ret = ptrace_getregs(child, datap);
  353. break;
  354. case PTRACE_SETREGS:
  355. printk(KERN_WARNING "ptrace: SETREGS: **** NOT IMPLEMENTED ***\n");
  356. /* Set all gp regs in the child. */
  357. ret = 0;
  358. break;
  359. default:
  360. ret = ptrace_request(child, request, addr, data);
  361. break;
  362. }
  363. return ret;
  364. }
  365. asmlinkage void syscall_trace(void)
  366. {
  367. if (!test_thread_flag(TIF_SYSCALL_TRACE))
  368. return;
  369. if (!(current->ptrace & PT_PTRACED))
  370. return;
  371. /* the 0x80 provides a way for the tracing parent to distinguish
  372. * between a syscall stop and SIGTRAP delivery
  373. */
  374. ptrace_notify(SIGTRAP | ((current->ptrace & PT_TRACESYSGOOD)
  375. ? 0x80 : 0));
  376. /*
  377. * this isn't the same as continuing with a signal, but it will do
  378. * for normal use. strace only continues with a signal if the
  379. * stopping signal is not SIGTRAP. -brl
  380. */
  381. if (current->exit_code) {
  382. send_sig(current->exit_code, current, 1);
  383. current->exit_code = 0;
  384. }
  385. }