ptrace.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507
  1. /*
  2. * linux/kernel/ptrace.c
  3. *
  4. * (C) Copyright 1999 Linus Torvalds
  5. *
  6. * Common interfaces for "ptrace()" which we do not want
  7. * to continually duplicate across every architecture.
  8. */
  9. #include <linux/capability.h>
  10. #include <linux/module.h>
  11. #include <linux/sched.h>
  12. #include <linux/errno.h>
  13. #include <linux/mm.h>
  14. #include <linux/highmem.h>
  15. #include <linux/pagemap.h>
  16. #include <linux/smp_lock.h>
  17. #include <linux/ptrace.h>
  18. #include <linux/security.h>
  19. #include <linux/signal.h>
  20. #include <asm/pgtable.h>
  21. #include <asm/uaccess.h>
  22. /*
  23. * ptrace a task: make the debugger its new parent and
  24. * move it to the ptrace list.
  25. *
  26. * Must be called with the tasklist lock write-held.
  27. */
  28. void __ptrace_link(task_t *child, task_t *new_parent)
  29. {
  30. BUG_ON(!list_empty(&child->ptrace_list));
  31. if (child->parent == new_parent)
  32. return;
  33. list_add(&child->ptrace_list, &child->parent->ptrace_children);
  34. remove_parent(child);
  35. child->parent = new_parent;
  36. add_parent(child);
  37. }
  38. /*
  39. * Turn a tracing stop into a normal stop now, since with no tracer there
  40. * would be no way to wake it up with SIGCONT or SIGKILL. If there was a
  41. * signal sent that would resume the child, but didn't because it was in
  42. * TASK_TRACED, resume it now.
  43. * Requires that irqs be disabled.
  44. */
  45. void ptrace_untrace(task_t *child)
  46. {
  47. spin_lock(&child->sighand->siglock);
  48. if (child->state == TASK_TRACED) {
  49. if (child->signal->flags & SIGNAL_STOP_STOPPED) {
  50. child->state = TASK_STOPPED;
  51. } else {
  52. signal_wake_up(child, 1);
  53. }
  54. }
  55. spin_unlock(&child->sighand->siglock);
  56. }
  57. /*
  58. * unptrace a task: move it back to its original parent and
  59. * remove it from the ptrace list.
  60. *
  61. * Must be called with the tasklist lock write-held.
  62. */
  63. void __ptrace_unlink(task_t *child)
  64. {
  65. BUG_ON(!child->ptrace);
  66. child->ptrace = 0;
  67. if (!list_empty(&child->ptrace_list)) {
  68. list_del_init(&child->ptrace_list);
  69. remove_parent(child);
  70. child->parent = child->real_parent;
  71. add_parent(child);
  72. }
  73. if (child->state == TASK_TRACED)
  74. ptrace_untrace(child);
  75. }
  76. /*
  77. * Check that we have indeed attached to the thing..
  78. */
  79. int ptrace_check_attach(struct task_struct *child, int kill)
  80. {
  81. int ret = -ESRCH;
  82. /*
  83. * We take the read lock around doing both checks to close a
  84. * possible race where someone else was tracing our child and
  85. * detached between these two checks. After this locked check,
  86. * we are sure that this is our traced child and that can only
  87. * be changed by us so it's not changing right after this.
  88. */
  89. read_lock(&tasklist_lock);
  90. if ((child->ptrace & PT_PTRACED) && child->parent == current &&
  91. (!(child->ptrace & PT_ATTACHED) || child->real_parent != current)
  92. && child->signal != NULL) {
  93. ret = 0;
  94. spin_lock_irq(&child->sighand->siglock);
  95. if (child->state == TASK_STOPPED) {
  96. child->state = TASK_TRACED;
  97. } else if (child->state != TASK_TRACED && !kill) {
  98. ret = -ESRCH;
  99. }
  100. spin_unlock_irq(&child->sighand->siglock);
  101. }
  102. read_unlock(&tasklist_lock);
  103. if (!ret && !kill) {
  104. wait_task_inactive(child);
  105. }
  106. /* All systems go.. */
  107. return ret;
  108. }
  109. static int may_attach(struct task_struct *task)
  110. {
  111. if (!task->mm)
  112. return -EPERM;
  113. if (((current->uid != task->euid) ||
  114. (current->uid != task->suid) ||
  115. (current->uid != task->uid) ||
  116. (current->gid != task->egid) ||
  117. (current->gid != task->sgid) ||
  118. (current->gid != task->gid)) && !capable(CAP_SYS_PTRACE))
  119. return -EPERM;
  120. smp_rmb();
  121. if (!task->mm->dumpable && !capable(CAP_SYS_PTRACE))
  122. return -EPERM;
  123. return security_ptrace(current, task);
  124. }
  125. int ptrace_may_attach(struct task_struct *task)
  126. {
  127. int err;
  128. task_lock(task);
  129. err = may_attach(task);
  130. task_unlock(task);
  131. return !err;
  132. }
  133. int ptrace_attach(struct task_struct *task)
  134. {
  135. int retval;
  136. task_lock(task);
  137. retval = -EPERM;
  138. if (task->pid <= 1)
  139. goto bad;
  140. if (task->tgid == current->tgid)
  141. goto bad;
  142. /* the same process cannot be attached many times */
  143. if (task->ptrace & PT_PTRACED)
  144. goto bad;
  145. retval = may_attach(task);
  146. if (retval)
  147. goto bad;
  148. /* Go */
  149. task->ptrace |= PT_PTRACED | ((task->real_parent != current)
  150. ? PT_ATTACHED : 0);
  151. if (capable(CAP_SYS_PTRACE))
  152. task->ptrace |= PT_PTRACE_CAP;
  153. task_unlock(task);
  154. write_lock_irq(&tasklist_lock);
  155. __ptrace_link(task, current);
  156. write_unlock_irq(&tasklist_lock);
  157. force_sig_specific(SIGSTOP, task);
  158. return 0;
  159. bad:
  160. task_unlock(task);
  161. return retval;
  162. }
  163. void __ptrace_detach(struct task_struct *child, unsigned int data)
  164. {
  165. child->exit_code = data;
  166. /* .. re-parent .. */
  167. __ptrace_unlink(child);
  168. /* .. and wake it up. */
  169. if (child->exit_state != EXIT_ZOMBIE)
  170. wake_up_process(child);
  171. }
  172. int ptrace_detach(struct task_struct *child, unsigned int data)
  173. {
  174. if (!valid_signal(data))
  175. return -EIO;
  176. /* Architecture-specific hardware disable .. */
  177. ptrace_disable(child);
  178. write_lock_irq(&tasklist_lock);
  179. if (child->ptrace)
  180. __ptrace_detach(child, data);
  181. write_unlock_irq(&tasklist_lock);
  182. return 0;
  183. }
  184. /*
  185. * Access another process' address space.
  186. * Source/target buffer must be kernel space,
  187. * Do not walk the page table directly, use get_user_pages
  188. */
  189. int access_process_vm(struct task_struct *tsk, unsigned long addr, void *buf, int len, int write)
  190. {
  191. struct mm_struct *mm;
  192. struct vm_area_struct *vma;
  193. struct page *page;
  194. void *old_buf = buf;
  195. mm = get_task_mm(tsk);
  196. if (!mm)
  197. return 0;
  198. down_read(&mm->mmap_sem);
  199. /* ignore errors, just check how much was sucessfully transfered */
  200. while (len) {
  201. int bytes, ret, offset;
  202. void *maddr;
  203. ret = get_user_pages(tsk, mm, addr, 1,
  204. write, 1, &page, &vma);
  205. if (ret <= 0)
  206. break;
  207. bytes = len;
  208. offset = addr & (PAGE_SIZE-1);
  209. if (bytes > PAGE_SIZE-offset)
  210. bytes = PAGE_SIZE-offset;
  211. maddr = kmap(page);
  212. if (write) {
  213. copy_to_user_page(vma, page, addr,
  214. maddr + offset, buf, bytes);
  215. set_page_dirty_lock(page);
  216. } else {
  217. copy_from_user_page(vma, page, addr,
  218. buf, maddr + offset, bytes);
  219. }
  220. kunmap(page);
  221. page_cache_release(page);
  222. len -= bytes;
  223. buf += bytes;
  224. addr += bytes;
  225. }
  226. up_read(&mm->mmap_sem);
  227. mmput(mm);
  228. return buf - old_buf;
  229. }
  230. int ptrace_readdata(struct task_struct *tsk, unsigned long src, char __user *dst, int len)
  231. {
  232. int copied = 0;
  233. while (len > 0) {
  234. char buf[128];
  235. int this_len, retval;
  236. this_len = (len > sizeof(buf)) ? sizeof(buf) : len;
  237. retval = access_process_vm(tsk, src, buf, this_len, 0);
  238. if (!retval) {
  239. if (copied)
  240. break;
  241. return -EIO;
  242. }
  243. if (copy_to_user(dst, buf, retval))
  244. return -EFAULT;
  245. copied += retval;
  246. src += retval;
  247. dst += retval;
  248. len -= retval;
  249. }
  250. return copied;
  251. }
  252. int ptrace_writedata(struct task_struct *tsk, char __user *src, unsigned long dst, int len)
  253. {
  254. int copied = 0;
  255. while (len > 0) {
  256. char buf[128];
  257. int this_len, retval;
  258. this_len = (len > sizeof(buf)) ? sizeof(buf) : len;
  259. if (copy_from_user(buf, src, this_len))
  260. return -EFAULT;
  261. retval = access_process_vm(tsk, dst, buf, this_len, 1);
  262. if (!retval) {
  263. if (copied)
  264. break;
  265. return -EIO;
  266. }
  267. copied += retval;
  268. src += retval;
  269. dst += retval;
  270. len -= retval;
  271. }
  272. return copied;
  273. }
  274. static int ptrace_setoptions(struct task_struct *child, long data)
  275. {
  276. child->ptrace &= ~PT_TRACE_MASK;
  277. if (data & PTRACE_O_TRACESYSGOOD)
  278. child->ptrace |= PT_TRACESYSGOOD;
  279. if (data & PTRACE_O_TRACEFORK)
  280. child->ptrace |= PT_TRACE_FORK;
  281. if (data & PTRACE_O_TRACEVFORK)
  282. child->ptrace |= PT_TRACE_VFORK;
  283. if (data & PTRACE_O_TRACECLONE)
  284. child->ptrace |= PT_TRACE_CLONE;
  285. if (data & PTRACE_O_TRACEEXEC)
  286. child->ptrace |= PT_TRACE_EXEC;
  287. if (data & PTRACE_O_TRACEVFORKDONE)
  288. child->ptrace |= PT_TRACE_VFORK_DONE;
  289. if (data & PTRACE_O_TRACEEXIT)
  290. child->ptrace |= PT_TRACE_EXIT;
  291. return (data & ~PTRACE_O_MASK) ? -EINVAL : 0;
  292. }
  293. static int ptrace_getsiginfo(struct task_struct *child, siginfo_t __user * data)
  294. {
  295. siginfo_t lastinfo;
  296. int error = -ESRCH;
  297. read_lock(&tasklist_lock);
  298. if (likely(child->sighand != NULL)) {
  299. error = -EINVAL;
  300. spin_lock_irq(&child->sighand->siglock);
  301. if (likely(child->last_siginfo != NULL)) {
  302. lastinfo = *child->last_siginfo;
  303. error = 0;
  304. }
  305. spin_unlock_irq(&child->sighand->siglock);
  306. }
  307. read_unlock(&tasklist_lock);
  308. if (!error)
  309. return copy_siginfo_to_user(data, &lastinfo);
  310. return error;
  311. }
  312. static int ptrace_setsiginfo(struct task_struct *child, siginfo_t __user * data)
  313. {
  314. siginfo_t newinfo;
  315. int error = -ESRCH;
  316. if (copy_from_user(&newinfo, data, sizeof (siginfo_t)))
  317. return -EFAULT;
  318. read_lock(&tasklist_lock);
  319. if (likely(child->sighand != NULL)) {
  320. error = -EINVAL;
  321. spin_lock_irq(&child->sighand->siglock);
  322. if (likely(child->last_siginfo != NULL)) {
  323. *child->last_siginfo = newinfo;
  324. error = 0;
  325. }
  326. spin_unlock_irq(&child->sighand->siglock);
  327. }
  328. read_unlock(&tasklist_lock);
  329. return error;
  330. }
  331. int ptrace_request(struct task_struct *child, long request,
  332. long addr, long data)
  333. {
  334. int ret = -EIO;
  335. switch (request) {
  336. #ifdef PTRACE_OLDSETOPTIONS
  337. case PTRACE_OLDSETOPTIONS:
  338. #endif
  339. case PTRACE_SETOPTIONS:
  340. ret = ptrace_setoptions(child, data);
  341. break;
  342. case PTRACE_GETEVENTMSG:
  343. ret = put_user(child->ptrace_message, (unsigned long __user *) data);
  344. break;
  345. case PTRACE_GETSIGINFO:
  346. ret = ptrace_getsiginfo(child, (siginfo_t __user *) data);
  347. break;
  348. case PTRACE_SETSIGINFO:
  349. ret = ptrace_setsiginfo(child, (siginfo_t __user *) data);
  350. break;
  351. default:
  352. break;
  353. }
  354. return ret;
  355. }
  356. /**
  357. * ptrace_traceme -- helper for PTRACE_TRACEME
  358. *
  359. * Performs checks and sets PT_PTRACED.
  360. * Should be used by all ptrace implementations for PTRACE_TRACEME.
  361. */
  362. int ptrace_traceme(void)
  363. {
  364. int ret;
  365. /*
  366. * Are we already being traced?
  367. */
  368. if (current->ptrace & PT_PTRACED)
  369. return -EPERM;
  370. ret = security_ptrace(current->parent, current);
  371. if (ret)
  372. return -EPERM;
  373. /*
  374. * Set the ptrace bit in the process ptrace flags.
  375. */
  376. current->ptrace |= PT_PTRACED;
  377. return 0;
  378. }
  379. /**
  380. * ptrace_get_task_struct -- grab a task struct reference for ptrace
  381. * @pid: process id to grab a task_struct reference of
  382. *
  383. * This function is a helper for ptrace implementations. It checks
  384. * permissions and then grabs a task struct for use of the actual
  385. * ptrace implementation.
  386. *
  387. * Returns the task_struct for @pid or an ERR_PTR() on failure.
  388. */
  389. struct task_struct *ptrace_get_task_struct(pid_t pid)
  390. {
  391. struct task_struct *child;
  392. /*
  393. * Tracing init is not allowed.
  394. */
  395. if (pid == 1)
  396. return ERR_PTR(-EPERM);
  397. read_lock(&tasklist_lock);
  398. child = find_task_by_pid(pid);
  399. if (child)
  400. get_task_struct(child);
  401. read_unlock(&tasklist_lock);
  402. if (!child)
  403. return ERR_PTR(-ESRCH);
  404. return child;
  405. }
  406. #ifndef __ARCH_SYS_PTRACE
  407. asmlinkage long sys_ptrace(long request, long pid, long addr, long data)
  408. {
  409. struct task_struct *child;
  410. long ret;
  411. /*
  412. * This lock_kernel fixes a subtle race with suid exec
  413. */
  414. lock_kernel();
  415. if (request == PTRACE_TRACEME) {
  416. ret = ptrace_traceme();
  417. goto out;
  418. }
  419. child = ptrace_get_task_struct(pid);
  420. if (IS_ERR(child)) {
  421. ret = PTR_ERR(child);
  422. goto out;
  423. }
  424. if (request == PTRACE_ATTACH) {
  425. ret = ptrace_attach(child);
  426. goto out_put_task_struct;
  427. }
  428. ret = ptrace_check_attach(child, request == PTRACE_KILL);
  429. if (ret < 0)
  430. goto out_put_task_struct;
  431. ret = arch_ptrace(child, request, addr, data);
  432. if (ret < 0)
  433. goto out_put_task_struct;
  434. out_put_task_struct:
  435. put_task_struct(child);
  436. out:
  437. unlock_kernel();
  438. return ret;
  439. }
  440. #endif /* __ARCH_SYS_PTRACE */