ptrace.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727
  1. /* ptrace.c */
  2. /* By Ross Biro 1/23/92 */
  3. /*
  4. * Pentium III FXSR, SSE support
  5. * Gareth Hughes <gareth@valinux.com>, May 2000
  6. */
  7. #include <linux/kernel.h>
  8. #include <linux/sched.h>
  9. #include <linux/mm.h>
  10. #include <linux/smp.h>
  11. #include <linux/errno.h>
  12. #include <linux/ptrace.h>
  13. #include <linux/user.h>
  14. #include <linux/security.h>
  15. #include <linux/audit.h>
  16. #include <linux/seccomp.h>
  17. #include <linux/signal.h>
  18. #include <asm/uaccess.h>
  19. #include <asm/pgtable.h>
  20. #include <asm/system.h>
  21. #include <asm/processor.h>
  22. #include <asm/i387.h>
  23. #include <asm/debugreg.h>
  24. #include <asm/ldt.h>
  25. #include <asm/desc.h>
  26. /*
  27. * does not yet catch signals sent when the child dies.
  28. * in exit.c or in signal.c.
  29. */
  30. /*
  31. * Determines which flags the user has access to [1 = access, 0 = no access].
  32. * Prohibits changing ID(21), VIP(20), VIF(19), VM(17), NT(14), IOPL(12-13), IF(9).
  33. * Also masks reserved bits (31-22, 15, 5, 3, 1).
  34. */
  35. #define FLAG_MASK 0x00050dd5
  36. /* set's the trap flag. */
  37. #define TRAP_FLAG 0x100
  38. /*
  39. * Offset of eflags on child stack..
  40. */
  41. #define EFL_OFFSET offsetof(struct pt_regs, eflags)
  42. static inline struct pt_regs *get_child_regs(struct task_struct *task)
  43. {
  44. void *stack_top = (void *)task->thread.esp0;
  45. return stack_top - sizeof(struct pt_regs);
  46. }
  47. /*
  48. * This routine will get a word off of the processes privileged stack.
  49. * the offset is bytes into the pt_regs structure on the stack.
  50. * This routine assumes that all the privileged stacks are in our
  51. * data space.
  52. */
  53. static inline int get_stack_long(struct task_struct *task, int offset)
  54. {
  55. unsigned char *stack;
  56. stack = (unsigned char *)task->thread.esp0 - sizeof(struct pt_regs);
  57. stack += offset;
  58. return (*((int *)stack));
  59. }
  60. /*
  61. * This routine will put a word on the processes privileged stack.
  62. * the offset is bytes into the pt_regs structure on the stack.
  63. * This routine assumes that all the privileged stacks are in our
  64. * data space.
  65. */
  66. static inline int put_stack_long(struct task_struct *task, int offset,
  67. unsigned long data)
  68. {
  69. unsigned char * stack;
  70. stack = (unsigned char *)task->thread.esp0 - sizeof(struct pt_regs);
  71. stack += offset;
  72. *(unsigned long *) stack = data;
  73. return 0;
  74. }
  75. static int putreg(struct task_struct *child,
  76. unsigned long regno, unsigned long value)
  77. {
  78. switch (regno >> 2) {
  79. case GS:
  80. if (value && (value & 3) != 3)
  81. return -EIO;
  82. child->thread.gs = value;
  83. return 0;
  84. case DS:
  85. case ES:
  86. case FS:
  87. if (value && (value & 3) != 3)
  88. return -EIO;
  89. value &= 0xffff;
  90. break;
  91. case SS:
  92. case CS:
  93. if ((value & 3) != 3)
  94. return -EIO;
  95. value &= 0xffff;
  96. break;
  97. case EFL:
  98. value &= FLAG_MASK;
  99. value |= get_stack_long(child, EFL_OFFSET) & ~FLAG_MASK;
  100. break;
  101. }
  102. if (regno > FS*4)
  103. regno -= 1*4;
  104. put_stack_long(child, regno, value);
  105. return 0;
  106. }
  107. static unsigned long getreg(struct task_struct *child,
  108. unsigned long regno)
  109. {
  110. unsigned long retval = ~0UL;
  111. switch (regno >> 2) {
  112. case GS:
  113. retval = child->thread.gs;
  114. break;
  115. case DS:
  116. case ES:
  117. case FS:
  118. case SS:
  119. case CS:
  120. retval = 0xffff;
  121. /* fall through */
  122. default:
  123. if (regno > FS*4)
  124. regno -= 1*4;
  125. retval &= get_stack_long(child, regno);
  126. }
  127. return retval;
  128. }
  129. #define LDT_SEGMENT 4
  130. static unsigned long convert_eip_to_linear(struct task_struct *child, struct pt_regs *regs)
  131. {
  132. unsigned long addr, seg;
  133. addr = regs->eip;
  134. seg = regs->xcs & 0xffff;
  135. if (regs->eflags & VM_MASK) {
  136. addr = (addr & 0xffff) + (seg << 4);
  137. return addr;
  138. }
  139. /*
  140. * We'll assume that the code segments in the GDT
  141. * are all zero-based. That is largely true: the
  142. * TLS segments are used for data, and the PNPBIOS
  143. * and APM bios ones we just ignore here.
  144. */
  145. if (seg & LDT_SEGMENT) {
  146. u32 *desc;
  147. unsigned long base;
  148. down(&child->mm->context.sem);
  149. desc = child->mm->context.ldt + (seg & ~7);
  150. base = (desc[0] >> 16) | ((desc[1] & 0xff) << 16) | (desc[1] & 0xff000000);
  151. /* 16-bit code segment? */
  152. if (!((desc[1] >> 22) & 1))
  153. addr &= 0xffff;
  154. addr += base;
  155. up(&child->mm->context.sem);
  156. }
  157. return addr;
  158. }
  159. static inline int is_setting_trap_flag(struct task_struct *child, struct pt_regs *regs)
  160. {
  161. int i, copied;
  162. unsigned char opcode[15];
  163. unsigned long addr = convert_eip_to_linear(child, regs);
  164. copied = access_process_vm(child, addr, opcode, sizeof(opcode), 0);
  165. for (i = 0; i < copied; i++) {
  166. switch (opcode[i]) {
  167. /* popf and iret */
  168. case 0x9d: case 0xcf:
  169. return 1;
  170. /* opcode and address size prefixes */
  171. case 0x66: case 0x67:
  172. continue;
  173. /* irrelevant prefixes (segment overrides and repeats) */
  174. case 0x26: case 0x2e:
  175. case 0x36: case 0x3e:
  176. case 0x64: case 0x65:
  177. case 0xf0: case 0xf2: case 0xf3:
  178. continue;
  179. /*
  180. * pushf: NOTE! We should probably not let
  181. * the user see the TF bit being set. But
  182. * it's more pain than it's worth to avoid
  183. * it, and a debugger could emulate this
  184. * all in user space if it _really_ cares.
  185. */
  186. case 0x9c:
  187. default:
  188. return 0;
  189. }
  190. }
  191. return 0;
  192. }
  193. static void set_singlestep(struct task_struct *child)
  194. {
  195. struct pt_regs *regs = get_child_regs(child);
  196. /*
  197. * Always set TIF_SINGLESTEP - this guarantees that
  198. * we single-step system calls etc.. This will also
  199. * cause us to set TF when returning to user mode.
  200. */
  201. set_tsk_thread_flag(child, TIF_SINGLESTEP);
  202. /*
  203. * If TF was already set, don't do anything else
  204. */
  205. if (regs->eflags & TRAP_FLAG)
  206. return;
  207. /* Set TF on the kernel stack.. */
  208. regs->eflags |= TRAP_FLAG;
  209. /*
  210. * ..but if TF is changed by the instruction we will trace,
  211. * don't mark it as being "us" that set it, so that we
  212. * won't clear it by hand later.
  213. */
  214. if (is_setting_trap_flag(child, regs))
  215. return;
  216. child->ptrace |= PT_DTRACE;
  217. }
  218. static void clear_singlestep(struct task_struct *child)
  219. {
  220. /* Always clear TIF_SINGLESTEP... */
  221. clear_tsk_thread_flag(child, TIF_SINGLESTEP);
  222. /* But touch TF only if it was set by us.. */
  223. if (child->ptrace & PT_DTRACE) {
  224. struct pt_regs *regs = get_child_regs(child);
  225. regs->eflags &= ~TRAP_FLAG;
  226. child->ptrace &= ~PT_DTRACE;
  227. }
  228. }
  229. /*
  230. * Called by kernel/ptrace.c when detaching..
  231. *
  232. * Make sure the single step bit is not set.
  233. */
  234. void ptrace_disable(struct task_struct *child)
  235. {
  236. clear_singlestep(child);
  237. clear_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  238. clear_tsk_thread_flag(child, TIF_SYSCALL_EMU);
  239. }
  240. /*
  241. * Perform get_thread_area on behalf of the traced child.
  242. */
  243. static int
  244. ptrace_get_thread_area(struct task_struct *child,
  245. int idx, struct user_desc __user *user_desc)
  246. {
  247. struct user_desc info;
  248. struct desc_struct *desc;
  249. /*
  250. * Get the current Thread-Local Storage area:
  251. */
  252. #define GET_BASE(desc) ( \
  253. (((desc)->a >> 16) & 0x0000ffff) | \
  254. (((desc)->b << 16) & 0x00ff0000) | \
  255. ( (desc)->b & 0xff000000) )
  256. #define GET_LIMIT(desc) ( \
  257. ((desc)->a & 0x0ffff) | \
  258. ((desc)->b & 0xf0000) )
  259. #define GET_32BIT(desc) (((desc)->b >> 22) & 1)
  260. #define GET_CONTENTS(desc) (((desc)->b >> 10) & 3)
  261. #define GET_WRITABLE(desc) (((desc)->b >> 9) & 1)
  262. #define GET_LIMIT_PAGES(desc) (((desc)->b >> 23) & 1)
  263. #define GET_PRESENT(desc) (((desc)->b >> 15) & 1)
  264. #define GET_USEABLE(desc) (((desc)->b >> 20) & 1)
  265. if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
  266. return -EINVAL;
  267. desc = child->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
  268. info.entry_number = idx;
  269. info.base_addr = GET_BASE(desc);
  270. info.limit = GET_LIMIT(desc);
  271. info.seg_32bit = GET_32BIT(desc);
  272. info.contents = GET_CONTENTS(desc);
  273. info.read_exec_only = !GET_WRITABLE(desc);
  274. info.limit_in_pages = GET_LIMIT_PAGES(desc);
  275. info.seg_not_present = !GET_PRESENT(desc);
  276. info.useable = GET_USEABLE(desc);
  277. if (copy_to_user(user_desc, &info, sizeof(info)))
  278. return -EFAULT;
  279. return 0;
  280. }
  281. /*
  282. * Perform set_thread_area on behalf of the traced child.
  283. */
  284. static int
  285. ptrace_set_thread_area(struct task_struct *child,
  286. int idx, struct user_desc __user *user_desc)
  287. {
  288. struct user_desc info;
  289. struct desc_struct *desc;
  290. if (copy_from_user(&info, user_desc, sizeof(info)))
  291. return -EFAULT;
  292. if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
  293. return -EINVAL;
  294. desc = child->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
  295. if (LDT_empty(&info)) {
  296. desc->a = 0;
  297. desc->b = 0;
  298. } else {
  299. desc->a = LDT_entry_a(&info);
  300. desc->b = LDT_entry_b(&info);
  301. }
  302. return 0;
  303. }
  304. long arch_ptrace(struct task_struct *child, long request, long addr, long data)
  305. {
  306. struct user * dummy = NULL;
  307. int i, ret;
  308. unsigned long __user *datap = (unsigned long __user *)data;
  309. switch (request) {
  310. /* when I and D space are separate, these will need to be fixed. */
  311. case PTRACE_PEEKTEXT: /* read word at location addr. */
  312. case PTRACE_PEEKDATA: {
  313. unsigned long tmp;
  314. int copied;
  315. copied = access_process_vm(child, addr, &tmp, sizeof(tmp), 0);
  316. ret = -EIO;
  317. if (copied != sizeof(tmp))
  318. break;
  319. ret = put_user(tmp, datap);
  320. break;
  321. }
  322. /* read the word at location addr in the USER area. */
  323. case PTRACE_PEEKUSR: {
  324. unsigned long tmp;
  325. ret = -EIO;
  326. if ((addr & 3) || addr < 0 ||
  327. addr > sizeof(struct user) - 3)
  328. break;
  329. tmp = 0; /* Default return condition */
  330. if(addr < FRAME_SIZE*sizeof(long))
  331. tmp = getreg(child, addr);
  332. if(addr >= (long) &dummy->u_debugreg[0] &&
  333. addr <= (long) &dummy->u_debugreg[7]){
  334. addr -= (long) &dummy->u_debugreg[0];
  335. addr = addr >> 2;
  336. tmp = child->thread.debugreg[addr];
  337. }
  338. ret = put_user(tmp, datap);
  339. break;
  340. }
  341. /* when I and D space are separate, this will have to be fixed. */
  342. case PTRACE_POKETEXT: /* write the word at location addr. */
  343. case PTRACE_POKEDATA:
  344. ret = 0;
  345. if (access_process_vm(child, addr, &data, sizeof(data), 1) == sizeof(data))
  346. break;
  347. ret = -EIO;
  348. break;
  349. case PTRACE_POKEUSR: /* write the word at location addr in the USER area */
  350. ret = -EIO;
  351. if ((addr & 3) || addr < 0 ||
  352. addr > sizeof(struct user) - 3)
  353. break;
  354. if (addr < FRAME_SIZE*sizeof(long)) {
  355. ret = putreg(child, addr, data);
  356. break;
  357. }
  358. /* We need to be very careful here. We implicitly
  359. want to modify a portion of the task_struct, and we
  360. have to be selective about what portions we allow someone
  361. to modify. */
  362. ret = -EIO;
  363. if(addr >= (long) &dummy->u_debugreg[0] &&
  364. addr <= (long) &dummy->u_debugreg[7]){
  365. if(addr == (long) &dummy->u_debugreg[4]) break;
  366. if(addr == (long) &dummy->u_debugreg[5]) break;
  367. if(addr < (long) &dummy->u_debugreg[4] &&
  368. ((unsigned long) data) >= TASK_SIZE-3) break;
  369. /* Sanity-check data. Take one half-byte at once with
  370. * check = (val >> (16 + 4*i)) & 0xf. It contains the
  371. * R/Wi and LENi bits; bits 0 and 1 are R/Wi, and bits
  372. * 2 and 3 are LENi. Given a list of invalid values,
  373. * we do mask |= 1 << invalid_value, so that
  374. * (mask >> check) & 1 is a correct test for invalid
  375. * values.
  376. *
  377. * R/Wi contains the type of the breakpoint /
  378. * watchpoint, LENi contains the length of the watched
  379. * data in the watchpoint case.
  380. *
  381. * The invalid values are:
  382. * - LENi == 0x10 (undefined), so mask |= 0x0f00.
  383. * - R/Wi == 0x10 (break on I/O reads or writes), so
  384. * mask |= 0x4444.
  385. * - R/Wi == 0x00 && LENi != 0x00, so we have mask |=
  386. * 0x1110.
  387. *
  388. * Finally, mask = 0x0f00 | 0x4444 | 0x1110 == 0x5f54.
  389. *
  390. * See the Intel Manual "System Programming Guide",
  391. * 15.2.4
  392. *
  393. * Note that LENi == 0x10 is defined on x86_64 in long
  394. * mode (i.e. even for 32-bit userspace software, but
  395. * 64-bit kernel), so the x86_64 mask value is 0x5454.
  396. * See the AMD manual no. 24593 (AMD64 System
  397. * Programming)*/
  398. if(addr == (long) &dummy->u_debugreg[7]) {
  399. data &= ~DR_CONTROL_RESERVED;
  400. for(i=0; i<4; i++)
  401. if ((0x5f54 >> ((data >> (16 + 4*i)) & 0xf)) & 1)
  402. goto out_tsk;
  403. if (data)
  404. set_tsk_thread_flag(child, TIF_DEBUG);
  405. else
  406. clear_tsk_thread_flag(child, TIF_DEBUG);
  407. }
  408. addr -= (long) &dummy->u_debugreg;
  409. addr = addr >> 2;
  410. child->thread.debugreg[addr] = data;
  411. ret = 0;
  412. }
  413. break;
  414. case PTRACE_SYSEMU: /* continue and stop at next syscall, which will not be executed */
  415. case PTRACE_SYSCALL: /* continue and stop at next (return from) syscall */
  416. case PTRACE_CONT: /* restart after signal. */
  417. ret = -EIO;
  418. if (!valid_signal(data))
  419. break;
  420. if (request == PTRACE_SYSEMU) {
  421. set_tsk_thread_flag(child, TIF_SYSCALL_EMU);
  422. clear_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  423. } else if (request == PTRACE_SYSCALL) {
  424. set_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  425. clear_tsk_thread_flag(child, TIF_SYSCALL_EMU);
  426. } else {
  427. clear_tsk_thread_flag(child, TIF_SYSCALL_EMU);
  428. clear_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  429. }
  430. child->exit_code = data;
  431. /* make sure the single step bit is not set. */
  432. clear_singlestep(child);
  433. wake_up_process(child);
  434. ret = 0;
  435. break;
  436. /*
  437. * make the child exit. Best I can do is send it a sigkill.
  438. * perhaps it should be put in the status that it wants to
  439. * exit.
  440. */
  441. case PTRACE_KILL:
  442. ret = 0;
  443. if (child->exit_state == EXIT_ZOMBIE) /* already dead */
  444. break;
  445. child->exit_code = SIGKILL;
  446. /* make sure the single step bit is not set. */
  447. clear_singlestep(child);
  448. wake_up_process(child);
  449. break;
  450. case PTRACE_SYSEMU_SINGLESTEP: /* Same as SYSEMU, but singlestep if not syscall */
  451. case PTRACE_SINGLESTEP: /* set the trap flag. */
  452. ret = -EIO;
  453. if (!valid_signal(data))
  454. break;
  455. if (request == PTRACE_SYSEMU_SINGLESTEP)
  456. set_tsk_thread_flag(child, TIF_SYSCALL_EMU);
  457. else
  458. clear_tsk_thread_flag(child, TIF_SYSCALL_EMU);
  459. clear_tsk_thread_flag(child, TIF_SYSCALL_TRACE);
  460. set_singlestep(child);
  461. child->exit_code = data;
  462. /* give it a chance to run. */
  463. wake_up_process(child);
  464. ret = 0;
  465. break;
  466. case PTRACE_DETACH:
  467. /* detach a process that was attached. */
  468. ret = ptrace_detach(child, data);
  469. break;
  470. case PTRACE_GETREGS: { /* Get all gp regs from the child. */
  471. if (!access_ok(VERIFY_WRITE, datap, FRAME_SIZE*sizeof(long))) {
  472. ret = -EIO;
  473. break;
  474. }
  475. for ( i = 0; i < FRAME_SIZE*sizeof(long); i += sizeof(long) ) {
  476. __put_user(getreg(child, i), datap);
  477. datap++;
  478. }
  479. ret = 0;
  480. break;
  481. }
  482. case PTRACE_SETREGS: { /* Set all gp regs in the child. */
  483. unsigned long tmp;
  484. if (!access_ok(VERIFY_READ, datap, FRAME_SIZE*sizeof(long))) {
  485. ret = -EIO;
  486. break;
  487. }
  488. for ( i = 0; i < FRAME_SIZE*sizeof(long); i += sizeof(long) ) {
  489. __get_user(tmp, datap);
  490. putreg(child, i, tmp);
  491. datap++;
  492. }
  493. ret = 0;
  494. break;
  495. }
  496. case PTRACE_GETFPREGS: { /* Get the child FPU state. */
  497. if (!access_ok(VERIFY_WRITE, datap,
  498. sizeof(struct user_i387_struct))) {
  499. ret = -EIO;
  500. break;
  501. }
  502. ret = 0;
  503. if (!tsk_used_math(child))
  504. init_fpu(child);
  505. get_fpregs((struct user_i387_struct __user *)data, child);
  506. break;
  507. }
  508. case PTRACE_SETFPREGS: { /* Set the child FPU state. */
  509. if (!access_ok(VERIFY_READ, datap,
  510. sizeof(struct user_i387_struct))) {
  511. ret = -EIO;
  512. break;
  513. }
  514. set_stopped_child_used_math(child);
  515. set_fpregs(child, (struct user_i387_struct __user *)data);
  516. ret = 0;
  517. break;
  518. }
  519. case PTRACE_GETFPXREGS: { /* Get the child extended FPU state. */
  520. if (!access_ok(VERIFY_WRITE, datap,
  521. sizeof(struct user_fxsr_struct))) {
  522. ret = -EIO;
  523. break;
  524. }
  525. if (!tsk_used_math(child))
  526. init_fpu(child);
  527. ret = get_fpxregs((struct user_fxsr_struct __user *)data, child);
  528. break;
  529. }
  530. case PTRACE_SETFPXREGS: { /* Set the child extended FPU state. */
  531. if (!access_ok(VERIFY_READ, datap,
  532. sizeof(struct user_fxsr_struct))) {
  533. ret = -EIO;
  534. break;
  535. }
  536. set_stopped_child_used_math(child);
  537. ret = set_fpxregs(child, (struct user_fxsr_struct __user *)data);
  538. break;
  539. }
  540. case PTRACE_GET_THREAD_AREA:
  541. ret = ptrace_get_thread_area(child, addr,
  542. (struct user_desc __user *) data);
  543. break;
  544. case PTRACE_SET_THREAD_AREA:
  545. ret = ptrace_set_thread_area(child, addr,
  546. (struct user_desc __user *) data);
  547. break;
  548. default:
  549. ret = ptrace_request(child, request, addr, data);
  550. break;
  551. }
  552. out_tsk:
  553. return ret;
  554. }
  555. void send_sigtrap(struct task_struct *tsk, struct pt_regs *regs, int error_code)
  556. {
  557. struct siginfo info;
  558. tsk->thread.trap_no = 1;
  559. tsk->thread.error_code = error_code;
  560. memset(&info, 0, sizeof(info));
  561. info.si_signo = SIGTRAP;
  562. info.si_code = TRAP_BRKPT;
  563. /* User-mode eip? */
  564. info.si_addr = user_mode_vm(regs) ? (void __user *) regs->eip : NULL;
  565. /* Send us the fakey SIGTRAP */
  566. force_sig_info(SIGTRAP, &info, tsk);
  567. }
  568. /* notification of system call entry/exit
  569. * - triggered by current->work.syscall_trace
  570. */
  571. __attribute__((regparm(3)))
  572. int do_syscall_trace(struct pt_regs *regs, int entryexit)
  573. {
  574. int is_sysemu = test_thread_flag(TIF_SYSCALL_EMU);
  575. /*
  576. * With TIF_SYSCALL_EMU set we want to ignore TIF_SINGLESTEP for syscall
  577. * interception
  578. */
  579. int is_singlestep = !is_sysemu && test_thread_flag(TIF_SINGLESTEP);
  580. int ret = 0;
  581. /* do the secure computing check first */
  582. if (!entryexit)
  583. secure_computing(regs->orig_eax);
  584. if (unlikely(current->audit_context)) {
  585. if (entryexit)
  586. audit_syscall_exit(AUDITSC_RESULT(regs->eax),
  587. regs->eax);
  588. /* Debug traps, when using PTRACE_SINGLESTEP, must be sent only
  589. * on the syscall exit path. Normally, when TIF_SYSCALL_AUDIT is
  590. * not used, entry.S will call us only on syscall exit, not
  591. * entry; so when TIF_SYSCALL_AUDIT is used we must avoid
  592. * calling send_sigtrap() on syscall entry.
  593. *
  594. * Note that when PTRACE_SYSEMU_SINGLESTEP is used,
  595. * is_singlestep is false, despite his name, so we will still do
  596. * the correct thing.
  597. */
  598. else if (is_singlestep)
  599. goto out;
  600. }
  601. if (!(current->ptrace & PT_PTRACED))
  602. goto out;
  603. /* If a process stops on the 1st tracepoint with SYSCALL_TRACE
  604. * and then is resumed with SYSEMU_SINGLESTEP, it will come in
  605. * here. We have to check this and return */
  606. if (is_sysemu && entryexit)
  607. return 0;
  608. /* Fake a debug trap */
  609. if (is_singlestep)
  610. send_sigtrap(current, regs, 0);
  611. if (!test_thread_flag(TIF_SYSCALL_TRACE) && !is_sysemu)
  612. goto out;
  613. /* the 0x80 provides a way for the tracing parent to distinguish
  614. between a syscall stop and SIGTRAP delivery */
  615. /* Note that the debugger could change the result of test_thread_flag!*/
  616. ptrace_notify(SIGTRAP | ((current->ptrace & PT_TRACESYSGOOD) ? 0x80:0));
  617. /*
  618. * this isn't the same as continuing with a signal, but it will do
  619. * for normal use. strace only continues with a signal if the
  620. * stopping signal is not SIGTRAP. -brl
  621. */
  622. if (current->exit_code) {
  623. send_sig(current->exit_code, current, 1);
  624. current->exit_code = 0;
  625. }
  626. ret = is_sysemu;
  627. out:
  628. if (unlikely(current->audit_context) && !entryexit)
  629. audit_syscall_entry(AUDIT_ARCH_I386, regs->orig_eax,
  630. regs->ebx, regs->ecx, regs->edx, regs->esi);
  631. if (ret == 0)
  632. return 0;
  633. regs->orig_eax = -1; /* force skip of syscall restarting */
  634. if (unlikely(current->audit_context))
  635. audit_syscall_exit(AUDITSC_RESULT(regs->eax), regs->eax);
  636. return 1;
  637. }