ptrace.c 12 KB

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