kprobes.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459
  1. /*
  2. * Kernel Probes (KProbes)
  3. * arch/ppc64/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. * 2004-Nov Ananth N Mavinakayanahalli <ananth@in.ibm.com> kprobes port
  27. * for PPC64
  28. */
  29. #include <linux/config.h>
  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/sstep.h>
  36. static DECLARE_MUTEX(kprobe_mutex);
  37. DEFINE_PER_CPU(struct kprobe *, current_kprobe) = NULL;
  38. DEFINE_PER_CPU(struct kprobe_ctlblk, kprobe_ctlblk);
  39. int __kprobes arch_prepare_kprobe(struct kprobe *p)
  40. {
  41. int ret = 0;
  42. kprobe_opcode_t insn = *p->addr;
  43. if ((unsigned long)p->addr & 0x03) {
  44. printk("Attempt to register kprobe at an unaligned address\n");
  45. ret = -EINVAL;
  46. } else if (IS_MTMSRD(insn) || IS_RFID(insn)) {
  47. printk("Cannot register a kprobe on rfid or mtmsrd\n");
  48. ret = -EINVAL;
  49. }
  50. /* insn must be on a special executable page on ppc64 */
  51. if (!ret) {
  52. down(&kprobe_mutex);
  53. p->ainsn.insn = get_insn_slot();
  54. up(&kprobe_mutex);
  55. if (!p->ainsn.insn)
  56. ret = -ENOMEM;
  57. }
  58. return ret;
  59. }
  60. void __kprobes arch_copy_kprobe(struct kprobe *p)
  61. {
  62. memcpy(p->ainsn.insn, p->addr, MAX_INSN_SIZE * sizeof(kprobe_opcode_t));
  63. p->opcode = *p->addr;
  64. }
  65. void __kprobes arch_arm_kprobe(struct kprobe *p)
  66. {
  67. *p->addr = BREAKPOINT_INSTRUCTION;
  68. flush_icache_range((unsigned long) p->addr,
  69. (unsigned long) p->addr + sizeof(kprobe_opcode_t));
  70. }
  71. void __kprobes arch_disarm_kprobe(struct kprobe *p)
  72. {
  73. *p->addr = p->opcode;
  74. flush_icache_range((unsigned long) p->addr,
  75. (unsigned long) p->addr + sizeof(kprobe_opcode_t));
  76. }
  77. void __kprobes arch_remove_kprobe(struct kprobe *p)
  78. {
  79. down(&kprobe_mutex);
  80. free_insn_slot(p->ainsn.insn);
  81. up(&kprobe_mutex);
  82. }
  83. static inline void prepare_singlestep(struct kprobe *p, struct pt_regs *regs)
  84. {
  85. kprobe_opcode_t insn = *p->ainsn.insn;
  86. regs->msr |= MSR_SE;
  87. /* single step inline if it is a trap variant */
  88. if (is_trap(insn))
  89. regs->nip = (unsigned long)p->addr;
  90. else
  91. regs->nip = (unsigned long)p->ainsn.insn;
  92. }
  93. static inline void save_previous_kprobe(struct kprobe_ctlblk *kcb)
  94. {
  95. kcb->prev_kprobe.kp = kprobe_running();
  96. kcb->prev_kprobe.status = kcb->kprobe_status;
  97. kcb->prev_kprobe.saved_msr = kcb->kprobe_saved_msr;
  98. }
  99. static inline void restore_previous_kprobe(struct kprobe_ctlblk *kcb)
  100. {
  101. __get_cpu_var(current_kprobe) = kcb->prev_kprobe.kp;
  102. kcb->kprobe_status = kcb->prev_kprobe.status;
  103. kcb->kprobe_saved_msr = kcb->prev_kprobe.saved_msr;
  104. }
  105. static inline void set_current_kprobe(struct kprobe *p, struct pt_regs *regs,
  106. struct kprobe_ctlblk *kcb)
  107. {
  108. __get_cpu_var(current_kprobe) = p;
  109. kcb->kprobe_saved_msr = regs->msr;
  110. }
  111. /* Called with kretprobe_lock held */
  112. void __kprobes arch_prepare_kretprobe(struct kretprobe *rp,
  113. struct pt_regs *regs)
  114. {
  115. struct kretprobe_instance *ri;
  116. if ((ri = get_free_rp_inst(rp)) != NULL) {
  117. ri->rp = rp;
  118. ri->task = current;
  119. ri->ret_addr = (kprobe_opcode_t *)regs->link;
  120. /* Replace the return addr with trampoline addr */
  121. regs->link = (unsigned long)kretprobe_trampoline;
  122. add_rp_inst(ri);
  123. } else {
  124. rp->nmissed++;
  125. }
  126. }
  127. static inline int kprobe_handler(struct pt_regs *regs)
  128. {
  129. struct kprobe *p;
  130. int ret = 0;
  131. unsigned int *addr = (unsigned int *)regs->nip;
  132. struct kprobe_ctlblk *kcb;
  133. /*
  134. * We don't want to be preempted for the entire
  135. * duration of kprobe processing
  136. */
  137. preempt_disable();
  138. kcb = get_kprobe_ctlblk();
  139. /* Check we're not actually recursing */
  140. if (kprobe_running()) {
  141. p = get_kprobe(addr);
  142. if (p) {
  143. kprobe_opcode_t insn = *p->ainsn.insn;
  144. if (kcb->kprobe_status == KPROBE_HIT_SS &&
  145. is_trap(insn)) {
  146. regs->msr &= ~MSR_SE;
  147. regs->msr |= kcb->kprobe_saved_msr;
  148. goto no_kprobe;
  149. }
  150. /* We have reentered the kprobe_handler(), since
  151. * another probe was hit while within the handler.
  152. * We here save the original kprobes variables and
  153. * just single step on the instruction of the new probe
  154. * without calling any user handlers.
  155. */
  156. save_previous_kprobe(kcb);
  157. set_current_kprobe(p, regs, kcb);
  158. kcb->kprobe_saved_msr = regs->msr;
  159. kprobes_inc_nmissed_count(p);
  160. prepare_singlestep(p, regs);
  161. kcb->kprobe_status = KPROBE_REENTER;
  162. return 1;
  163. } else {
  164. p = __get_cpu_var(current_kprobe);
  165. if (p->break_handler && p->break_handler(p, regs)) {
  166. goto ss_probe;
  167. }
  168. }
  169. goto no_kprobe;
  170. }
  171. p = get_kprobe(addr);
  172. if (!p) {
  173. if (*addr != BREAKPOINT_INSTRUCTION) {
  174. /*
  175. * PowerPC has multiple variants of the "trap"
  176. * instruction. If the current instruction is a
  177. * trap variant, it could belong to someone else
  178. */
  179. kprobe_opcode_t cur_insn = *addr;
  180. if (is_trap(cur_insn))
  181. goto no_kprobe;
  182. /*
  183. * The breakpoint instruction was removed right
  184. * after we hit it. Another cpu has removed
  185. * either a probepoint or a debugger breakpoint
  186. * at this address. In either case, no further
  187. * handling of this interrupt is appropriate.
  188. */
  189. ret = 1;
  190. }
  191. /* Not one of ours: let kernel handle it */
  192. goto no_kprobe;
  193. }
  194. kcb->kprobe_status = KPROBE_HIT_ACTIVE;
  195. set_current_kprobe(p, regs, kcb);
  196. if (p->pre_handler && p->pre_handler(p, regs))
  197. /* handler has already set things up, so skip ss setup */
  198. return 1;
  199. ss_probe:
  200. prepare_singlestep(p, regs);
  201. kcb->kprobe_status = KPROBE_HIT_SS;
  202. return 1;
  203. no_kprobe:
  204. preempt_enable_no_resched();
  205. return ret;
  206. }
  207. /*
  208. * Function return probe trampoline:
  209. * - init_kprobes() establishes a probepoint here
  210. * - When the probed function returns, this probe
  211. * causes the handlers to fire
  212. */
  213. void kretprobe_trampoline_holder(void)
  214. {
  215. asm volatile(".global kretprobe_trampoline\n"
  216. "kretprobe_trampoline:\n"
  217. "nop\n");
  218. }
  219. /*
  220. * Called when the probe at kretprobe trampoline is hit
  221. */
  222. int __kprobes trampoline_probe_handler(struct kprobe *p, struct pt_regs *regs)
  223. {
  224. struct kretprobe_instance *ri = NULL;
  225. struct hlist_head *head;
  226. struct hlist_node *node, *tmp;
  227. unsigned long flags, orig_ret_address = 0;
  228. unsigned long trampoline_address =(unsigned long)&kretprobe_trampoline;
  229. spin_lock_irqsave(&kretprobe_lock, flags);
  230. head = kretprobe_inst_table_head(current);
  231. /*
  232. * It is possible to have multiple instances associated with a given
  233. * task either because an multiple functions in the call path
  234. * have a return probe installed on them, and/or more then one return
  235. * return probe was registered for a target function.
  236. *
  237. * We can handle this because:
  238. * - instances are always inserted at the head of the list
  239. * - when multiple return probes are registered for the same
  240. * function, the first instance's ret_addr will point to the
  241. * real return address, and all the rest will point to
  242. * kretprobe_trampoline
  243. */
  244. hlist_for_each_entry_safe(ri, node, tmp, head, hlist) {
  245. if (ri->task != current)
  246. /* another task is sharing our hash bucket */
  247. continue;
  248. if (ri->rp && ri->rp->handler)
  249. ri->rp->handler(ri, regs);
  250. orig_ret_address = (unsigned long)ri->ret_addr;
  251. recycle_rp_inst(ri);
  252. if (orig_ret_address != trampoline_address)
  253. /*
  254. * This is the real return address. Any other
  255. * instances associated with this task are for
  256. * other calls deeper on the call stack
  257. */
  258. break;
  259. }
  260. BUG_ON(!orig_ret_address || (orig_ret_address == trampoline_address));
  261. regs->nip = orig_ret_address;
  262. reset_current_kprobe();
  263. spin_unlock_irqrestore(&kretprobe_lock, flags);
  264. preempt_enable_no_resched();
  265. /*
  266. * By returning a non-zero value, we are telling
  267. * kprobe_handler() that we don't want the post_handler
  268. * to run (and have re-enabled preemption)
  269. */
  270. return 1;
  271. }
  272. /*
  273. * Called after single-stepping. p->addr is the address of the
  274. * instruction whose first byte has been replaced by the "breakpoint"
  275. * instruction. To avoid the SMP problems that can occur when we
  276. * temporarily put back the original opcode to single-step, we
  277. * single-stepped a copy of the instruction. The address of this
  278. * copy is p->ainsn.insn.
  279. */
  280. static void __kprobes resume_execution(struct kprobe *p, struct pt_regs *regs)
  281. {
  282. int ret;
  283. unsigned int insn = *p->ainsn.insn;
  284. regs->nip = (unsigned long)p->addr;
  285. ret = emulate_step(regs, insn);
  286. if (ret == 0)
  287. regs->nip = (unsigned long)p->addr + 4;
  288. }
  289. static inline int post_kprobe_handler(struct pt_regs *regs)
  290. {
  291. struct kprobe *cur = kprobe_running();
  292. struct kprobe_ctlblk *kcb = get_kprobe_ctlblk();
  293. if (!cur)
  294. return 0;
  295. if ((kcb->kprobe_status != KPROBE_REENTER) && cur->post_handler) {
  296. kcb->kprobe_status = KPROBE_HIT_SSDONE;
  297. cur->post_handler(cur, regs, 0);
  298. }
  299. resume_execution(cur, regs);
  300. regs->msr |= kcb->kprobe_saved_msr;
  301. /*Restore back the original saved kprobes variables and continue. */
  302. if (kcb->kprobe_status == KPROBE_REENTER) {
  303. restore_previous_kprobe(kcb);
  304. goto out;
  305. }
  306. reset_current_kprobe();
  307. out:
  308. preempt_enable_no_resched();
  309. /*
  310. * if somebody else is singlestepping across a probe point, msr
  311. * will have SE set, in which case, continue the remaining processing
  312. * of do_debug, as if this is not a probe hit.
  313. */
  314. if (regs->msr & MSR_SE)
  315. return 0;
  316. return 1;
  317. }
  318. static inline int kprobe_fault_handler(struct pt_regs *regs, int trapnr)
  319. {
  320. struct kprobe *cur = kprobe_running();
  321. struct kprobe_ctlblk *kcb = get_kprobe_ctlblk();
  322. if (cur->fault_handler && cur->fault_handler(cur, regs, trapnr))
  323. return 1;
  324. if (kcb->kprobe_status & KPROBE_HIT_SS) {
  325. resume_execution(cur, regs);
  326. regs->msr &= ~MSR_SE;
  327. regs->msr |= kcb->kprobe_saved_msr;
  328. reset_current_kprobe();
  329. preempt_enable_no_resched();
  330. }
  331. return 0;
  332. }
  333. /*
  334. * Wrapper routine to for handling exceptions.
  335. */
  336. int __kprobes kprobe_exceptions_notify(struct notifier_block *self,
  337. unsigned long val, void *data)
  338. {
  339. struct die_args *args = (struct die_args *)data;
  340. int ret = NOTIFY_DONE;
  341. switch (val) {
  342. case DIE_BPT:
  343. if (kprobe_handler(args->regs))
  344. ret = NOTIFY_STOP;
  345. break;
  346. case DIE_SSTEP:
  347. if (post_kprobe_handler(args->regs))
  348. ret = NOTIFY_STOP;
  349. break;
  350. case DIE_PAGE_FAULT:
  351. /* kprobe_running() needs smp_processor_id() */
  352. preempt_disable();
  353. if (kprobe_running() &&
  354. kprobe_fault_handler(args->regs, args->trapnr))
  355. ret = NOTIFY_STOP;
  356. preempt_enable();
  357. break;
  358. default:
  359. break;
  360. }
  361. return ret;
  362. }
  363. int __kprobes setjmp_pre_handler(struct kprobe *p, struct pt_regs *regs)
  364. {
  365. struct jprobe *jp = container_of(p, struct jprobe, kp);
  366. struct kprobe_ctlblk *kcb = get_kprobe_ctlblk();
  367. memcpy(&kcb->jprobe_saved_regs, regs, sizeof(struct pt_regs));
  368. /* setup return addr to the jprobe handler routine */
  369. regs->nip = (unsigned long)(((func_descr_t *)jp->entry)->entry);
  370. regs->gpr[2] = (unsigned long)(((func_descr_t *)jp->entry)->toc);
  371. return 1;
  372. }
  373. void __kprobes jprobe_return(void)
  374. {
  375. asm volatile("trap" ::: "memory");
  376. }
  377. void __kprobes jprobe_return_end(void)
  378. {
  379. };
  380. int __kprobes longjmp_break_handler(struct kprobe *p, struct pt_regs *regs)
  381. {
  382. struct kprobe_ctlblk *kcb = get_kprobe_ctlblk();
  383. /*
  384. * FIXME - we should ideally be validating that we got here 'cos
  385. * of the "trap" in jprobe_return() above, before restoring the
  386. * saved regs...
  387. */
  388. memcpy(regs, &kcb->jprobe_saved_regs, sizeof(struct pt_regs));
  389. preempt_enable_no_resched();
  390. return 1;
  391. }
  392. static struct kprobe trampoline_p = {
  393. .addr = (kprobe_opcode_t *) &kretprobe_trampoline,
  394. .pre_handler = trampoline_probe_handler
  395. };
  396. int __init arch_init_kprobes(void)
  397. {
  398. return register_kprobe(&trampoline_p);
  399. }