ptrace.c 19 KB

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