ptrace.c 19 KB

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