ptrace.c 18 KB

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