ptrace.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764
  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 <linux/audit.h>
  21. #include <linux/pid_namespace.h>
  22. #include <linux/syscalls.h>
  23. #include <linux/uaccess.h>
  24. /*
  25. * ptrace a task: make the debugger its new parent and
  26. * move it to the ptrace list.
  27. *
  28. * Must be called with the tasklist lock write-held.
  29. */
  30. void __ptrace_link(struct task_struct *child, struct task_struct *new_parent)
  31. {
  32. BUG_ON(!list_empty(&child->ptrace_entry));
  33. list_add(&child->ptrace_entry, &new_parent->ptraced);
  34. child->parent = new_parent;
  35. }
  36. /*
  37. * Turn a tracing stop into a normal stop now, since with no tracer there
  38. * would be no way to wake it up with SIGCONT or SIGKILL. If there was a
  39. * signal sent that would resume the child, but didn't because it was in
  40. * TASK_TRACED, resume it now.
  41. * Requires that irqs be disabled.
  42. */
  43. static void ptrace_untrace(struct task_struct *child)
  44. {
  45. spin_lock(&child->sighand->siglock);
  46. if (task_is_traced(child)) {
  47. /*
  48. * If the group stop is completed or in progress,
  49. * this thread was already counted as stopped.
  50. */
  51. if (child->signal->flags & SIGNAL_STOP_STOPPED ||
  52. child->signal->group_stop_count)
  53. __set_task_state(child, TASK_STOPPED);
  54. else
  55. signal_wake_up(child, 1);
  56. }
  57. spin_unlock(&child->sighand->siglock);
  58. }
  59. /*
  60. * unptrace a task: move it back to its original parent and
  61. * remove it from the ptrace list.
  62. *
  63. * Must be called with the tasklist lock write-held.
  64. */
  65. void __ptrace_unlink(struct task_struct *child)
  66. {
  67. BUG_ON(!child->ptrace);
  68. child->ptrace = 0;
  69. child->parent = child->real_parent;
  70. list_del_init(&child->ptrace_entry);
  71. arch_ptrace_untrace(child);
  72. if (task_is_traced(child))
  73. ptrace_untrace(child);
  74. }
  75. /*
  76. * Check that we have indeed attached to the thing..
  77. */
  78. int ptrace_check_attach(struct task_struct *child, int kill)
  79. {
  80. int ret = -ESRCH;
  81. /*
  82. * We take the read lock around doing both checks to close a
  83. * possible race where someone else was tracing our child and
  84. * detached between these two checks. After this locked check,
  85. * we are sure that this is our traced child and that can only
  86. * be changed by us so it's not changing right after this.
  87. */
  88. read_lock(&tasklist_lock);
  89. if ((child->ptrace & PT_PTRACED) && child->parent == current) {
  90. ret = 0;
  91. /*
  92. * child->sighand can't be NULL, release_task()
  93. * does ptrace_unlink() before __exit_signal().
  94. */
  95. spin_lock_irq(&child->sighand->siglock);
  96. if (task_is_stopped(child))
  97. child->state = TASK_TRACED;
  98. else if (!task_is_traced(child) && !kill)
  99. ret = -ESRCH;
  100. spin_unlock_irq(&child->sighand->siglock);
  101. }
  102. read_unlock(&tasklist_lock);
  103. if (!ret && !kill)
  104. ret = wait_task_inactive(child, TASK_TRACED) ? 0 : -ESRCH;
  105. /* All systems go.. */
  106. return ret;
  107. }
  108. int __ptrace_may_access(struct task_struct *task, unsigned int mode)
  109. {
  110. const struct cred *cred = current_cred(), *tcred;
  111. /* May we inspect the given task?
  112. * This check is used both for attaching with ptrace
  113. * and for allowing access to sensitive information in /proc.
  114. *
  115. * ptrace_attach denies several cases that /proc allows
  116. * because setting up the necessary parent/child relationship
  117. * or halting the specified task is impossible.
  118. */
  119. int dumpable = 0;
  120. /* Don't let security modules deny introspection */
  121. if (task == current)
  122. return 0;
  123. rcu_read_lock();
  124. tcred = __task_cred(task);
  125. if ((cred->uid != tcred->euid ||
  126. cred->uid != tcred->suid ||
  127. cred->uid != tcred->uid ||
  128. cred->gid != tcred->egid ||
  129. cred->gid != tcred->sgid ||
  130. cred->gid != tcred->gid) &&
  131. !capable(CAP_SYS_PTRACE)) {
  132. rcu_read_unlock();
  133. return -EPERM;
  134. }
  135. rcu_read_unlock();
  136. smp_rmb();
  137. if (task->mm)
  138. dumpable = get_dumpable(task->mm);
  139. if (!dumpable && !capable(CAP_SYS_PTRACE))
  140. return -EPERM;
  141. return security_ptrace_access_check(task, mode);
  142. }
  143. bool ptrace_may_access(struct task_struct *task, unsigned int mode)
  144. {
  145. int err;
  146. task_lock(task);
  147. err = __ptrace_may_access(task, mode);
  148. task_unlock(task);
  149. return !err;
  150. }
  151. int ptrace_attach(struct task_struct *task)
  152. {
  153. int retval;
  154. audit_ptrace(task);
  155. retval = -EPERM;
  156. if (unlikely(task->flags & PF_KTHREAD))
  157. goto out;
  158. if (same_thread_group(task, current))
  159. goto out;
  160. /*
  161. * Protect exec's credential calculations against our interference;
  162. * interference; SUID, SGID and LSM creds get determined differently
  163. * under ptrace.
  164. */
  165. retval = -ERESTARTNOINTR;
  166. if (mutex_lock_interruptible(&task->cred_guard_mutex))
  167. goto out;
  168. task_lock(task);
  169. retval = __ptrace_may_access(task, PTRACE_MODE_ATTACH);
  170. task_unlock(task);
  171. if (retval)
  172. goto unlock_creds;
  173. write_lock_irq(&tasklist_lock);
  174. retval = -EPERM;
  175. if (unlikely(task->exit_state))
  176. goto unlock_tasklist;
  177. if (task->ptrace)
  178. goto unlock_tasklist;
  179. task->ptrace = PT_PTRACED;
  180. if (capable(CAP_SYS_PTRACE))
  181. task->ptrace |= PT_PTRACE_CAP;
  182. __ptrace_link(task, current);
  183. send_sig_info(SIGSTOP, SEND_SIG_FORCED, task);
  184. retval = 0;
  185. unlock_tasklist:
  186. write_unlock_irq(&tasklist_lock);
  187. unlock_creds:
  188. mutex_unlock(&task->cred_guard_mutex);
  189. out:
  190. return retval;
  191. }
  192. /**
  193. * ptrace_traceme -- helper for PTRACE_TRACEME
  194. *
  195. * Performs checks and sets PT_PTRACED.
  196. * Should be used by all ptrace implementations for PTRACE_TRACEME.
  197. */
  198. int ptrace_traceme(void)
  199. {
  200. int ret = -EPERM;
  201. write_lock_irq(&tasklist_lock);
  202. /* Are we already being traced? */
  203. if (!current->ptrace) {
  204. ret = security_ptrace_traceme(current->parent);
  205. /*
  206. * Check PF_EXITING to ensure ->real_parent has not passed
  207. * exit_ptrace(). Otherwise we don't report the error but
  208. * pretend ->real_parent untraces us right after return.
  209. */
  210. if (!ret && !(current->real_parent->flags & PF_EXITING)) {
  211. current->ptrace = PT_PTRACED;
  212. __ptrace_link(current, current->real_parent);
  213. }
  214. }
  215. write_unlock_irq(&tasklist_lock);
  216. return ret;
  217. }
  218. /*
  219. * Called with irqs disabled, returns true if childs should reap themselves.
  220. */
  221. static int ignoring_children(struct sighand_struct *sigh)
  222. {
  223. int ret;
  224. spin_lock(&sigh->siglock);
  225. ret = (sigh->action[SIGCHLD-1].sa.sa_handler == SIG_IGN) ||
  226. (sigh->action[SIGCHLD-1].sa.sa_flags & SA_NOCLDWAIT);
  227. spin_unlock(&sigh->siglock);
  228. return ret;
  229. }
  230. /*
  231. * Called with tasklist_lock held for writing.
  232. * Unlink a traced task, and clean it up if it was a traced zombie.
  233. * Return true if it needs to be reaped with release_task().
  234. * (We can't call release_task() here because we already hold tasklist_lock.)
  235. *
  236. * If it's a zombie, our attachedness prevented normal parent notification
  237. * or self-reaping. Do notification now if it would have happened earlier.
  238. * If it should reap itself, return true.
  239. *
  240. * If it's our own child, there is no notification to do. But if our normal
  241. * children self-reap, then this child was prevented by ptrace and we must
  242. * reap it now, in that case we must also wake up sub-threads sleeping in
  243. * do_wait().
  244. */
  245. static bool __ptrace_detach(struct task_struct *tracer, struct task_struct *p)
  246. {
  247. __ptrace_unlink(p);
  248. if (p->exit_state == EXIT_ZOMBIE) {
  249. if (!task_detached(p) && thread_group_empty(p)) {
  250. if (!same_thread_group(p->real_parent, tracer))
  251. do_notify_parent(p, p->exit_signal);
  252. else if (ignoring_children(tracer->sighand)) {
  253. __wake_up_parent(p, tracer);
  254. p->exit_signal = -1;
  255. }
  256. }
  257. if (task_detached(p)) {
  258. /* Mark it as in the process of being reaped. */
  259. p->exit_state = EXIT_DEAD;
  260. return true;
  261. }
  262. }
  263. return false;
  264. }
  265. int ptrace_detach(struct task_struct *child, unsigned int data)
  266. {
  267. bool dead = false;
  268. if (!valid_signal(data))
  269. return -EIO;
  270. /* Architecture-specific hardware disable .. */
  271. ptrace_disable(child);
  272. clear_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  273. write_lock_irq(&tasklist_lock);
  274. /*
  275. * This child can be already killed. Make sure de_thread() or
  276. * our sub-thread doing do_wait() didn't do release_task() yet.
  277. */
  278. if (child->ptrace) {
  279. child->exit_code = data;
  280. dead = __ptrace_detach(current, child);
  281. if (!child->exit_state)
  282. wake_up_process(child);
  283. }
  284. write_unlock_irq(&tasklist_lock);
  285. if (unlikely(dead))
  286. release_task(child);
  287. return 0;
  288. }
  289. /*
  290. * Detach all tasks we were using ptrace on.
  291. */
  292. void exit_ptrace(struct task_struct *tracer)
  293. {
  294. struct task_struct *p, *n;
  295. LIST_HEAD(ptrace_dead);
  296. write_lock_irq(&tasklist_lock);
  297. list_for_each_entry_safe(p, n, &tracer->ptraced, ptrace_entry) {
  298. if (__ptrace_detach(tracer, p))
  299. list_add(&p->ptrace_entry, &ptrace_dead);
  300. }
  301. write_unlock_irq(&tasklist_lock);
  302. BUG_ON(!list_empty(&tracer->ptraced));
  303. list_for_each_entry_safe(p, n, &ptrace_dead, ptrace_entry) {
  304. list_del_init(&p->ptrace_entry);
  305. release_task(p);
  306. }
  307. }
  308. int ptrace_readdata(struct task_struct *tsk, unsigned long src, char __user *dst, int len)
  309. {
  310. int copied = 0;
  311. while (len > 0) {
  312. char buf[128];
  313. int this_len, retval;
  314. this_len = (len > sizeof(buf)) ? sizeof(buf) : len;
  315. retval = access_process_vm(tsk, src, buf, this_len, 0);
  316. if (!retval) {
  317. if (copied)
  318. break;
  319. return -EIO;
  320. }
  321. if (copy_to_user(dst, buf, retval))
  322. return -EFAULT;
  323. copied += retval;
  324. src += retval;
  325. dst += retval;
  326. len -= retval;
  327. }
  328. return copied;
  329. }
  330. int ptrace_writedata(struct task_struct *tsk, char __user *src, unsigned long dst, int len)
  331. {
  332. int copied = 0;
  333. while (len > 0) {
  334. char buf[128];
  335. int this_len, retval;
  336. this_len = (len > sizeof(buf)) ? sizeof(buf) : len;
  337. if (copy_from_user(buf, src, this_len))
  338. return -EFAULT;
  339. retval = access_process_vm(tsk, dst, buf, this_len, 1);
  340. if (!retval) {
  341. if (copied)
  342. break;
  343. return -EIO;
  344. }
  345. copied += retval;
  346. src += retval;
  347. dst += retval;
  348. len -= retval;
  349. }
  350. return copied;
  351. }
  352. static int ptrace_setoptions(struct task_struct *child, long data)
  353. {
  354. child->ptrace &= ~PT_TRACE_MASK;
  355. if (data & PTRACE_O_TRACESYSGOOD)
  356. child->ptrace |= PT_TRACESYSGOOD;
  357. if (data & PTRACE_O_TRACEFORK)
  358. child->ptrace |= PT_TRACE_FORK;
  359. if (data & PTRACE_O_TRACEVFORK)
  360. child->ptrace |= PT_TRACE_VFORK;
  361. if (data & PTRACE_O_TRACECLONE)
  362. child->ptrace |= PT_TRACE_CLONE;
  363. if (data & PTRACE_O_TRACEEXEC)
  364. child->ptrace |= PT_TRACE_EXEC;
  365. if (data & PTRACE_O_TRACEVFORKDONE)
  366. child->ptrace |= PT_TRACE_VFORK_DONE;
  367. if (data & PTRACE_O_TRACEEXIT)
  368. child->ptrace |= PT_TRACE_EXIT;
  369. return (data & ~PTRACE_O_MASK) ? -EINVAL : 0;
  370. }
  371. static int ptrace_getsiginfo(struct task_struct *child, siginfo_t *info)
  372. {
  373. unsigned long flags;
  374. int error = -ESRCH;
  375. if (lock_task_sighand(child, &flags)) {
  376. error = -EINVAL;
  377. if (likely(child->last_siginfo != NULL)) {
  378. *info = *child->last_siginfo;
  379. error = 0;
  380. }
  381. unlock_task_sighand(child, &flags);
  382. }
  383. return error;
  384. }
  385. static int ptrace_setsiginfo(struct task_struct *child, const siginfo_t *info)
  386. {
  387. unsigned long flags;
  388. int error = -ESRCH;
  389. if (lock_task_sighand(child, &flags)) {
  390. error = -EINVAL;
  391. if (likely(child->last_siginfo != NULL)) {
  392. *child->last_siginfo = *info;
  393. error = 0;
  394. }
  395. unlock_task_sighand(child, &flags);
  396. }
  397. return error;
  398. }
  399. #ifdef PTRACE_SINGLESTEP
  400. #define is_singlestep(request) ((request) == PTRACE_SINGLESTEP)
  401. #else
  402. #define is_singlestep(request) 0
  403. #endif
  404. #ifdef PTRACE_SINGLEBLOCK
  405. #define is_singleblock(request) ((request) == PTRACE_SINGLEBLOCK)
  406. #else
  407. #define is_singleblock(request) 0
  408. #endif
  409. #ifdef PTRACE_SYSEMU
  410. #define is_sysemu_singlestep(request) ((request) == PTRACE_SYSEMU_SINGLESTEP)
  411. #else
  412. #define is_sysemu_singlestep(request) 0
  413. #endif
  414. static int ptrace_resume(struct task_struct *child, long request, long data)
  415. {
  416. if (!valid_signal(data))
  417. return -EIO;
  418. if (request == PTRACE_SYSCALL)
  419. set_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  420. else
  421. clear_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  422. #ifdef TIF_SYSCALL_EMU
  423. if (request == PTRACE_SYSEMU || request == PTRACE_SYSEMU_SINGLESTEP)
  424. set_tsk_thread_flag(child, TIF_SYSCALL_EMU);
  425. else
  426. clear_tsk_thread_flag(child, TIF_SYSCALL_EMU);
  427. #endif
  428. if (is_singleblock(request)) {
  429. if (unlikely(!arch_has_block_step()))
  430. return -EIO;
  431. user_enable_block_step(child);
  432. } else if (is_singlestep(request) || is_sysemu_singlestep(request)) {
  433. if (unlikely(!arch_has_single_step()))
  434. return -EIO;
  435. user_enable_single_step(child);
  436. } else {
  437. user_disable_single_step(child);
  438. }
  439. child->exit_code = data;
  440. wake_up_process(child);
  441. return 0;
  442. }
  443. int ptrace_request(struct task_struct *child, long request,
  444. long addr, long data)
  445. {
  446. int ret = -EIO;
  447. siginfo_t siginfo;
  448. switch (request) {
  449. case PTRACE_PEEKTEXT:
  450. case PTRACE_PEEKDATA:
  451. return generic_ptrace_peekdata(child, addr, data);
  452. case PTRACE_POKETEXT:
  453. case PTRACE_POKEDATA:
  454. return generic_ptrace_pokedata(child, addr, data);
  455. #ifdef PTRACE_OLDSETOPTIONS
  456. case PTRACE_OLDSETOPTIONS:
  457. #endif
  458. case PTRACE_SETOPTIONS:
  459. ret = ptrace_setoptions(child, data);
  460. break;
  461. case PTRACE_GETEVENTMSG:
  462. ret = put_user(child->ptrace_message, (unsigned long __user *) data);
  463. break;
  464. case PTRACE_GETSIGINFO:
  465. ret = ptrace_getsiginfo(child, &siginfo);
  466. if (!ret)
  467. ret = copy_siginfo_to_user((siginfo_t __user *) data,
  468. &siginfo);
  469. break;
  470. case PTRACE_SETSIGINFO:
  471. if (copy_from_user(&siginfo, (siginfo_t __user *) data,
  472. sizeof siginfo))
  473. ret = -EFAULT;
  474. else
  475. ret = ptrace_setsiginfo(child, &siginfo);
  476. break;
  477. case PTRACE_DETACH: /* detach a process that was attached. */
  478. ret = ptrace_detach(child, data);
  479. break;
  480. #ifdef PTRACE_SINGLESTEP
  481. case PTRACE_SINGLESTEP:
  482. #endif
  483. #ifdef PTRACE_SINGLEBLOCK
  484. case PTRACE_SINGLEBLOCK:
  485. #endif
  486. #ifdef PTRACE_SYSEMU
  487. case PTRACE_SYSEMU:
  488. case PTRACE_SYSEMU_SINGLESTEP:
  489. #endif
  490. case PTRACE_SYSCALL:
  491. case PTRACE_CONT:
  492. return ptrace_resume(child, request, data);
  493. case PTRACE_KILL:
  494. if (child->exit_state) /* already dead */
  495. return 0;
  496. return ptrace_resume(child, request, SIGKILL);
  497. default:
  498. break;
  499. }
  500. return ret;
  501. }
  502. static struct task_struct *ptrace_get_task_struct(pid_t pid)
  503. {
  504. struct task_struct *child;
  505. rcu_read_lock();
  506. child = find_task_by_vpid(pid);
  507. if (child)
  508. get_task_struct(child);
  509. rcu_read_unlock();
  510. if (!child)
  511. return ERR_PTR(-ESRCH);
  512. return child;
  513. }
  514. #ifndef arch_ptrace_attach
  515. #define arch_ptrace_attach(child) do { } while (0)
  516. #endif
  517. SYSCALL_DEFINE4(ptrace, long, request, long, pid, long, addr, long, data)
  518. {
  519. struct task_struct *child;
  520. long ret;
  521. /*
  522. * This lock_kernel fixes a subtle race with suid exec
  523. */
  524. lock_kernel();
  525. if (request == PTRACE_TRACEME) {
  526. ret = ptrace_traceme();
  527. if (!ret)
  528. arch_ptrace_attach(current);
  529. goto out;
  530. }
  531. child = ptrace_get_task_struct(pid);
  532. if (IS_ERR(child)) {
  533. ret = PTR_ERR(child);
  534. goto out;
  535. }
  536. if (request == PTRACE_ATTACH) {
  537. ret = ptrace_attach(child);
  538. /*
  539. * Some architectures need to do book-keeping after
  540. * a ptrace attach.
  541. */
  542. if (!ret)
  543. arch_ptrace_attach(child);
  544. goto out_put_task_struct;
  545. }
  546. ret = ptrace_check_attach(child, request == PTRACE_KILL);
  547. if (ret < 0)
  548. goto out_put_task_struct;
  549. ret = arch_ptrace(child, request, addr, data);
  550. out_put_task_struct:
  551. put_task_struct(child);
  552. out:
  553. unlock_kernel();
  554. return ret;
  555. }
  556. int generic_ptrace_peekdata(struct task_struct *tsk, long addr, long data)
  557. {
  558. unsigned long tmp;
  559. int copied;
  560. copied = access_process_vm(tsk, addr, &tmp, sizeof(tmp), 0);
  561. if (copied != sizeof(tmp))
  562. return -EIO;
  563. return put_user(tmp, (unsigned long __user *)data);
  564. }
  565. int generic_ptrace_pokedata(struct task_struct *tsk, long addr, long data)
  566. {
  567. int copied;
  568. copied = access_process_vm(tsk, addr, &data, sizeof(data), 1);
  569. return (copied == sizeof(data)) ? 0 : -EIO;
  570. }
  571. #if defined CONFIG_COMPAT
  572. #include <linux/compat.h>
  573. int compat_ptrace_request(struct task_struct *child, compat_long_t request,
  574. compat_ulong_t addr, compat_ulong_t data)
  575. {
  576. compat_ulong_t __user *datap = compat_ptr(data);
  577. compat_ulong_t word;
  578. siginfo_t siginfo;
  579. int ret;
  580. switch (request) {
  581. case PTRACE_PEEKTEXT:
  582. case PTRACE_PEEKDATA:
  583. ret = access_process_vm(child, addr, &word, sizeof(word), 0);
  584. if (ret != sizeof(word))
  585. ret = -EIO;
  586. else
  587. ret = put_user(word, datap);
  588. break;
  589. case PTRACE_POKETEXT:
  590. case PTRACE_POKEDATA:
  591. ret = access_process_vm(child, addr, &data, sizeof(data), 1);
  592. ret = (ret != sizeof(data) ? -EIO : 0);
  593. break;
  594. case PTRACE_GETEVENTMSG:
  595. ret = put_user((compat_ulong_t) child->ptrace_message, datap);
  596. break;
  597. case PTRACE_GETSIGINFO:
  598. ret = ptrace_getsiginfo(child, &siginfo);
  599. if (!ret)
  600. ret = copy_siginfo_to_user32(
  601. (struct compat_siginfo __user *) datap,
  602. &siginfo);
  603. break;
  604. case PTRACE_SETSIGINFO:
  605. memset(&siginfo, 0, sizeof siginfo);
  606. if (copy_siginfo_from_user32(
  607. &siginfo, (struct compat_siginfo __user *) datap))
  608. ret = -EFAULT;
  609. else
  610. ret = ptrace_setsiginfo(child, &siginfo);
  611. break;
  612. default:
  613. ret = ptrace_request(child, request, addr, data);
  614. }
  615. return ret;
  616. }
  617. asmlinkage long compat_sys_ptrace(compat_long_t request, compat_long_t pid,
  618. compat_long_t addr, compat_long_t data)
  619. {
  620. struct task_struct *child;
  621. long ret;
  622. /*
  623. * This lock_kernel fixes a subtle race with suid exec
  624. */
  625. lock_kernel();
  626. if (request == PTRACE_TRACEME) {
  627. ret = ptrace_traceme();
  628. goto out;
  629. }
  630. child = ptrace_get_task_struct(pid);
  631. if (IS_ERR(child)) {
  632. ret = PTR_ERR(child);
  633. goto out;
  634. }
  635. if (request == PTRACE_ATTACH) {
  636. ret = ptrace_attach(child);
  637. /*
  638. * Some architectures need to do book-keeping after
  639. * a ptrace attach.
  640. */
  641. if (!ret)
  642. arch_ptrace_attach(child);
  643. goto out_put_task_struct;
  644. }
  645. ret = ptrace_check_attach(child, request == PTRACE_KILL);
  646. if (!ret)
  647. ret = compat_arch_ptrace(child, request, addr, data);
  648. out_put_task_struct:
  649. put_task_struct(child);
  650. out:
  651. unlock_kernel();
  652. return ret;
  653. }
  654. #endif /* CONFIG_COMPAT */