ptrace.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528
  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. retval = -EPERM;
  137. if (task->pid <= 1)
  138. goto out;
  139. if (task->tgid == current->tgid)
  140. goto out;
  141. repeat:
  142. /*
  143. * Nasty, nasty.
  144. *
  145. * We want to hold both the task-lock and the
  146. * tasklist_lock for writing at the same time.
  147. * But that's against the rules (tasklist_lock
  148. * is taken for reading by interrupts on other
  149. * cpu's that may have task_lock).
  150. */
  151. task_lock(task);
  152. local_irq_disable();
  153. if (!write_trylock(&tasklist_lock)) {
  154. local_irq_enable();
  155. task_unlock(task);
  156. do {
  157. cpu_relax();
  158. } while (!write_can_lock(&tasklist_lock));
  159. goto repeat;
  160. }
  161. /* the same process cannot be attached many times */
  162. if (task->ptrace & PT_PTRACED)
  163. goto bad;
  164. retval = may_attach(task);
  165. if (retval)
  166. goto bad;
  167. /* Go */
  168. task->ptrace |= PT_PTRACED | ((task->real_parent != current)
  169. ? PT_ATTACHED : 0);
  170. if (capable(CAP_SYS_PTRACE))
  171. task->ptrace |= PT_PTRACE_CAP;
  172. __ptrace_link(task, current);
  173. force_sig_specific(SIGSTOP, task);
  174. bad:
  175. write_unlock_irq(&tasklist_lock);
  176. task_unlock(task);
  177. out:
  178. return retval;
  179. }
  180. void __ptrace_detach(struct task_struct *child, unsigned int data)
  181. {
  182. child->exit_code = data;
  183. /* .. re-parent .. */
  184. __ptrace_unlink(child);
  185. /* .. and wake it up. */
  186. if (child->exit_state != EXIT_ZOMBIE)
  187. wake_up_process(child);
  188. }
  189. int ptrace_detach(struct task_struct *child, unsigned int data)
  190. {
  191. if (!valid_signal(data))
  192. return -EIO;
  193. /* Architecture-specific hardware disable .. */
  194. ptrace_disable(child);
  195. write_lock_irq(&tasklist_lock);
  196. if (child->ptrace)
  197. __ptrace_detach(child, data);
  198. write_unlock_irq(&tasklist_lock);
  199. return 0;
  200. }
  201. /*
  202. * Access another process' address space.
  203. * Source/target buffer must be kernel space,
  204. * Do not walk the page table directly, use get_user_pages
  205. */
  206. int access_process_vm(struct task_struct *tsk, unsigned long addr, void *buf, int len, int write)
  207. {
  208. struct mm_struct *mm;
  209. struct vm_area_struct *vma;
  210. struct page *page;
  211. void *old_buf = buf;
  212. mm = get_task_mm(tsk);
  213. if (!mm)
  214. return 0;
  215. down_read(&mm->mmap_sem);
  216. /* ignore errors, just check how much was sucessfully transfered */
  217. while (len) {
  218. int bytes, ret, offset;
  219. void *maddr;
  220. ret = get_user_pages(tsk, mm, addr, 1,
  221. write, 1, &page, &vma);
  222. if (ret <= 0)
  223. break;
  224. bytes = len;
  225. offset = addr & (PAGE_SIZE-1);
  226. if (bytes > PAGE_SIZE-offset)
  227. bytes = PAGE_SIZE-offset;
  228. maddr = kmap(page);
  229. if (write) {
  230. copy_to_user_page(vma, page, addr,
  231. maddr + offset, buf, bytes);
  232. set_page_dirty_lock(page);
  233. } else {
  234. copy_from_user_page(vma, page, addr,
  235. buf, maddr + offset, bytes);
  236. }
  237. kunmap(page);
  238. page_cache_release(page);
  239. len -= bytes;
  240. buf += bytes;
  241. addr += bytes;
  242. }
  243. up_read(&mm->mmap_sem);
  244. mmput(mm);
  245. return buf - old_buf;
  246. }
  247. int ptrace_readdata(struct task_struct *tsk, unsigned long src, char __user *dst, int len)
  248. {
  249. int copied = 0;
  250. while (len > 0) {
  251. char buf[128];
  252. int this_len, retval;
  253. this_len = (len > sizeof(buf)) ? sizeof(buf) : len;
  254. retval = access_process_vm(tsk, src, buf, this_len, 0);
  255. if (!retval) {
  256. if (copied)
  257. break;
  258. return -EIO;
  259. }
  260. if (copy_to_user(dst, buf, retval))
  261. return -EFAULT;
  262. copied += retval;
  263. src += retval;
  264. dst += retval;
  265. len -= retval;
  266. }
  267. return copied;
  268. }
  269. int ptrace_writedata(struct task_struct *tsk, char __user *src, unsigned long dst, int len)
  270. {
  271. int copied = 0;
  272. while (len > 0) {
  273. char buf[128];
  274. int this_len, retval;
  275. this_len = (len > sizeof(buf)) ? sizeof(buf) : len;
  276. if (copy_from_user(buf, src, this_len))
  277. return -EFAULT;
  278. retval = access_process_vm(tsk, dst, buf, this_len, 1);
  279. if (!retval) {
  280. if (copied)
  281. break;
  282. return -EIO;
  283. }
  284. copied += retval;
  285. src += retval;
  286. dst += retval;
  287. len -= retval;
  288. }
  289. return copied;
  290. }
  291. static int ptrace_setoptions(struct task_struct *child, long data)
  292. {
  293. child->ptrace &= ~PT_TRACE_MASK;
  294. if (data & PTRACE_O_TRACESYSGOOD)
  295. child->ptrace |= PT_TRACESYSGOOD;
  296. if (data & PTRACE_O_TRACEFORK)
  297. child->ptrace |= PT_TRACE_FORK;
  298. if (data & PTRACE_O_TRACEVFORK)
  299. child->ptrace |= PT_TRACE_VFORK;
  300. if (data & PTRACE_O_TRACECLONE)
  301. child->ptrace |= PT_TRACE_CLONE;
  302. if (data & PTRACE_O_TRACEEXEC)
  303. child->ptrace |= PT_TRACE_EXEC;
  304. if (data & PTRACE_O_TRACEVFORKDONE)
  305. child->ptrace |= PT_TRACE_VFORK_DONE;
  306. if (data & PTRACE_O_TRACEEXIT)
  307. child->ptrace |= PT_TRACE_EXIT;
  308. return (data & ~PTRACE_O_MASK) ? -EINVAL : 0;
  309. }
  310. static int ptrace_getsiginfo(struct task_struct *child, siginfo_t __user * data)
  311. {
  312. siginfo_t lastinfo;
  313. int error = -ESRCH;
  314. read_lock(&tasklist_lock);
  315. if (likely(child->sighand != NULL)) {
  316. error = -EINVAL;
  317. spin_lock_irq(&child->sighand->siglock);
  318. if (likely(child->last_siginfo != NULL)) {
  319. lastinfo = *child->last_siginfo;
  320. error = 0;
  321. }
  322. spin_unlock_irq(&child->sighand->siglock);
  323. }
  324. read_unlock(&tasklist_lock);
  325. if (!error)
  326. return copy_siginfo_to_user(data, &lastinfo);
  327. return error;
  328. }
  329. static int ptrace_setsiginfo(struct task_struct *child, siginfo_t __user * data)
  330. {
  331. siginfo_t newinfo;
  332. int error = -ESRCH;
  333. if (copy_from_user(&newinfo, data, sizeof (siginfo_t)))
  334. return -EFAULT;
  335. read_lock(&tasklist_lock);
  336. if (likely(child->sighand != NULL)) {
  337. error = -EINVAL;
  338. spin_lock_irq(&child->sighand->siglock);
  339. if (likely(child->last_siginfo != NULL)) {
  340. *child->last_siginfo = newinfo;
  341. error = 0;
  342. }
  343. spin_unlock_irq(&child->sighand->siglock);
  344. }
  345. read_unlock(&tasklist_lock);
  346. return error;
  347. }
  348. int ptrace_request(struct task_struct *child, long request,
  349. long addr, long data)
  350. {
  351. int ret = -EIO;
  352. switch (request) {
  353. #ifdef PTRACE_OLDSETOPTIONS
  354. case PTRACE_OLDSETOPTIONS:
  355. #endif
  356. case PTRACE_SETOPTIONS:
  357. ret = ptrace_setoptions(child, data);
  358. break;
  359. case PTRACE_GETEVENTMSG:
  360. ret = put_user(child->ptrace_message, (unsigned long __user *) data);
  361. break;
  362. case PTRACE_GETSIGINFO:
  363. ret = ptrace_getsiginfo(child, (siginfo_t __user *) data);
  364. break;
  365. case PTRACE_SETSIGINFO:
  366. ret = ptrace_setsiginfo(child, (siginfo_t __user *) data);
  367. break;
  368. default:
  369. break;
  370. }
  371. return ret;
  372. }
  373. /**
  374. * ptrace_traceme -- helper for PTRACE_TRACEME
  375. *
  376. * Performs checks and sets PT_PTRACED.
  377. * Should be used by all ptrace implementations for PTRACE_TRACEME.
  378. */
  379. int ptrace_traceme(void)
  380. {
  381. int ret = -EPERM;
  382. /*
  383. * Are we already being traced?
  384. */
  385. task_lock(current);
  386. if (!(current->ptrace & PT_PTRACED)) {
  387. ret = security_ptrace(current->parent, current);
  388. /*
  389. * Set the ptrace bit in the process ptrace flags.
  390. */
  391. if (!ret)
  392. current->ptrace |= PT_PTRACED;
  393. }
  394. task_unlock(current);
  395. return ret;
  396. }
  397. /**
  398. * ptrace_get_task_struct -- grab a task struct reference for ptrace
  399. * @pid: process id to grab a task_struct reference of
  400. *
  401. * This function is a helper for ptrace implementations. It checks
  402. * permissions and then grabs a task struct for use of the actual
  403. * ptrace implementation.
  404. *
  405. * Returns the task_struct for @pid or an ERR_PTR() on failure.
  406. */
  407. struct task_struct *ptrace_get_task_struct(pid_t pid)
  408. {
  409. struct task_struct *child;
  410. /*
  411. * Tracing init is not allowed.
  412. */
  413. if (pid == 1)
  414. return ERR_PTR(-EPERM);
  415. read_lock(&tasklist_lock);
  416. child = find_task_by_pid(pid);
  417. if (child)
  418. get_task_struct(child);
  419. read_unlock(&tasklist_lock);
  420. if (!child)
  421. return ERR_PTR(-ESRCH);
  422. return child;
  423. }
  424. #ifndef __ARCH_SYS_PTRACE
  425. asmlinkage long sys_ptrace(long request, long pid, long addr, long data)
  426. {
  427. struct task_struct *child;
  428. long ret;
  429. /*
  430. * This lock_kernel fixes a subtle race with suid exec
  431. */
  432. lock_kernel();
  433. if (request == PTRACE_TRACEME) {
  434. ret = ptrace_traceme();
  435. goto out;
  436. }
  437. child = ptrace_get_task_struct(pid);
  438. if (IS_ERR(child)) {
  439. ret = PTR_ERR(child);
  440. goto out;
  441. }
  442. if (request == PTRACE_ATTACH) {
  443. ret = ptrace_attach(child);
  444. goto out_put_task_struct;
  445. }
  446. ret = ptrace_check_attach(child, request == PTRACE_KILL);
  447. if (ret < 0)
  448. goto out_put_task_struct;
  449. ret = arch_ptrace(child, request, addr, data);
  450. if (ret < 0)
  451. goto out_put_task_struct;
  452. out_put_task_struct:
  453. put_task_struct(child);
  454. out:
  455. unlock_kernel();
  456. return ret;
  457. }
  458. #endif /* __ARCH_SYS_PTRACE */