kprobes.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759
  1. /*
  2. * Kernel Probes (KProbes)
  3. * arch/i386/kernel/kprobes.c
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation; either version 2 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
  18. *
  19. * Copyright (C) IBM Corporation, 2002, 2004
  20. *
  21. * 2002-Oct Created by Vamsi Krishna S <vamsi_krishna@in.ibm.com> Kernel
  22. * Probes initial implementation ( includes contributions from
  23. * Rusty Russell).
  24. * 2004-July Suparna Bhattacharya <suparna@in.ibm.com> added jumper probes
  25. * interface to access function arguments.
  26. * 2005-May Hien Nguyen <hien@us.ibm.com>, Jim Keniston
  27. * <jkenisto@us.ibm.com> and Prasanna S Panchamukhi
  28. * <prasanna@in.ibm.com> added function-return probes.
  29. */
  30. #include <linux/kprobes.h>
  31. #include <linux/ptrace.h>
  32. #include <linux/preempt.h>
  33. #include <asm/cacheflush.h>
  34. #include <asm/kdebug.h>
  35. #include <asm/desc.h>
  36. #include <asm/uaccess.h>
  37. void jprobe_return_end(void);
  38. DEFINE_PER_CPU(struct kprobe *, current_kprobe) = NULL;
  39. DEFINE_PER_CPU(struct kprobe_ctlblk, kprobe_ctlblk);
  40. /* insert a jmp code */
  41. static __always_inline void set_jmp_op(void *from, void *to)
  42. {
  43. struct __arch_jmp_op {
  44. char op;
  45. long raddr;
  46. } __attribute__((packed)) *jop;
  47. jop = (struct __arch_jmp_op *)from;
  48. jop->raddr = (long)(to) - ((long)(from) + 5);
  49. jop->op = RELATIVEJUMP_INSTRUCTION;
  50. }
  51. /*
  52. * returns non-zero if opcodes can be boosted.
  53. */
  54. static __always_inline int can_boost(kprobe_opcode_t *opcodes)
  55. {
  56. #define W(row,b0,b1,b2,b3,b4,b5,b6,b7,b8,b9,ba,bb,bc,bd,be,bf) \
  57. (((b0##UL << 0x0)|(b1##UL << 0x1)|(b2##UL << 0x2)|(b3##UL << 0x3) | \
  58. (b4##UL << 0x4)|(b5##UL << 0x5)|(b6##UL << 0x6)|(b7##UL << 0x7) | \
  59. (b8##UL << 0x8)|(b9##UL << 0x9)|(ba##UL << 0xa)|(bb##UL << 0xb) | \
  60. (bc##UL << 0xc)|(bd##UL << 0xd)|(be##UL << 0xe)|(bf##UL << 0xf)) \
  61. << (row % 32))
  62. /*
  63. * Undefined/reserved opcodes, conditional jump, Opcode Extension
  64. * Groups, and some special opcodes can not be boost.
  65. */
  66. static const unsigned long twobyte_is_boostable[256 / 32] = {
  67. /* 0 1 2 3 4 5 6 7 8 9 a b c d e f */
  68. /* ------------------------------- */
  69. W(0x00, 0,0,1,1,0,0,1,0,1,1,0,0,0,0,0,0)| /* 00 */
  70. W(0x10, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0), /* 10 */
  71. W(0x20, 1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0)| /* 20 */
  72. W(0x30, 0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0), /* 30 */
  73. W(0x40, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1)| /* 40 */
  74. W(0x50, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0), /* 50 */
  75. W(0x60, 1,1,1,1,1,1,1,1,1,1,1,1,0,0,1,1)| /* 60 */
  76. W(0x70, 0,0,0,0,1,1,1,1,0,0,0,0,0,0,1,1), /* 70 */
  77. W(0x80, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)| /* 80 */
  78. W(0x90, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1), /* 90 */
  79. W(0xa0, 1,1,0,1,1,1,0,0,1,1,0,1,1,1,0,1)| /* a0 */
  80. W(0xb0, 1,1,1,1,1,1,1,1,0,0,0,1,1,1,1,1), /* b0 */
  81. W(0xc0, 1,1,0,0,0,0,0,0,1,1,1,1,1,1,1,1)| /* c0 */
  82. W(0xd0, 0,1,1,1,0,1,0,0,1,1,0,1,1,1,0,1), /* d0 */
  83. W(0xe0, 0,1,1,0,0,1,0,0,1,1,0,1,1,1,0,1)| /* e0 */
  84. W(0xf0, 0,1,1,1,0,1,0,0,1,1,1,0,1,1,1,0) /* f0 */
  85. /* ------------------------------- */
  86. /* 0 1 2 3 4 5 6 7 8 9 a b c d e f */
  87. };
  88. #undef W
  89. kprobe_opcode_t opcode;
  90. kprobe_opcode_t *orig_opcodes = opcodes;
  91. retry:
  92. if (opcodes - orig_opcodes > MAX_INSN_SIZE - 1)
  93. return 0;
  94. opcode = *(opcodes++);
  95. /* 2nd-byte opcode */
  96. if (opcode == 0x0f) {
  97. if (opcodes - orig_opcodes > MAX_INSN_SIZE - 1)
  98. return 0;
  99. return test_bit(*opcodes, twobyte_is_boostable);
  100. }
  101. switch (opcode & 0xf0) {
  102. case 0x60:
  103. if (0x63 < opcode && opcode < 0x67)
  104. goto retry; /* prefixes */
  105. /* can't boost Address-size override and bound */
  106. return (opcode != 0x62 && opcode != 0x67);
  107. case 0x70:
  108. return 0; /* can't boost conditional jump */
  109. case 0xc0:
  110. /* can't boost software-interruptions */
  111. return (0xc1 < opcode && opcode < 0xcc) || opcode == 0xcf;
  112. case 0xd0:
  113. /* can boost AA* and XLAT */
  114. return (opcode == 0xd4 || opcode == 0xd5 || opcode == 0xd7);
  115. case 0xe0:
  116. /* can boost in/out and absolute jmps */
  117. return ((opcode & 0x04) || opcode == 0xea);
  118. case 0xf0:
  119. if ((opcode & 0x0c) == 0 && opcode != 0xf1)
  120. goto retry; /* lock/rep(ne) prefix */
  121. /* clear and set flags can be boost */
  122. return (opcode == 0xf5 || (0xf7 < opcode && opcode < 0xfe));
  123. default:
  124. if (opcode == 0x26 || opcode == 0x36 || opcode == 0x3e)
  125. goto retry; /* prefixes */
  126. /* can't boost CS override and call */
  127. return (opcode != 0x2e && opcode != 0x9a);
  128. }
  129. }
  130. /*
  131. * returns non-zero if opcode modifies the interrupt flag.
  132. */
  133. static int __kprobes is_IF_modifier(kprobe_opcode_t opcode)
  134. {
  135. switch (opcode) {
  136. case 0xfa: /* cli */
  137. case 0xfb: /* sti */
  138. case 0xcf: /* iret/iretd */
  139. case 0x9d: /* popf/popfd */
  140. return 1;
  141. }
  142. return 0;
  143. }
  144. int __kprobes arch_prepare_kprobe(struct kprobe *p)
  145. {
  146. /* insn: must be on special executable page on i386. */
  147. p->ainsn.insn = get_insn_slot();
  148. if (!p->ainsn.insn)
  149. return -ENOMEM;
  150. memcpy(p->ainsn.insn, p->addr, MAX_INSN_SIZE * sizeof(kprobe_opcode_t));
  151. p->opcode = *p->addr;
  152. if (can_boost(p->addr)) {
  153. p->ainsn.boostable = 0;
  154. } else {
  155. p->ainsn.boostable = -1;
  156. }
  157. return 0;
  158. }
  159. void __kprobes arch_arm_kprobe(struct kprobe *p)
  160. {
  161. *p->addr = BREAKPOINT_INSTRUCTION;
  162. flush_icache_range((unsigned long) p->addr,
  163. (unsigned long) p->addr + sizeof(kprobe_opcode_t));
  164. }
  165. void __kprobes arch_disarm_kprobe(struct kprobe *p)
  166. {
  167. *p->addr = p->opcode;
  168. flush_icache_range((unsigned long) p->addr,
  169. (unsigned long) p->addr + sizeof(kprobe_opcode_t));
  170. }
  171. void __kprobes arch_remove_kprobe(struct kprobe *p)
  172. {
  173. mutex_lock(&kprobe_mutex);
  174. free_insn_slot(p->ainsn.insn, (p->ainsn.boostable == 1));
  175. mutex_unlock(&kprobe_mutex);
  176. }
  177. static void __kprobes save_previous_kprobe(struct kprobe_ctlblk *kcb)
  178. {
  179. kcb->prev_kprobe.kp = kprobe_running();
  180. kcb->prev_kprobe.status = kcb->kprobe_status;
  181. kcb->prev_kprobe.old_eflags = kcb->kprobe_old_eflags;
  182. kcb->prev_kprobe.saved_eflags = kcb->kprobe_saved_eflags;
  183. }
  184. static void __kprobes restore_previous_kprobe(struct kprobe_ctlblk *kcb)
  185. {
  186. __get_cpu_var(current_kprobe) = kcb->prev_kprobe.kp;
  187. kcb->kprobe_status = kcb->prev_kprobe.status;
  188. kcb->kprobe_old_eflags = kcb->prev_kprobe.old_eflags;
  189. kcb->kprobe_saved_eflags = kcb->prev_kprobe.saved_eflags;
  190. }
  191. static void __kprobes set_current_kprobe(struct kprobe *p, struct pt_regs *regs,
  192. struct kprobe_ctlblk *kcb)
  193. {
  194. __get_cpu_var(current_kprobe) = p;
  195. kcb->kprobe_saved_eflags = kcb->kprobe_old_eflags
  196. = (regs->eflags & (TF_MASK | IF_MASK));
  197. if (is_IF_modifier(p->opcode))
  198. kcb->kprobe_saved_eflags &= ~IF_MASK;
  199. }
  200. static void __kprobes prepare_singlestep(struct kprobe *p, struct pt_regs *regs)
  201. {
  202. regs->eflags |= TF_MASK;
  203. regs->eflags &= ~IF_MASK;
  204. /*single step inline if the instruction is an int3*/
  205. if (p->opcode == BREAKPOINT_INSTRUCTION)
  206. regs->eip = (unsigned long)p->addr;
  207. else
  208. regs->eip = (unsigned long)p->ainsn.insn;
  209. }
  210. /* Called with kretprobe_lock held */
  211. void __kprobes arch_prepare_kretprobe(struct kretprobe *rp,
  212. struct pt_regs *regs)
  213. {
  214. unsigned long *sara = (unsigned long *)&regs->esp;
  215. struct kretprobe_instance *ri;
  216. if ((ri = get_free_rp_inst(rp)) != NULL) {
  217. ri->rp = rp;
  218. ri->task = current;
  219. ri->ret_addr = (kprobe_opcode_t *) *sara;
  220. /* Replace the return addr with trampoline addr */
  221. *sara = (unsigned long) &kretprobe_trampoline;
  222. add_rp_inst(ri);
  223. } else {
  224. rp->nmissed++;
  225. }
  226. }
  227. /*
  228. * Interrupts are disabled on entry as trap3 is an interrupt gate and they
  229. * remain disabled thorough out this function.
  230. */
  231. static int __kprobes kprobe_handler(struct pt_regs *regs)
  232. {
  233. struct kprobe *p;
  234. int ret = 0;
  235. kprobe_opcode_t *addr;
  236. struct kprobe_ctlblk *kcb;
  237. addr = (kprobe_opcode_t *)(regs->eip - sizeof(kprobe_opcode_t));
  238. /*
  239. * We don't want to be preempted for the entire
  240. * duration of kprobe processing
  241. */
  242. preempt_disable();
  243. kcb = get_kprobe_ctlblk();
  244. /* Check we're not actually recursing */
  245. if (kprobe_running()) {
  246. p = get_kprobe(addr);
  247. if (p) {
  248. if (kcb->kprobe_status == KPROBE_HIT_SS &&
  249. *p->ainsn.insn == BREAKPOINT_INSTRUCTION) {
  250. regs->eflags &= ~TF_MASK;
  251. regs->eflags |= kcb->kprobe_saved_eflags;
  252. goto no_kprobe;
  253. }
  254. /* We have reentered the kprobe_handler(), since
  255. * another probe was hit while within the handler.
  256. * We here save the original kprobes variables and
  257. * just single step on the instruction of the new probe
  258. * without calling any user handlers.
  259. */
  260. save_previous_kprobe(kcb);
  261. set_current_kprobe(p, regs, kcb);
  262. kprobes_inc_nmissed_count(p);
  263. prepare_singlestep(p, regs);
  264. kcb->kprobe_status = KPROBE_REENTER;
  265. return 1;
  266. } else {
  267. if (*addr != BREAKPOINT_INSTRUCTION) {
  268. /* The breakpoint instruction was removed by
  269. * another cpu right after we hit, no further
  270. * handling of this interrupt is appropriate
  271. */
  272. regs->eip -= sizeof(kprobe_opcode_t);
  273. ret = 1;
  274. goto no_kprobe;
  275. }
  276. p = __get_cpu_var(current_kprobe);
  277. if (p->break_handler && p->break_handler(p, regs)) {
  278. goto ss_probe;
  279. }
  280. }
  281. goto no_kprobe;
  282. }
  283. p = get_kprobe(addr);
  284. if (!p) {
  285. if (*addr != BREAKPOINT_INSTRUCTION) {
  286. /*
  287. * The breakpoint instruction was removed right
  288. * after we hit it. Another cpu has removed
  289. * either a probepoint or a debugger breakpoint
  290. * at this address. In either case, no further
  291. * handling of this interrupt is appropriate.
  292. * Back up over the (now missing) int3 and run
  293. * the original instruction.
  294. */
  295. regs->eip -= sizeof(kprobe_opcode_t);
  296. ret = 1;
  297. }
  298. /* Not one of ours: let kernel handle it */
  299. goto no_kprobe;
  300. }
  301. set_current_kprobe(p, regs, kcb);
  302. kcb->kprobe_status = KPROBE_HIT_ACTIVE;
  303. if (p->pre_handler && p->pre_handler(p, regs))
  304. /* handler has already set things up, so skip ss setup */
  305. return 1;
  306. ss_probe:
  307. #if !defined(CONFIG_PREEMPT) || defined(CONFIG_PM)
  308. if (p->ainsn.boostable == 1 && !p->post_handler){
  309. /* Boost up -- we can execute copied instructions directly */
  310. reset_current_kprobe();
  311. regs->eip = (unsigned long)p->ainsn.insn;
  312. preempt_enable_no_resched();
  313. return 1;
  314. }
  315. #endif
  316. prepare_singlestep(p, regs);
  317. kcb->kprobe_status = KPROBE_HIT_SS;
  318. return 1;
  319. no_kprobe:
  320. preempt_enable_no_resched();
  321. return ret;
  322. }
  323. /*
  324. * For function-return probes, init_kprobes() establishes a probepoint
  325. * here. When a retprobed function returns, this probe is hit and
  326. * trampoline_probe_handler() runs, calling the kretprobe's handler.
  327. */
  328. void __kprobes kretprobe_trampoline_holder(void)
  329. {
  330. asm volatile ( ".global kretprobe_trampoline\n"
  331. "kretprobe_trampoline: \n"
  332. " pushf\n"
  333. /* skip cs, eip, orig_eax */
  334. " subl $12, %esp\n"
  335. " pushl %gs\n"
  336. " pushl %ds\n"
  337. " pushl %es\n"
  338. " pushl %eax\n"
  339. " pushl %ebp\n"
  340. " pushl %edi\n"
  341. " pushl %esi\n"
  342. " pushl %edx\n"
  343. " pushl %ecx\n"
  344. " pushl %ebx\n"
  345. " movl %esp, %eax\n"
  346. " call trampoline_handler\n"
  347. /* move eflags to cs */
  348. " movl 52(%esp), %edx\n"
  349. " movl %edx, 48(%esp)\n"
  350. /* save true return address on eflags */
  351. " movl %eax, 52(%esp)\n"
  352. " popl %ebx\n"
  353. " popl %ecx\n"
  354. " popl %edx\n"
  355. " popl %esi\n"
  356. " popl %edi\n"
  357. " popl %ebp\n"
  358. " popl %eax\n"
  359. /* skip eip, orig_eax, es, ds, gs */
  360. " addl $20, %esp\n"
  361. " popf\n"
  362. " ret\n");
  363. }
  364. /*
  365. * Called from kretprobe_trampoline
  366. */
  367. fastcall void *__kprobes trampoline_handler(struct pt_regs *regs)
  368. {
  369. struct kretprobe_instance *ri = NULL;
  370. struct hlist_head *head, empty_rp;
  371. struct hlist_node *node, *tmp;
  372. unsigned long flags, orig_ret_address = 0;
  373. unsigned long trampoline_address =(unsigned long)&kretprobe_trampoline;
  374. INIT_HLIST_HEAD(&empty_rp);
  375. spin_lock_irqsave(&kretprobe_lock, flags);
  376. head = kretprobe_inst_table_head(current);
  377. /* fixup registers */
  378. regs->xcs = __KERNEL_CS;
  379. regs->eip = trampoline_address;
  380. regs->orig_eax = 0xffffffff;
  381. /*
  382. * It is possible to have multiple instances associated with a given
  383. * task either because an multiple functions in the call path
  384. * have a return probe installed on them, and/or more then one return
  385. * return probe was registered for a target function.
  386. *
  387. * We can handle this because:
  388. * - instances are always inserted at the head of the list
  389. * - when multiple return probes are registered for the same
  390. * function, the first instance's ret_addr will point to the
  391. * real return address, and all the rest will point to
  392. * kretprobe_trampoline
  393. */
  394. hlist_for_each_entry_safe(ri, node, tmp, head, hlist) {
  395. if (ri->task != current)
  396. /* another task is sharing our hash bucket */
  397. continue;
  398. if (ri->rp && ri->rp->handler){
  399. __get_cpu_var(current_kprobe) = &ri->rp->kp;
  400. get_kprobe_ctlblk()->kprobe_status = KPROBE_HIT_ACTIVE;
  401. ri->rp->handler(ri, regs);
  402. __get_cpu_var(current_kprobe) = NULL;
  403. }
  404. orig_ret_address = (unsigned long)ri->ret_addr;
  405. recycle_rp_inst(ri, &empty_rp);
  406. if (orig_ret_address != trampoline_address)
  407. /*
  408. * This is the real return address. Any other
  409. * instances associated with this task are for
  410. * other calls deeper on the call stack
  411. */
  412. break;
  413. }
  414. BUG_ON(!orig_ret_address || (orig_ret_address == trampoline_address));
  415. spin_unlock_irqrestore(&kretprobe_lock, flags);
  416. hlist_for_each_entry_safe(ri, node, tmp, &empty_rp, hlist) {
  417. hlist_del(&ri->hlist);
  418. kfree(ri);
  419. }
  420. return (void*)orig_ret_address;
  421. }
  422. /*
  423. * Called after single-stepping. p->addr is the address of the
  424. * instruction whose first byte has been replaced by the "int 3"
  425. * instruction. To avoid the SMP problems that can occur when we
  426. * temporarily put back the original opcode to single-step, we
  427. * single-stepped a copy of the instruction. The address of this
  428. * copy is p->ainsn.insn.
  429. *
  430. * This function prepares to return from the post-single-step
  431. * interrupt. We have to fix up the stack as follows:
  432. *
  433. * 0) Except in the case of absolute or indirect jump or call instructions,
  434. * the new eip is relative to the copied instruction. We need to make
  435. * it relative to the original instruction.
  436. *
  437. * 1) If the single-stepped instruction was pushfl, then the TF and IF
  438. * flags are set in the just-pushed eflags, and may need to be cleared.
  439. *
  440. * 2) If the single-stepped instruction was a call, the return address
  441. * that is atop the stack is the address following the copied instruction.
  442. * We need to make it the address following the original instruction.
  443. *
  444. * This function also checks instruction size for preparing direct execution.
  445. */
  446. static void __kprobes resume_execution(struct kprobe *p,
  447. struct pt_regs *regs, struct kprobe_ctlblk *kcb)
  448. {
  449. unsigned long *tos = (unsigned long *)&regs->esp;
  450. unsigned long copy_eip = (unsigned long)p->ainsn.insn;
  451. unsigned long orig_eip = (unsigned long)p->addr;
  452. regs->eflags &= ~TF_MASK;
  453. switch (p->ainsn.insn[0]) {
  454. case 0x9c: /* pushfl */
  455. *tos &= ~(TF_MASK | IF_MASK);
  456. *tos |= kcb->kprobe_old_eflags;
  457. break;
  458. case 0xc2: /* iret/ret/lret */
  459. case 0xc3:
  460. case 0xca:
  461. case 0xcb:
  462. case 0xcf:
  463. case 0xea: /* jmp absolute -- eip is correct */
  464. /* eip is already adjusted, no more changes required */
  465. p->ainsn.boostable = 1;
  466. goto no_change;
  467. case 0xe8: /* call relative - Fix return addr */
  468. *tos = orig_eip + (*tos - copy_eip);
  469. break;
  470. case 0x9a: /* call absolute -- same as call absolute, indirect */
  471. *tos = orig_eip + (*tos - copy_eip);
  472. goto no_change;
  473. case 0xff:
  474. if ((p->ainsn.insn[1] & 0x30) == 0x10) {
  475. /*
  476. * call absolute, indirect
  477. * Fix return addr; eip is correct.
  478. * But this is not boostable
  479. */
  480. *tos = orig_eip + (*tos - copy_eip);
  481. goto no_change;
  482. } else if (((p->ainsn.insn[1] & 0x31) == 0x20) || /* jmp near, absolute indirect */
  483. ((p->ainsn.insn[1] & 0x31) == 0x21)) { /* jmp far, absolute indirect */
  484. /* eip is correct. And this is boostable */
  485. p->ainsn.boostable = 1;
  486. goto no_change;
  487. }
  488. default:
  489. break;
  490. }
  491. if (p->ainsn.boostable == 0) {
  492. if ((regs->eip > copy_eip) &&
  493. (regs->eip - copy_eip) + 5 < MAX_INSN_SIZE) {
  494. /*
  495. * These instructions can be executed directly if it
  496. * jumps back to correct address.
  497. */
  498. set_jmp_op((void *)regs->eip,
  499. (void *)orig_eip + (regs->eip - copy_eip));
  500. p->ainsn.boostable = 1;
  501. } else {
  502. p->ainsn.boostable = -1;
  503. }
  504. }
  505. regs->eip = orig_eip + (regs->eip - copy_eip);
  506. no_change:
  507. return;
  508. }
  509. /*
  510. * Interrupts are disabled on entry as trap1 is an interrupt gate and they
  511. * remain disabled thoroughout this function.
  512. */
  513. static int __kprobes post_kprobe_handler(struct pt_regs *regs)
  514. {
  515. struct kprobe *cur = kprobe_running();
  516. struct kprobe_ctlblk *kcb = get_kprobe_ctlblk();
  517. if (!cur)
  518. return 0;
  519. if ((kcb->kprobe_status != KPROBE_REENTER) && cur->post_handler) {
  520. kcb->kprobe_status = KPROBE_HIT_SSDONE;
  521. cur->post_handler(cur, regs, 0);
  522. }
  523. resume_execution(cur, regs, kcb);
  524. regs->eflags |= kcb->kprobe_saved_eflags;
  525. /*Restore back the original saved kprobes variables and continue. */
  526. if (kcb->kprobe_status == KPROBE_REENTER) {
  527. restore_previous_kprobe(kcb);
  528. goto out;
  529. }
  530. reset_current_kprobe();
  531. out:
  532. preempt_enable_no_resched();
  533. /*
  534. * if somebody else is singlestepping across a probe point, eflags
  535. * will have TF set, in which case, continue the remaining processing
  536. * of do_debug, as if this is not a probe hit.
  537. */
  538. if (regs->eflags & TF_MASK)
  539. return 0;
  540. return 1;
  541. }
  542. static int __kprobes kprobe_fault_handler(struct pt_regs *regs, int trapnr)
  543. {
  544. struct kprobe *cur = kprobe_running();
  545. struct kprobe_ctlblk *kcb = get_kprobe_ctlblk();
  546. switch(kcb->kprobe_status) {
  547. case KPROBE_HIT_SS:
  548. case KPROBE_REENTER:
  549. /*
  550. * We are here because the instruction being single
  551. * stepped caused a page fault. We reset the current
  552. * kprobe and the eip points back to the probe address
  553. * and allow the page fault handler to continue as a
  554. * normal page fault.
  555. */
  556. regs->eip = (unsigned long)cur->addr;
  557. regs->eflags |= kcb->kprobe_old_eflags;
  558. if (kcb->kprobe_status == KPROBE_REENTER)
  559. restore_previous_kprobe(kcb);
  560. else
  561. reset_current_kprobe();
  562. preempt_enable_no_resched();
  563. break;
  564. case KPROBE_HIT_ACTIVE:
  565. case KPROBE_HIT_SSDONE:
  566. /*
  567. * We increment the nmissed count for accounting,
  568. * we can also use npre/npostfault count for accouting
  569. * these specific fault cases.
  570. */
  571. kprobes_inc_nmissed_count(cur);
  572. /*
  573. * We come here because instructions in the pre/post
  574. * handler caused the page_fault, this could happen
  575. * if handler tries to access user space by
  576. * copy_from_user(), get_user() etc. Let the
  577. * user-specified handler try to fix it first.
  578. */
  579. if (cur->fault_handler && cur->fault_handler(cur, regs, trapnr))
  580. return 1;
  581. /*
  582. * In case the user-specified fault handler returned
  583. * zero, try to fix up.
  584. */
  585. if (fixup_exception(regs))
  586. return 1;
  587. /*
  588. * fixup_exception() could not handle it,
  589. * Let do_page_fault() fix it.
  590. */
  591. break;
  592. default:
  593. break;
  594. }
  595. return 0;
  596. }
  597. /*
  598. * Wrapper routine to for handling exceptions.
  599. */
  600. int __kprobes kprobe_exceptions_notify(struct notifier_block *self,
  601. unsigned long val, void *data)
  602. {
  603. struct die_args *args = (struct die_args *)data;
  604. int ret = NOTIFY_DONE;
  605. if (args->regs && user_mode_vm(args->regs))
  606. return ret;
  607. switch (val) {
  608. case DIE_INT3:
  609. if (kprobe_handler(args->regs))
  610. ret = NOTIFY_STOP;
  611. break;
  612. case DIE_DEBUG:
  613. if (post_kprobe_handler(args->regs))
  614. ret = NOTIFY_STOP;
  615. break;
  616. case DIE_GPF:
  617. case DIE_PAGE_FAULT:
  618. /* kprobe_running() needs smp_processor_id() */
  619. preempt_disable();
  620. if (kprobe_running() &&
  621. kprobe_fault_handler(args->regs, args->trapnr))
  622. ret = NOTIFY_STOP;
  623. preempt_enable();
  624. break;
  625. default:
  626. break;
  627. }
  628. return ret;
  629. }
  630. int __kprobes setjmp_pre_handler(struct kprobe *p, struct pt_regs *regs)
  631. {
  632. struct jprobe *jp = container_of(p, struct jprobe, kp);
  633. unsigned long addr;
  634. struct kprobe_ctlblk *kcb = get_kprobe_ctlblk();
  635. kcb->jprobe_saved_regs = *regs;
  636. kcb->jprobe_saved_esp = &regs->esp;
  637. addr = (unsigned long)(kcb->jprobe_saved_esp);
  638. /*
  639. * TBD: As Linus pointed out, gcc assumes that the callee
  640. * owns the argument space and could overwrite it, e.g.
  641. * tailcall optimization. So, to be absolutely safe
  642. * we also save and restore enough stack bytes to cover
  643. * the argument area.
  644. */
  645. memcpy(kcb->jprobes_stack, (kprobe_opcode_t *)addr,
  646. MIN_STACK_SIZE(addr));
  647. regs->eflags &= ~IF_MASK;
  648. regs->eip = (unsigned long)(jp->entry);
  649. return 1;
  650. }
  651. void __kprobes jprobe_return(void)
  652. {
  653. struct kprobe_ctlblk *kcb = get_kprobe_ctlblk();
  654. asm volatile (" xchgl %%ebx,%%esp \n"
  655. " int3 \n"
  656. " .globl jprobe_return_end \n"
  657. " jprobe_return_end: \n"
  658. " nop \n"::"b"
  659. (kcb->jprobe_saved_esp):"memory");
  660. }
  661. int __kprobes longjmp_break_handler(struct kprobe *p, struct pt_regs *regs)
  662. {
  663. struct kprobe_ctlblk *kcb = get_kprobe_ctlblk();
  664. u8 *addr = (u8 *) (regs->eip - 1);
  665. unsigned long stack_addr = (unsigned long)(kcb->jprobe_saved_esp);
  666. struct jprobe *jp = container_of(p, struct jprobe, kp);
  667. if ((addr > (u8 *) jprobe_return) && (addr < (u8 *) jprobe_return_end)) {
  668. if (&regs->esp != kcb->jprobe_saved_esp) {
  669. struct pt_regs *saved_regs =
  670. container_of(kcb->jprobe_saved_esp,
  671. struct pt_regs, esp);
  672. printk("current esp %p does not match saved esp %p\n",
  673. &regs->esp, kcb->jprobe_saved_esp);
  674. printk("Saved registers for jprobe %p\n", jp);
  675. show_registers(saved_regs);
  676. printk("Current registers\n");
  677. show_registers(regs);
  678. BUG();
  679. }
  680. *regs = kcb->jprobe_saved_regs;
  681. memcpy((kprobe_opcode_t *) stack_addr, kcb->jprobes_stack,
  682. MIN_STACK_SIZE(stack_addr));
  683. preempt_enable_no_resched();
  684. return 1;
  685. }
  686. return 0;
  687. }
  688. int __init arch_init_kprobes(void)
  689. {
  690. return 0;
  691. }