2 * Kernel Probes (KProbes)
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.
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.
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.
19 * Copyright (C) IBM Corporation, 2002, 2004
21 * 2002-Oct Created by Vamsi Krishna S <vamsi_krishna@in.ibm.com> Kernel
22 * Probes initial implementation (includes suggestions from
24 * 2004-Aug Updated by Prasanna S Panchamukhi <prasanna@in.ibm.com> with
25 * hlists and exceptions notifier as suggested by Andi Kleen.
26 * 2004-July Suparna Bhattacharya <suparna@in.ibm.com> added jumper probes
27 * interface to access function arguments.
28 * 2004-Sep Prasanna S Panchamukhi <prasanna@in.ibm.com> Changed Kprobes
29 * exceptions notifier to be first on the priority list.
30 * 2005-May Hien Nguyen <hien@us.ibm.com>, Jim Keniston
31 * <jkenisto@us.ibm.com> and Prasanna S Panchamukhi
32 * <prasanna@in.ibm.com> added function-return probes.
34 #include <linux/kprobes.h>
35 #include <linux/hash.h>
36 #include <linux/init.h>
37 #include <linux/slab.h>
38 #include <linux/stddef.h>
39 #include <linux/export.h>
40 #include <linux/moduleloader.h>
41 #include <linux/kallsyms.h>
42 #include <linux/freezer.h>
43 #include <linux/seq_file.h>
44 #include <linux/debugfs.h>
45 #include <linux/sysctl.h>
46 #include <linux/kdebug.h>
47 #include <linux/memory.h>
48 #include <linux/ftrace.h>
49 #include <linux/cpu.h>
50 #include <linux/jump_label.h>
52 #include <asm/sections.h>
53 #include <asm/cacheflush.h>
54 #include <asm/errno.h>
55 #include <linux/uaccess.h>
57 #define KPROBE_HASH_BITS 6
58 #define KPROBE_TABLE_SIZE (1 << KPROBE_HASH_BITS)
61 static int kprobes_initialized;
62 static struct hlist_head kprobe_table[KPROBE_TABLE_SIZE];
63 static struct hlist_head kretprobe_inst_table[KPROBE_TABLE_SIZE];
65 /* NOTE: change this value only with kprobe_mutex held */
66 static bool kprobes_all_disarmed;
68 /* This protects kprobe_table and optimizing_list */
69 static DEFINE_MUTEX(kprobe_mutex);
70 static DEFINE_PER_CPU(struct kprobe *, kprobe_instance) = NULL;
72 raw_spinlock_t lock ____cacheline_aligned_in_smp;
73 } kretprobe_table_locks[KPROBE_TABLE_SIZE];
75 kprobe_opcode_t * __weak kprobe_lookup_name(const char *name,
76 unsigned int __unused)
78 return ((kprobe_opcode_t *)(kallsyms_lookup_name(name)));
81 static raw_spinlock_t *kretprobe_table_lock_ptr(unsigned long hash)
83 return &(kretprobe_table_locks[hash].lock);
86 /* Blacklist -- list of struct kprobe_blacklist_entry */
87 static LIST_HEAD(kprobe_blacklist);
89 #ifdef __ARCH_WANT_KPROBES_INSN_SLOT
91 * kprobe->ainsn.insn points to the copy of the instruction to be
92 * single-stepped. x86_64, POWER4 and above have no-exec support and
93 * stepping on the instruction on a vmalloced/kmalloced/data page
94 * is a recipe for disaster
96 struct kprobe_insn_page {
97 struct list_head list;
98 kprobe_opcode_t *insns; /* Page of instruction slots */
99 struct kprobe_insn_cache *cache;
105 #define KPROBE_INSN_PAGE_SIZE(slots) \
106 (offsetof(struct kprobe_insn_page, slot_used) + \
107 (sizeof(char) * (slots)))
109 static int slots_per_page(struct kprobe_insn_cache *c)
111 return PAGE_SIZE/(c->insn_size * sizeof(kprobe_opcode_t));
114 enum kprobe_slot_state {
120 static void *alloc_insn_page(void)
122 return module_alloc(PAGE_SIZE);
125 void __weak free_insn_page(void *page)
127 module_memfree(page);
130 struct kprobe_insn_cache kprobe_insn_slots = {
131 .mutex = __MUTEX_INITIALIZER(kprobe_insn_slots.mutex),
132 .alloc = alloc_insn_page,
133 .free = free_insn_page,
134 .pages = LIST_HEAD_INIT(kprobe_insn_slots.pages),
135 .insn_size = MAX_INSN_SIZE,
138 static int collect_garbage_slots(struct kprobe_insn_cache *c);
141 * __get_insn_slot() - Find a slot on an executable page for an instruction.
142 * We allocate an executable page if there's no room on existing ones.
144 kprobe_opcode_t *__get_insn_slot(struct kprobe_insn_cache *c)
146 struct kprobe_insn_page *kip;
147 kprobe_opcode_t *slot = NULL;
149 /* Since the slot array is not protected by rcu, we need a mutex */
150 mutex_lock(&c->mutex);
153 list_for_each_entry_rcu(kip, &c->pages, list) {
154 if (kip->nused < slots_per_page(c)) {
156 for (i = 0; i < slots_per_page(c); i++) {
157 if (kip->slot_used[i] == SLOT_CLEAN) {
158 kip->slot_used[i] = SLOT_USED;
160 slot = kip->insns + (i * c->insn_size);
165 /* kip->nused is broken. Fix it. */
166 kip->nused = slots_per_page(c);
172 /* If there are any garbage slots, collect it and try again. */
173 if (c->nr_garbage && collect_garbage_slots(c) == 0)
176 /* All out of space. Need to allocate a new page. */
177 kip = kmalloc(KPROBE_INSN_PAGE_SIZE(slots_per_page(c)), GFP_KERNEL);
182 * Use module_alloc so this page is within +/- 2GB of where the
183 * kernel image and loaded module images reside. This is required
184 * so x86_64 can correctly handle the %rip-relative fixups.
186 kip->insns = c->alloc();
191 INIT_LIST_HEAD(&kip->list);
192 memset(kip->slot_used, SLOT_CLEAN, slots_per_page(c));
193 kip->slot_used[0] = SLOT_USED;
197 list_add_rcu(&kip->list, &c->pages);
200 mutex_unlock(&c->mutex);
204 /* Return 1 if all garbages are collected, otherwise 0. */
205 static int collect_one_slot(struct kprobe_insn_page *kip, int idx)
207 kip->slot_used[idx] = SLOT_CLEAN;
209 if (kip->nused == 0) {
211 * Page is no longer in use. Free it unless
212 * it's the last one. We keep the last one
213 * so as not to have to set it up again the
214 * next time somebody inserts a probe.
216 if (!list_is_singular(&kip->list)) {
217 list_del_rcu(&kip->list);
219 kip->cache->free(kip->insns);
227 static int collect_garbage_slots(struct kprobe_insn_cache *c)
229 struct kprobe_insn_page *kip, *next;
231 /* Ensure no-one is interrupted on the garbages */
234 list_for_each_entry_safe(kip, next, &c->pages, list) {
236 if (kip->ngarbage == 0)
238 kip->ngarbage = 0; /* we will collect all garbages */
239 for (i = 0; i < slots_per_page(c); i++) {
240 if (kip->slot_used[i] == SLOT_DIRTY && collect_one_slot(kip, i))
248 void __free_insn_slot(struct kprobe_insn_cache *c,
249 kprobe_opcode_t *slot, int dirty)
251 struct kprobe_insn_page *kip;
254 mutex_lock(&c->mutex);
256 list_for_each_entry_rcu(kip, &c->pages, list) {
257 idx = ((long)slot - (long)kip->insns) /
258 (c->insn_size * sizeof(kprobe_opcode_t));
259 if (idx >= 0 && idx < slots_per_page(c))
262 /* Could not find this slot. */
267 /* Mark and sweep: this may sleep */
269 /* Check double free */
270 WARN_ON(kip->slot_used[idx] != SLOT_USED);
272 kip->slot_used[idx] = SLOT_DIRTY;
274 if (++c->nr_garbage > slots_per_page(c))
275 collect_garbage_slots(c);
277 collect_one_slot(kip, idx);
280 mutex_unlock(&c->mutex);
284 * Check given address is on the page of kprobe instruction slots.
285 * This will be used for checking whether the address on a stack
286 * is on a text area or not.
288 bool __is_insn_slot_addr(struct kprobe_insn_cache *c, unsigned long addr)
290 struct kprobe_insn_page *kip;
294 list_for_each_entry_rcu(kip, &c->pages, list) {
295 if (addr >= (unsigned long)kip->insns &&
296 addr < (unsigned long)kip->insns + PAGE_SIZE) {
306 #ifdef CONFIG_OPTPROBES
307 /* For optimized_kprobe buffer */
308 struct kprobe_insn_cache kprobe_optinsn_slots = {
309 .mutex = __MUTEX_INITIALIZER(kprobe_optinsn_slots.mutex),
310 .alloc = alloc_insn_page,
311 .free = free_insn_page,
312 .pages = LIST_HEAD_INIT(kprobe_optinsn_slots.pages),
313 /* .insn_size is initialized later */
319 /* We have preemption disabled.. so it is safe to use __ versions */
320 static inline void set_kprobe_instance(struct kprobe *kp)
322 __this_cpu_write(kprobe_instance, kp);
325 static inline void reset_kprobe_instance(void)
327 __this_cpu_write(kprobe_instance, NULL);
331 * This routine is called either:
332 * - under the kprobe_mutex - during kprobe_[un]register()
334 * - with preemption disabled - from arch/xxx/kernel/kprobes.c
336 struct kprobe *get_kprobe(void *addr)
338 struct hlist_head *head;
341 head = &kprobe_table[hash_ptr(addr, KPROBE_HASH_BITS)];
342 hlist_for_each_entry_rcu(p, head, hlist) {
349 NOKPROBE_SYMBOL(get_kprobe);
351 static int aggr_pre_handler(struct kprobe *p, struct pt_regs *regs);
353 /* Return true if the kprobe is an aggregator */
354 static inline int kprobe_aggrprobe(struct kprobe *p)
356 return p->pre_handler == aggr_pre_handler;
359 /* Return true(!0) if the kprobe is unused */
360 static inline int kprobe_unused(struct kprobe *p)
362 return kprobe_aggrprobe(p) && kprobe_disabled(p) &&
363 list_empty(&p->list);
367 * Keep all fields in the kprobe consistent
369 static inline void copy_kprobe(struct kprobe *ap, struct kprobe *p)
371 memcpy(&p->opcode, &ap->opcode, sizeof(kprobe_opcode_t));
372 memcpy(&p->ainsn, &ap->ainsn, sizeof(struct arch_specific_insn));
375 #ifdef CONFIG_OPTPROBES
376 /* NOTE: change this value only with kprobe_mutex held */
377 static bool kprobes_allow_optimization;
380 * Call all pre_handler on the list, but ignores its return value.
381 * This must be called from arch-dep optimized caller.
383 void opt_pre_handler(struct kprobe *p, struct pt_regs *regs)
387 list_for_each_entry_rcu(kp, &p->list, list) {
388 if (kp->pre_handler && likely(!kprobe_disabled(kp))) {
389 set_kprobe_instance(kp);
390 kp->pre_handler(kp, regs);
392 reset_kprobe_instance();
395 NOKPROBE_SYMBOL(opt_pre_handler);
397 /* Free optimized instructions and optimized_kprobe */
398 static void free_aggr_kprobe(struct kprobe *p)
400 struct optimized_kprobe *op;
402 op = container_of(p, struct optimized_kprobe, kp);
403 arch_remove_optimized_kprobe(op);
404 arch_remove_kprobe(p);
408 /* Return true(!0) if the kprobe is ready for optimization. */
409 static inline int kprobe_optready(struct kprobe *p)
411 struct optimized_kprobe *op;
413 if (kprobe_aggrprobe(p)) {
414 op = container_of(p, struct optimized_kprobe, kp);
415 return arch_prepared_optinsn(&op->optinsn);
421 /* Return true if the kprobe is disarmed. Note: p must be on hash list */
422 bool kprobe_disarmed(struct kprobe *p)
424 struct optimized_kprobe *op;
426 /* If kprobe is not aggr/opt probe, just return kprobe is disabled */
427 if (!kprobe_aggrprobe(p))
428 return kprobe_disabled(p);
430 op = container_of(p, struct optimized_kprobe, kp);
432 return kprobe_disabled(p) && list_empty(&op->list);
435 /* Return true(!0) if the probe is queued on (un)optimizing lists */
436 static int kprobe_queued(struct kprobe *p)
438 struct optimized_kprobe *op;
440 if (kprobe_aggrprobe(p)) {
441 op = container_of(p, struct optimized_kprobe, kp);
442 if (!list_empty(&op->list))
449 * Return an optimized kprobe whose optimizing code replaces
450 * instructions including addr (exclude breakpoint).
452 static struct kprobe *get_optimized_kprobe(unsigned long addr)
455 struct kprobe *p = NULL;
456 struct optimized_kprobe *op;
458 /* Don't check i == 0, since that is a breakpoint case. */
459 for (i = 1; !p && i < MAX_OPTIMIZED_LENGTH; i++)
460 p = get_kprobe((void *)(addr - i));
462 if (p && kprobe_optready(p)) {
463 op = container_of(p, struct optimized_kprobe, kp);
464 if (arch_within_optimized_kprobe(op, addr))
471 /* Optimization staging list, protected by kprobe_mutex */
472 static LIST_HEAD(optimizing_list);
473 static LIST_HEAD(unoptimizing_list);
474 static LIST_HEAD(freeing_list);
476 static void kprobe_optimizer(struct work_struct *work);
477 static DECLARE_DELAYED_WORK(optimizing_work, kprobe_optimizer);
478 #define OPTIMIZE_DELAY 5
481 * Optimize (replace a breakpoint with a jump) kprobes listed on
484 static void do_optimize_kprobes(void)
486 lockdep_assert_held(&text_mutex);
488 * The optimization/unoptimization refers online_cpus via
489 * stop_machine() and cpu-hotplug modifies online_cpus.
490 * And same time, text_mutex will be held in cpu-hotplug and here.
491 * This combination can cause a deadlock (cpu-hotplug try to lock
492 * text_mutex but stop_machine can not be done because online_cpus
494 * To avoid this deadlock, caller must have locked cpu hotplug
495 * for preventing cpu-hotplug outside of text_mutex locking.
497 lockdep_assert_cpus_held();
499 /* Optimization never be done when disarmed */
500 if (kprobes_all_disarmed || !kprobes_allow_optimization ||
501 list_empty(&optimizing_list))
504 arch_optimize_kprobes(&optimizing_list);
508 * Unoptimize (replace a jump with a breakpoint and remove the breakpoint
509 * if need) kprobes listed on unoptimizing_list.
511 static void do_unoptimize_kprobes(void)
513 struct optimized_kprobe *op, *tmp;
515 lockdep_assert_held(&text_mutex);
516 /* See comment in do_optimize_kprobes() */
517 lockdep_assert_cpus_held();
519 /* Unoptimization must be done anytime */
520 if (list_empty(&unoptimizing_list))
523 arch_unoptimize_kprobes(&unoptimizing_list, &freeing_list);
524 /* Loop free_list for disarming */
525 list_for_each_entry_safe(op, tmp, &freeing_list, list) {
526 /* Switching from detour code to origin */
527 op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
528 /* Disarm probes if marked disabled */
529 if (kprobe_disabled(&op->kp))
530 arch_disarm_kprobe(&op->kp);
531 if (kprobe_unused(&op->kp)) {
533 * Remove unused probes from hash list. After waiting
534 * for synchronization, these probes are reclaimed.
535 * (reclaiming is done by do_free_cleaned_kprobes.)
537 hlist_del_rcu(&op->kp.hlist);
539 list_del_init(&op->list);
543 /* Reclaim all kprobes on the free_list */
544 static void do_free_cleaned_kprobes(void)
546 struct optimized_kprobe *op, *tmp;
548 list_for_each_entry_safe(op, tmp, &freeing_list, list) {
549 list_del_init(&op->list);
550 if (WARN_ON_ONCE(!kprobe_unused(&op->kp))) {
552 * This must not happen, but if there is a kprobe
553 * still in use, keep it on kprobes hash list.
557 free_aggr_kprobe(&op->kp);
561 /* Start optimizer after OPTIMIZE_DELAY passed */
562 static void kick_kprobe_optimizer(void)
564 schedule_delayed_work(&optimizing_work, OPTIMIZE_DELAY);
567 /* Kprobe jump optimizer */
568 static void kprobe_optimizer(struct work_struct *work)
570 mutex_lock(&kprobe_mutex);
572 mutex_lock(&text_mutex);
573 /* Lock modules while optimizing kprobes */
574 mutex_lock(&module_mutex);
577 * Step 1: Unoptimize kprobes and collect cleaned (unused and disarmed)
578 * kprobes before waiting for quiesence period.
580 do_unoptimize_kprobes();
583 * Step 2: Wait for quiesence period to ensure all potentially
584 * preempted tasks to have normally scheduled. Because optprobe
585 * may modify multiple instructions, there is a chance that Nth
586 * instruction is preempted. In that case, such tasks can return
587 * to 2nd-Nth byte of jump instruction. This wait is for avoiding it.
588 * Note that on non-preemptive kernel, this is transparently converted
589 * to synchronoze_sched() to wait for all interrupts to have completed.
591 synchronize_rcu_tasks();
593 /* Step 3: Optimize kprobes after quiesence period */
594 do_optimize_kprobes();
596 /* Step 4: Free cleaned kprobes after quiesence period */
597 do_free_cleaned_kprobes();
599 mutex_unlock(&module_mutex);
600 mutex_unlock(&text_mutex);
603 /* Step 5: Kick optimizer again if needed */
604 if (!list_empty(&optimizing_list) || !list_empty(&unoptimizing_list))
605 kick_kprobe_optimizer();
607 mutex_unlock(&kprobe_mutex);
610 /* Wait for completing optimization and unoptimization */
611 void wait_for_kprobe_optimizer(void)
613 mutex_lock(&kprobe_mutex);
615 while (!list_empty(&optimizing_list) || !list_empty(&unoptimizing_list)) {
616 mutex_unlock(&kprobe_mutex);
618 /* this will also make optimizing_work execute immmediately */
619 flush_delayed_work(&optimizing_work);
620 /* @optimizing_work might not have been queued yet, relax */
623 mutex_lock(&kprobe_mutex);
626 mutex_unlock(&kprobe_mutex);
629 bool optprobe_queued_unopt(struct optimized_kprobe *op)
631 struct optimized_kprobe *_op;
633 list_for_each_entry(_op, &unoptimizing_list, list) {
641 /* Optimize kprobe if p is ready to be optimized */
642 static void optimize_kprobe(struct kprobe *p)
644 struct optimized_kprobe *op;
646 /* Check if the kprobe is disabled or not ready for optimization. */
647 if (!kprobe_optready(p) || !kprobes_allow_optimization ||
648 (kprobe_disabled(p) || kprobes_all_disarmed))
651 /* Both of break_handler and post_handler are not supported. */
652 if (p->break_handler || p->post_handler)
655 op = container_of(p, struct optimized_kprobe, kp);
657 /* Check there is no other kprobes at the optimized instructions */
658 if (arch_check_optimized_kprobe(op) < 0)
661 /* Check if it is already optimized. */
662 if (op->kp.flags & KPROBE_FLAG_OPTIMIZED) {
663 if (optprobe_queued_unopt(op)) {
664 /* This is under unoptimizing. Just dequeue the probe */
665 list_del_init(&op->list);
669 op->kp.flags |= KPROBE_FLAG_OPTIMIZED;
671 /* On unoptimizing/optimizing_list, op must have OPTIMIZED flag */
672 if (WARN_ON_ONCE(!list_empty(&op->list)))
675 list_add(&op->list, &optimizing_list);
676 kick_kprobe_optimizer();
679 /* Short cut to direct unoptimizing */
680 static void force_unoptimize_kprobe(struct optimized_kprobe *op)
682 lockdep_assert_cpus_held();
683 arch_unoptimize_kprobe(op);
684 op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
685 if (kprobe_disabled(&op->kp))
686 arch_disarm_kprobe(&op->kp);
689 /* Unoptimize a kprobe if p is optimized */
690 static void unoptimize_kprobe(struct kprobe *p, bool force)
692 struct optimized_kprobe *op;
694 if (!kprobe_aggrprobe(p) || kprobe_disarmed(p))
695 return; /* This is not an optprobe nor optimized */
697 op = container_of(p, struct optimized_kprobe, kp);
698 if (!kprobe_optimized(p))
701 if (!list_empty(&op->list)) {
702 if (optprobe_queued_unopt(op)) {
703 /* Queued in unoptimizing queue */
706 * Forcibly unoptimize the kprobe here, and queue it
707 * in the freeing list for release afterwards.
709 force_unoptimize_kprobe(op);
710 list_move(&op->list, &freeing_list);
713 /* Dequeue from the optimizing queue */
714 list_del_init(&op->list);
715 op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
720 /* Optimized kprobe case */
722 /* Forcibly update the code: this is a special case */
723 force_unoptimize_kprobe(op);
725 list_add(&op->list, &unoptimizing_list);
726 kick_kprobe_optimizer();
730 /* Cancel unoptimizing for reusing */
731 static int reuse_unused_kprobe(struct kprobe *ap)
733 struct optimized_kprobe *op;
735 BUG_ON(!kprobe_unused(ap));
737 * Unused kprobe MUST be on the way of delayed unoptimizing (means
738 * there is still a relative jump) and disabled.
740 op = container_of(ap, struct optimized_kprobe, kp);
741 if (unlikely(list_empty(&op->list)))
742 printk(KERN_WARNING "Warning: found a stray unused "
743 "aggrprobe@%p\n", ap->addr);
744 /* Enable the probe again */
745 ap->flags &= ~KPROBE_FLAG_DISABLED;
746 /* Optimize it again (remove from op->list) */
747 if (!kprobe_optready(ap))
754 /* Remove optimized instructions */
755 static void kill_optimized_kprobe(struct kprobe *p)
757 struct optimized_kprobe *op;
759 op = container_of(p, struct optimized_kprobe, kp);
760 if (!list_empty(&op->list))
761 /* Dequeue from the (un)optimization queue */
762 list_del_init(&op->list);
763 op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
765 if (kprobe_unused(p)) {
766 /* Enqueue if it is unused */
767 list_add(&op->list, &freeing_list);
769 * Remove unused probes from the hash list. After waiting
770 * for synchronization, this probe is reclaimed.
771 * (reclaiming is done by do_free_cleaned_kprobes().)
773 hlist_del_rcu(&op->kp.hlist);
776 /* Don't touch the code, because it is already freed. */
777 arch_remove_optimized_kprobe(op);
781 void __prepare_optimized_kprobe(struct optimized_kprobe *op, struct kprobe *p)
783 if (!kprobe_ftrace(p))
784 arch_prepare_optimized_kprobe(op, p);
787 /* Try to prepare optimized instructions */
788 static void prepare_optimized_kprobe(struct kprobe *p)
790 struct optimized_kprobe *op;
792 op = container_of(p, struct optimized_kprobe, kp);
793 __prepare_optimized_kprobe(op, p);
796 /* Allocate new optimized_kprobe and try to prepare optimized instructions */
797 static struct kprobe *alloc_aggr_kprobe(struct kprobe *p)
799 struct optimized_kprobe *op;
801 op = kzalloc(sizeof(struct optimized_kprobe), GFP_KERNEL);
805 INIT_LIST_HEAD(&op->list);
806 op->kp.addr = p->addr;
807 __prepare_optimized_kprobe(op, p);
812 static void init_aggr_kprobe(struct kprobe *ap, struct kprobe *p);
815 * Prepare an optimized_kprobe and optimize it
816 * NOTE: p must be a normal registered kprobe
818 static void try_to_optimize_kprobe(struct kprobe *p)
821 struct optimized_kprobe *op;
823 /* Impossible to optimize ftrace-based kprobe */
824 if (kprobe_ftrace(p))
827 /* For preparing optimization, jump_label_text_reserved() is called */
830 mutex_lock(&text_mutex);
832 ap = alloc_aggr_kprobe(p);
836 op = container_of(ap, struct optimized_kprobe, kp);
837 if (!arch_prepared_optinsn(&op->optinsn)) {
838 /* If failed to setup optimizing, fallback to kprobe */
839 arch_remove_optimized_kprobe(op);
844 init_aggr_kprobe(ap, p);
845 optimize_kprobe(ap); /* This just kicks optimizer thread */
848 mutex_unlock(&text_mutex);
854 static void optimize_all_kprobes(void)
856 struct hlist_head *head;
860 mutex_lock(&kprobe_mutex);
861 /* If optimization is already allowed, just return */
862 if (kprobes_allow_optimization)
866 kprobes_allow_optimization = true;
867 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
868 head = &kprobe_table[i];
869 hlist_for_each_entry_rcu(p, head, hlist)
870 if (!kprobe_disabled(p))
874 printk(KERN_INFO "Kprobes globally optimized\n");
876 mutex_unlock(&kprobe_mutex);
879 static void unoptimize_all_kprobes(void)
881 struct hlist_head *head;
885 mutex_lock(&kprobe_mutex);
886 /* If optimization is already prohibited, just return */
887 if (!kprobes_allow_optimization) {
888 mutex_unlock(&kprobe_mutex);
893 kprobes_allow_optimization = false;
894 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
895 head = &kprobe_table[i];
896 hlist_for_each_entry_rcu(p, head, hlist) {
897 if (!kprobe_disabled(p))
898 unoptimize_kprobe(p, false);
902 mutex_unlock(&kprobe_mutex);
904 /* Wait for unoptimizing completion */
905 wait_for_kprobe_optimizer();
906 printk(KERN_INFO "Kprobes globally unoptimized\n");
909 static DEFINE_MUTEX(kprobe_sysctl_mutex);
910 int sysctl_kprobes_optimization;
911 int proc_kprobes_optimization_handler(struct ctl_table *table, int write,
912 void __user *buffer, size_t *length,
917 mutex_lock(&kprobe_sysctl_mutex);
918 sysctl_kprobes_optimization = kprobes_allow_optimization ? 1 : 0;
919 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
921 if (sysctl_kprobes_optimization)
922 optimize_all_kprobes();
924 unoptimize_all_kprobes();
925 mutex_unlock(&kprobe_sysctl_mutex);
929 #endif /* CONFIG_SYSCTL */
931 /* Put a breakpoint for a probe. Must be called with text_mutex locked */
932 static void __arm_kprobe(struct kprobe *p)
936 /* Check collision with other optimized kprobes */
937 _p = get_optimized_kprobe((unsigned long)p->addr);
939 /* Fallback to unoptimized kprobe */
940 unoptimize_kprobe(_p, true);
943 optimize_kprobe(p); /* Try to optimize (add kprobe to a list) */
946 /* Remove the breakpoint of a probe. Must be called with text_mutex locked */
947 static void __disarm_kprobe(struct kprobe *p, bool reopt)
951 /* Try to unoptimize */
952 unoptimize_kprobe(p, kprobes_all_disarmed);
954 if (!kprobe_queued(p)) {
955 arch_disarm_kprobe(p);
956 /* If another kprobe was blocked, optimize it. */
957 _p = get_optimized_kprobe((unsigned long)p->addr);
958 if (unlikely(_p) && reopt)
961 /* TODO: reoptimize others after unoptimized this probe */
964 #else /* !CONFIG_OPTPROBES */
966 #define optimize_kprobe(p) do {} while (0)
967 #define unoptimize_kprobe(p, f) do {} while (0)
968 #define kill_optimized_kprobe(p) do {} while (0)
969 #define prepare_optimized_kprobe(p) do {} while (0)
970 #define try_to_optimize_kprobe(p) do {} while (0)
971 #define __arm_kprobe(p) arch_arm_kprobe(p)
972 #define __disarm_kprobe(p, o) arch_disarm_kprobe(p)
973 #define kprobe_disarmed(p) kprobe_disabled(p)
974 #define wait_for_kprobe_optimizer() do {} while (0)
976 static int reuse_unused_kprobe(struct kprobe *ap)
979 * If the optimized kprobe is NOT supported, the aggr kprobe is
980 * released at the same time that the last aggregated kprobe is
982 * Thus there should be no chance to reuse unused kprobe.
984 printk(KERN_ERR "Error: There should be no unused kprobe here.\n");
988 static void free_aggr_kprobe(struct kprobe *p)
990 arch_remove_kprobe(p);
994 static struct kprobe *alloc_aggr_kprobe(struct kprobe *p)
996 return kzalloc(sizeof(struct kprobe), GFP_KERNEL);
998 #endif /* CONFIG_OPTPROBES */
1000 #ifdef CONFIG_KPROBES_ON_FTRACE
1001 static struct ftrace_ops kprobe_ftrace_ops __read_mostly = {
1002 .func = kprobe_ftrace_handler,
1003 .flags = FTRACE_OPS_FL_SAVE_REGS | FTRACE_OPS_FL_IPMODIFY,
1005 static int kprobe_ftrace_enabled;
1007 /* Must ensure p->addr is really on ftrace */
1008 static int prepare_kprobe(struct kprobe *p)
1010 if (!kprobe_ftrace(p))
1011 return arch_prepare_kprobe(p);
1013 return arch_prepare_kprobe_ftrace(p);
1016 /* Caller must lock kprobe_mutex */
1017 static void arm_kprobe_ftrace(struct kprobe *p)
1021 ret = ftrace_set_filter_ip(&kprobe_ftrace_ops,
1022 (unsigned long)p->addr, 0, 0);
1023 WARN(ret < 0, "Failed to arm kprobe-ftrace at %p (%d)\n", p->addr, ret);
1024 kprobe_ftrace_enabled++;
1025 if (kprobe_ftrace_enabled == 1) {
1026 ret = register_ftrace_function(&kprobe_ftrace_ops);
1027 WARN(ret < 0, "Failed to init kprobe-ftrace (%d)\n", ret);
1031 /* Caller must lock kprobe_mutex */
1032 static void disarm_kprobe_ftrace(struct kprobe *p)
1036 kprobe_ftrace_enabled--;
1037 if (kprobe_ftrace_enabled == 0) {
1038 ret = unregister_ftrace_function(&kprobe_ftrace_ops);
1039 WARN(ret < 0, "Failed to init kprobe-ftrace (%d)\n", ret);
1041 ret = ftrace_set_filter_ip(&kprobe_ftrace_ops,
1042 (unsigned long)p->addr, 1, 0);
1043 WARN(ret < 0, "Failed to disarm kprobe-ftrace at %p (%d)\n", p->addr, ret);
1045 #else /* !CONFIG_KPROBES_ON_FTRACE */
1046 #define prepare_kprobe(p) arch_prepare_kprobe(p)
1047 #define arm_kprobe_ftrace(p) do {} while (0)
1048 #define disarm_kprobe_ftrace(p) do {} while (0)
1051 /* Arm a kprobe with text_mutex */
1052 static void arm_kprobe(struct kprobe *kp)
1054 if (unlikely(kprobe_ftrace(kp))) {
1055 arm_kprobe_ftrace(kp);
1059 mutex_lock(&text_mutex);
1061 mutex_unlock(&text_mutex);
1065 /* Disarm a kprobe with text_mutex */
1066 static void disarm_kprobe(struct kprobe *kp, bool reopt)
1068 if (unlikely(kprobe_ftrace(kp))) {
1069 disarm_kprobe_ftrace(kp);
1074 mutex_lock(&text_mutex);
1075 __disarm_kprobe(kp, reopt);
1076 mutex_unlock(&text_mutex);
1081 * Aggregate handlers for multiple kprobes support - these handlers
1082 * take care of invoking the individual kprobe handlers on p->list
1084 static int aggr_pre_handler(struct kprobe *p, struct pt_regs *regs)
1088 list_for_each_entry_rcu(kp, &p->list, list) {
1089 if (kp->pre_handler && likely(!kprobe_disabled(kp))) {
1090 set_kprobe_instance(kp);
1091 if (kp->pre_handler(kp, regs))
1094 reset_kprobe_instance();
1098 NOKPROBE_SYMBOL(aggr_pre_handler);
1100 static void aggr_post_handler(struct kprobe *p, struct pt_regs *regs,
1101 unsigned long flags)
1105 list_for_each_entry_rcu(kp, &p->list, list) {
1106 if (kp->post_handler && likely(!kprobe_disabled(kp))) {
1107 set_kprobe_instance(kp);
1108 kp->post_handler(kp, regs, flags);
1109 reset_kprobe_instance();
1113 NOKPROBE_SYMBOL(aggr_post_handler);
1115 static int aggr_fault_handler(struct kprobe *p, struct pt_regs *regs,
1118 struct kprobe *cur = __this_cpu_read(kprobe_instance);
1121 * if we faulted "during" the execution of a user specified
1122 * probe handler, invoke just that probe's fault handler
1124 if (cur && cur->fault_handler) {
1125 if (cur->fault_handler(cur, regs, trapnr))
1130 NOKPROBE_SYMBOL(aggr_fault_handler);
1132 static int aggr_break_handler(struct kprobe *p, struct pt_regs *regs)
1134 struct kprobe *cur = __this_cpu_read(kprobe_instance);
1137 if (cur && cur->break_handler) {
1138 if (cur->break_handler(cur, regs))
1141 reset_kprobe_instance();
1144 NOKPROBE_SYMBOL(aggr_break_handler);
1146 /* Walks the list and increments nmissed count for multiprobe case */
1147 void kprobes_inc_nmissed_count(struct kprobe *p)
1150 if (!kprobe_aggrprobe(p)) {
1153 list_for_each_entry_rcu(kp, &p->list, list)
1158 NOKPROBE_SYMBOL(kprobes_inc_nmissed_count);
1160 void recycle_rp_inst(struct kretprobe_instance *ri,
1161 struct hlist_head *head)
1163 struct kretprobe *rp = ri->rp;
1165 /* remove rp inst off the rprobe_inst_table */
1166 hlist_del(&ri->hlist);
1167 INIT_HLIST_NODE(&ri->hlist);
1169 raw_spin_lock(&rp->lock);
1170 hlist_add_head(&ri->hlist, &rp->free_instances);
1171 raw_spin_unlock(&rp->lock);
1174 hlist_add_head(&ri->hlist, head);
1176 NOKPROBE_SYMBOL(recycle_rp_inst);
1178 void kretprobe_hash_lock(struct task_struct *tsk,
1179 struct hlist_head **head, unsigned long *flags)
1180 __acquires(hlist_lock)
1182 unsigned long hash = hash_ptr(tsk, KPROBE_HASH_BITS);
1183 raw_spinlock_t *hlist_lock;
1185 *head = &kretprobe_inst_table[hash];
1186 hlist_lock = kretprobe_table_lock_ptr(hash);
1187 raw_spin_lock_irqsave(hlist_lock, *flags);
1189 NOKPROBE_SYMBOL(kretprobe_hash_lock);
1191 static void kretprobe_table_lock(unsigned long hash,
1192 unsigned long *flags)
1193 __acquires(hlist_lock)
1195 raw_spinlock_t *hlist_lock = kretprobe_table_lock_ptr(hash);
1196 raw_spin_lock_irqsave(hlist_lock, *flags);
1198 NOKPROBE_SYMBOL(kretprobe_table_lock);
1200 void kretprobe_hash_unlock(struct task_struct *tsk,
1201 unsigned long *flags)
1202 __releases(hlist_lock)
1204 unsigned long hash = hash_ptr(tsk, KPROBE_HASH_BITS);
1205 raw_spinlock_t *hlist_lock;
1207 hlist_lock = kretprobe_table_lock_ptr(hash);
1208 raw_spin_unlock_irqrestore(hlist_lock, *flags);
1210 NOKPROBE_SYMBOL(kretprobe_hash_unlock);
1212 static void kretprobe_table_unlock(unsigned long hash,
1213 unsigned long *flags)
1214 __releases(hlist_lock)
1216 raw_spinlock_t *hlist_lock = kretprobe_table_lock_ptr(hash);
1217 raw_spin_unlock_irqrestore(hlist_lock, *flags);
1219 NOKPROBE_SYMBOL(kretprobe_table_unlock);
1221 struct kprobe kprobe_busy = {
1222 .addr = (void *) get_kprobe,
1225 void kprobe_busy_begin(void)
1227 struct kprobe_ctlblk *kcb;
1230 __this_cpu_write(current_kprobe, &kprobe_busy);
1231 kcb = get_kprobe_ctlblk();
1232 kcb->kprobe_status = KPROBE_HIT_ACTIVE;
1235 void kprobe_busy_end(void)
1237 __this_cpu_write(current_kprobe, NULL);
1242 * This function is called from finish_task_switch when task tk becomes dead,
1243 * so that we can recycle any function-return probe instances associated
1244 * with this task. These left over instances represent probed functions
1245 * that have been called but will never return.
1247 void kprobe_flush_task(struct task_struct *tk)
1249 struct kretprobe_instance *ri;
1250 struct hlist_head *head, empty_rp;
1251 struct hlist_node *tmp;
1252 unsigned long hash, flags = 0;
1254 if (unlikely(!kprobes_initialized))
1255 /* Early boot. kretprobe_table_locks not yet initialized. */
1258 kprobe_busy_begin();
1260 INIT_HLIST_HEAD(&empty_rp);
1261 hash = hash_ptr(tk, KPROBE_HASH_BITS);
1262 head = &kretprobe_inst_table[hash];
1263 kretprobe_table_lock(hash, &flags);
1264 hlist_for_each_entry_safe(ri, tmp, head, hlist) {
1266 recycle_rp_inst(ri, &empty_rp);
1268 kretprobe_table_unlock(hash, &flags);
1269 hlist_for_each_entry_safe(ri, tmp, &empty_rp, hlist) {
1270 hlist_del(&ri->hlist);
1276 NOKPROBE_SYMBOL(kprobe_flush_task);
1278 static inline void free_rp_inst(struct kretprobe *rp)
1280 struct kretprobe_instance *ri;
1281 struct hlist_node *next;
1283 hlist_for_each_entry_safe(ri, next, &rp->free_instances, hlist) {
1284 hlist_del(&ri->hlist);
1289 static void cleanup_rp_inst(struct kretprobe *rp)
1291 unsigned long flags, hash;
1292 struct kretprobe_instance *ri;
1293 struct hlist_node *next;
1294 struct hlist_head *head;
1297 for (hash = 0; hash < KPROBE_TABLE_SIZE; hash++) {
1298 kretprobe_table_lock(hash, &flags);
1299 head = &kretprobe_inst_table[hash];
1300 hlist_for_each_entry_safe(ri, next, head, hlist) {
1304 kretprobe_table_unlock(hash, &flags);
1308 NOKPROBE_SYMBOL(cleanup_rp_inst);
1311 * Add the new probe to ap->list. Fail if this is the
1312 * second jprobe at the address - two jprobes can't coexist
1314 static int add_new_kprobe(struct kprobe *ap, struct kprobe *p)
1316 BUG_ON(kprobe_gone(ap) || kprobe_gone(p));
1318 if (p->break_handler || p->post_handler)
1319 unoptimize_kprobe(ap, true); /* Fall back to normal kprobe */
1321 if (p->break_handler) {
1322 if (ap->break_handler)
1324 list_add_tail_rcu(&p->list, &ap->list);
1325 ap->break_handler = aggr_break_handler;
1327 list_add_rcu(&p->list, &ap->list);
1328 if (p->post_handler && !ap->post_handler)
1329 ap->post_handler = aggr_post_handler;
1335 * Fill in the required fields of the "manager kprobe". Replace the
1336 * earlier kprobe in the hlist with the manager kprobe
1338 static void init_aggr_kprobe(struct kprobe *ap, struct kprobe *p)
1340 /* Copy p's insn slot to ap */
1342 flush_insn_slot(ap);
1344 ap->flags = p->flags & ~KPROBE_FLAG_OPTIMIZED;
1345 ap->pre_handler = aggr_pre_handler;
1346 ap->fault_handler = aggr_fault_handler;
1347 /* We don't care the kprobe which has gone. */
1348 if (p->post_handler && !kprobe_gone(p))
1349 ap->post_handler = aggr_post_handler;
1350 if (p->break_handler && !kprobe_gone(p))
1351 ap->break_handler = aggr_break_handler;
1353 INIT_LIST_HEAD(&ap->list);
1354 INIT_HLIST_NODE(&ap->hlist);
1356 list_add_rcu(&p->list, &ap->list);
1357 hlist_replace_rcu(&p->hlist, &ap->hlist);
1361 * This is the second or subsequent kprobe at the address - handle
1364 static int register_aggr_kprobe(struct kprobe *orig_p, struct kprobe *p)
1367 struct kprobe *ap = orig_p;
1371 /* For preparing optimization, jump_label_text_reserved() is called */
1373 mutex_lock(&text_mutex);
1375 if (!kprobe_aggrprobe(orig_p)) {
1376 /* If orig_p is not an aggr_kprobe, create new aggr_kprobe. */
1377 ap = alloc_aggr_kprobe(orig_p);
1382 init_aggr_kprobe(ap, orig_p);
1383 } else if (kprobe_unused(ap)) {
1384 /* This probe is going to die. Rescue it */
1385 ret = reuse_unused_kprobe(ap);
1390 if (kprobe_gone(ap)) {
1392 * Attempting to insert new probe at the same location that
1393 * had a probe in the module vaddr area which already
1394 * freed. So, the instruction slot has already been
1395 * released. We need a new slot for the new probe.
1397 ret = arch_prepare_kprobe(ap);
1400 * Even if fail to allocate new slot, don't need to
1401 * free aggr_probe. It will be used next time, or
1402 * freed by unregister_kprobe.
1406 /* Prepare optimized instructions if possible. */
1407 prepare_optimized_kprobe(ap);
1410 * Clear gone flag to prevent allocating new slot again, and
1411 * set disabled flag because it is not armed yet.
1413 ap->flags = (ap->flags & ~KPROBE_FLAG_GONE)
1414 | KPROBE_FLAG_DISABLED;
1417 /* Copy ap's insn slot to p */
1419 ret = add_new_kprobe(ap, p);
1422 mutex_unlock(&text_mutex);
1423 jump_label_unlock();
1426 if (ret == 0 && kprobe_disabled(ap) && !kprobe_disabled(p)) {
1427 ap->flags &= ~KPROBE_FLAG_DISABLED;
1428 if (!kprobes_all_disarmed)
1429 /* Arm the breakpoint again. */
1435 bool __weak arch_within_kprobe_blacklist(unsigned long addr)
1437 /* The __kprobes marked functions and entry code must not be probed */
1438 return addr >= (unsigned long)__kprobes_text_start &&
1439 addr < (unsigned long)__kprobes_text_end;
1442 bool within_kprobe_blacklist(unsigned long addr)
1444 struct kprobe_blacklist_entry *ent;
1446 if (arch_within_kprobe_blacklist(addr))
1449 * If there exists a kprobe_blacklist, verify and
1450 * fail any probe registration in the prohibited area
1452 list_for_each_entry(ent, &kprobe_blacklist, list) {
1453 if (addr >= ent->start_addr && addr < ent->end_addr)
1461 * If we have a symbol_name argument, look it up and add the offset field
1462 * to it. This way, we can specify a relative address to a symbol.
1463 * This returns encoded errors if it fails to look up symbol or invalid
1464 * combination of parameters.
1466 static kprobe_opcode_t *_kprobe_addr(kprobe_opcode_t *addr,
1467 const char *symbol_name, unsigned int offset)
1469 if ((symbol_name && addr) || (!symbol_name && !addr))
1473 addr = kprobe_lookup_name(symbol_name, offset);
1475 return ERR_PTR(-ENOENT);
1478 addr = (kprobe_opcode_t *)(((char *)addr) + offset);
1483 return ERR_PTR(-EINVAL);
1486 static kprobe_opcode_t *kprobe_addr(struct kprobe *p)
1488 return _kprobe_addr(p->addr, p->symbol_name, p->offset);
1491 /* Check passed kprobe is valid and return kprobe in kprobe_table. */
1492 static struct kprobe *__get_valid_kprobe(struct kprobe *p)
1494 struct kprobe *ap, *list_p;
1496 ap = get_kprobe(p->addr);
1501 list_for_each_entry_rcu(list_p, &ap->list, list)
1503 /* kprobe p is a valid probe */
1511 /* Return error if the kprobe is being re-registered */
1512 static inline int check_kprobe_rereg(struct kprobe *p)
1516 mutex_lock(&kprobe_mutex);
1517 if (__get_valid_kprobe(p))
1519 mutex_unlock(&kprobe_mutex);
1524 int __weak arch_check_ftrace_location(struct kprobe *p)
1526 unsigned long ftrace_addr;
1528 ftrace_addr = ftrace_location((unsigned long)p->addr);
1530 #ifdef CONFIG_KPROBES_ON_FTRACE
1531 /* Given address is not on the instruction boundary */
1532 if ((unsigned long)p->addr != ftrace_addr)
1534 p->flags |= KPROBE_FLAG_FTRACE;
1535 #else /* !CONFIG_KPROBES_ON_FTRACE */
1542 static int check_kprobe_address_safe(struct kprobe *p,
1543 struct module **probed_mod)
1547 ret = arch_check_ftrace_location(p);
1553 /* Ensure it is not in reserved area nor out of text */
1554 if (!(core_kernel_text((unsigned long) p->addr) ||
1555 is_module_text_address((unsigned long) p->addr)) ||
1556 in_gate_area_no_mm((unsigned long) p->addr) ||
1557 within_kprobe_blacklist((unsigned long) p->addr) ||
1558 jump_label_text_reserved(p->addr, p->addr) ||
1559 find_bug((unsigned long)p->addr)) {
1564 /* Check if are we probing a module */
1565 *probed_mod = __module_text_address((unsigned long) p->addr);
1568 * We must hold a refcount of the probed module while updating
1569 * its code to prohibit unexpected unloading.
1571 if (unlikely(!try_module_get(*probed_mod))) {
1577 * If the module freed .init.text, we couldn't insert
1580 if (within_module_init((unsigned long)p->addr, *probed_mod) &&
1581 (*probed_mod)->state != MODULE_STATE_COMING) {
1582 module_put(*probed_mod);
1589 jump_label_unlock();
1594 int register_kprobe(struct kprobe *p)
1597 struct kprobe *old_p;
1598 struct module *probed_mod;
1599 kprobe_opcode_t *addr;
1601 /* Adjust probe address from symbol */
1602 addr = kprobe_addr(p);
1604 return PTR_ERR(addr);
1607 ret = check_kprobe_rereg(p);
1611 /* User can pass only KPROBE_FLAG_DISABLED to register_kprobe */
1612 p->flags &= KPROBE_FLAG_DISABLED;
1614 INIT_LIST_HEAD(&p->list);
1616 ret = check_kprobe_address_safe(p, &probed_mod);
1620 mutex_lock(&kprobe_mutex);
1622 old_p = get_kprobe(p->addr);
1624 /* Since this may unoptimize old_p, locking text_mutex. */
1625 ret = register_aggr_kprobe(old_p, p);
1630 /* Prevent text modification */
1631 mutex_lock(&text_mutex);
1632 ret = prepare_kprobe(p);
1633 mutex_unlock(&text_mutex);
1638 INIT_HLIST_NODE(&p->hlist);
1639 hlist_add_head_rcu(&p->hlist,
1640 &kprobe_table[hash_ptr(p->addr, KPROBE_HASH_BITS)]);
1642 if (!kprobes_all_disarmed && !kprobe_disabled(p))
1645 /* Try to optimize kprobe */
1646 try_to_optimize_kprobe(p);
1648 mutex_unlock(&kprobe_mutex);
1651 module_put(probed_mod);
1655 EXPORT_SYMBOL_GPL(register_kprobe);
1657 /* Check if all probes on the aggrprobe are disabled */
1658 static int aggr_kprobe_disabled(struct kprobe *ap)
1662 list_for_each_entry_rcu(kp, &ap->list, list)
1663 if (!kprobe_disabled(kp))
1665 * There is an active probe on the list.
1666 * We can't disable this ap.
1673 /* Disable one kprobe: Make sure called under kprobe_mutex is locked */
1674 static struct kprobe *__disable_kprobe(struct kprobe *p)
1676 struct kprobe *orig_p;
1678 /* Get an original kprobe for return */
1679 orig_p = __get_valid_kprobe(p);
1680 if (unlikely(orig_p == NULL))
1683 if (!kprobe_disabled(p)) {
1684 /* Disable probe if it is a child probe */
1686 p->flags |= KPROBE_FLAG_DISABLED;
1688 /* Try to disarm and disable this/parent probe */
1689 if (p == orig_p || aggr_kprobe_disabled(orig_p)) {
1691 * Don't be lazy here. Even if 'kprobes_all_disarmed'
1692 * is false, 'orig_p' might not have been armed yet.
1693 * Note arm_all_kprobes() __tries__ to arm all kprobes
1694 * on the best effort basis.
1696 if (!kprobes_all_disarmed && !kprobe_disabled(orig_p))
1697 disarm_kprobe(orig_p, true);
1699 orig_p->flags |= KPROBE_FLAG_DISABLED;
1707 * Unregister a kprobe without a scheduler synchronization.
1709 static int __unregister_kprobe_top(struct kprobe *p)
1711 struct kprobe *ap, *list_p;
1713 /* Disable kprobe. This will disarm it if needed. */
1714 ap = __disable_kprobe(p);
1720 * This probe is an independent(and non-optimized) kprobe
1721 * (not an aggrprobe). Remove from the hash list.
1725 /* Following process expects this probe is an aggrprobe */
1726 WARN_ON(!kprobe_aggrprobe(ap));
1728 if (list_is_singular(&ap->list) && kprobe_disarmed(ap))
1730 * !disarmed could be happen if the probe is under delayed
1735 /* If disabling probe has special handlers, update aggrprobe */
1736 if (p->break_handler && !kprobe_gone(p))
1737 ap->break_handler = NULL;
1738 if (p->post_handler && !kprobe_gone(p)) {
1739 list_for_each_entry_rcu(list_p, &ap->list, list) {
1740 if ((list_p != p) && (list_p->post_handler))
1743 ap->post_handler = NULL;
1747 * Remove from the aggrprobe: this path will do nothing in
1748 * __unregister_kprobe_bottom().
1750 list_del_rcu(&p->list);
1751 if (!kprobe_disabled(ap) && !kprobes_all_disarmed)
1753 * Try to optimize this probe again, because post
1754 * handler may have been changed.
1756 optimize_kprobe(ap);
1761 BUG_ON(!kprobe_disarmed(ap));
1762 hlist_del_rcu(&ap->hlist);
1766 static void __unregister_kprobe_bottom(struct kprobe *p)
1770 if (list_empty(&p->list))
1771 /* This is an independent kprobe */
1772 arch_remove_kprobe(p);
1773 else if (list_is_singular(&p->list)) {
1774 /* This is the last child of an aggrprobe */
1775 ap = list_entry(p->list.next, struct kprobe, list);
1777 free_aggr_kprobe(ap);
1779 /* Otherwise, do nothing. */
1782 int register_kprobes(struct kprobe **kps, int num)
1788 for (i = 0; i < num; i++) {
1789 ret = register_kprobe(kps[i]);
1792 unregister_kprobes(kps, i);
1798 EXPORT_SYMBOL_GPL(register_kprobes);
1800 void unregister_kprobe(struct kprobe *p)
1802 unregister_kprobes(&p, 1);
1804 EXPORT_SYMBOL_GPL(unregister_kprobe);
1806 void unregister_kprobes(struct kprobe **kps, int num)
1812 mutex_lock(&kprobe_mutex);
1813 for (i = 0; i < num; i++)
1814 if (__unregister_kprobe_top(kps[i]) < 0)
1815 kps[i]->addr = NULL;
1816 mutex_unlock(&kprobe_mutex);
1818 synchronize_sched();
1819 for (i = 0; i < num; i++)
1821 __unregister_kprobe_bottom(kps[i]);
1823 EXPORT_SYMBOL_GPL(unregister_kprobes);
1825 int __weak kprobe_exceptions_notify(struct notifier_block *self,
1826 unsigned long val, void *data)
1830 NOKPROBE_SYMBOL(kprobe_exceptions_notify);
1832 static struct notifier_block kprobe_exceptions_nb = {
1833 .notifier_call = kprobe_exceptions_notify,
1834 .priority = 0x7fffffff /* we need to be notified first */
1837 unsigned long __weak arch_deref_entry_point(void *entry)
1839 return (unsigned long)entry;
1842 int register_jprobes(struct jprobe **jps, int num)
1849 for (i = 0; i < num; i++) {
1850 ret = register_jprobe(jps[i]);
1854 unregister_jprobes(jps, i);
1861 EXPORT_SYMBOL_GPL(register_jprobes);
1863 int register_jprobe(struct jprobe *jp)
1865 unsigned long addr, offset;
1866 struct kprobe *kp = &jp->kp;
1869 * Verify probepoint as well as the jprobe handler are
1870 * valid function entry points.
1872 addr = arch_deref_entry_point(jp->entry);
1874 if (kallsyms_lookup_size_offset(addr, NULL, &offset) && offset == 0 &&
1875 kprobe_on_func_entry(kp->addr, kp->symbol_name, kp->offset)) {
1876 kp->pre_handler = setjmp_pre_handler;
1877 kp->break_handler = longjmp_break_handler;
1878 return register_kprobe(kp);
1883 EXPORT_SYMBOL_GPL(register_jprobe);
1885 void unregister_jprobe(struct jprobe *jp)
1887 unregister_jprobes(&jp, 1);
1889 EXPORT_SYMBOL_GPL(unregister_jprobe);
1891 void unregister_jprobes(struct jprobe **jps, int num)
1897 mutex_lock(&kprobe_mutex);
1898 for (i = 0; i < num; i++)
1899 if (__unregister_kprobe_top(&jps[i]->kp) < 0)
1900 jps[i]->kp.addr = NULL;
1901 mutex_unlock(&kprobe_mutex);
1903 synchronize_sched();
1904 for (i = 0; i < num; i++) {
1905 if (jps[i]->kp.addr)
1906 __unregister_kprobe_bottom(&jps[i]->kp);
1909 EXPORT_SYMBOL_GPL(unregister_jprobes);
1911 #ifdef CONFIG_KRETPROBES
1913 * This kprobe pre_handler is registered with every kretprobe. When probe
1914 * hits it will set up the return probe.
1916 static int pre_handler_kretprobe(struct kprobe *p, struct pt_regs *regs)
1918 struct kretprobe *rp = container_of(p, struct kretprobe, kp);
1919 unsigned long hash, flags = 0;
1920 struct kretprobe_instance *ri;
1923 * To avoid deadlocks, prohibit return probing in NMI contexts,
1924 * just skip the probe and increase the (inexact) 'nmissed'
1925 * statistical counter, so that the user is informed that
1926 * something happened:
1928 if (unlikely(in_nmi())) {
1933 /* TODO: consider to only swap the RA after the last pre_handler fired */
1934 hash = hash_ptr(current, KPROBE_HASH_BITS);
1935 raw_spin_lock_irqsave(&rp->lock, flags);
1936 if (!hlist_empty(&rp->free_instances)) {
1937 ri = hlist_entry(rp->free_instances.first,
1938 struct kretprobe_instance, hlist);
1939 hlist_del(&ri->hlist);
1940 raw_spin_unlock_irqrestore(&rp->lock, flags);
1945 if (rp->entry_handler && rp->entry_handler(ri, regs)) {
1946 raw_spin_lock_irqsave(&rp->lock, flags);
1947 hlist_add_head(&ri->hlist, &rp->free_instances);
1948 raw_spin_unlock_irqrestore(&rp->lock, flags);
1952 arch_prepare_kretprobe(ri, regs);
1954 /* XXX(hch): why is there no hlist_move_head? */
1955 INIT_HLIST_NODE(&ri->hlist);
1956 kretprobe_table_lock(hash, &flags);
1957 hlist_add_head(&ri->hlist, &kretprobe_inst_table[hash]);
1958 kretprobe_table_unlock(hash, &flags);
1961 raw_spin_unlock_irqrestore(&rp->lock, flags);
1965 NOKPROBE_SYMBOL(pre_handler_kretprobe);
1967 bool __weak arch_kprobe_on_func_entry(unsigned long offset)
1972 bool kprobe_on_func_entry(kprobe_opcode_t *addr, const char *sym, unsigned long offset)
1974 kprobe_opcode_t *kp_addr = _kprobe_addr(addr, sym, offset);
1976 if (IS_ERR(kp_addr))
1979 if (!kallsyms_lookup_size_offset((unsigned long)kp_addr, NULL, &offset) ||
1980 !arch_kprobe_on_func_entry(offset))
1986 int register_kretprobe(struct kretprobe *rp)
1989 struct kretprobe_instance *inst;
1993 if (!kprobe_on_func_entry(rp->kp.addr, rp->kp.symbol_name, rp->kp.offset))
1996 /* If only rp->kp.addr is specified, check reregistering kprobes */
1997 if (rp->kp.addr && check_kprobe_rereg(&rp->kp))
2000 if (kretprobe_blacklist_size) {
2001 addr = kprobe_addr(&rp->kp);
2003 return PTR_ERR(addr);
2005 for (i = 0; kretprobe_blacklist[i].name != NULL; i++) {
2006 if (kretprobe_blacklist[i].addr == addr)
2011 if (rp->data_size > KRETPROBE_MAX_DATA_SIZE)
2014 rp->kp.pre_handler = pre_handler_kretprobe;
2015 rp->kp.post_handler = NULL;
2016 rp->kp.fault_handler = NULL;
2017 rp->kp.break_handler = NULL;
2019 /* Pre-allocate memory for max kretprobe instances */
2020 if (rp->maxactive <= 0) {
2021 #ifdef CONFIG_PREEMPT
2022 rp->maxactive = max_t(unsigned int, 10, 2*num_possible_cpus());
2024 rp->maxactive = num_possible_cpus();
2027 raw_spin_lock_init(&rp->lock);
2028 INIT_HLIST_HEAD(&rp->free_instances);
2029 for (i = 0; i < rp->maxactive; i++) {
2030 inst = kmalloc(sizeof(struct kretprobe_instance) +
2031 rp->data_size, GFP_KERNEL);
2036 INIT_HLIST_NODE(&inst->hlist);
2037 hlist_add_head(&inst->hlist, &rp->free_instances);
2041 /* Establish function entry probe point */
2042 ret = register_kprobe(&rp->kp);
2047 EXPORT_SYMBOL_GPL(register_kretprobe);
2049 int register_kretprobes(struct kretprobe **rps, int num)
2055 for (i = 0; i < num; i++) {
2056 ret = register_kretprobe(rps[i]);
2059 unregister_kretprobes(rps, i);
2065 EXPORT_SYMBOL_GPL(register_kretprobes);
2067 void unregister_kretprobe(struct kretprobe *rp)
2069 unregister_kretprobes(&rp, 1);
2071 EXPORT_SYMBOL_GPL(unregister_kretprobe);
2073 void unregister_kretprobes(struct kretprobe **rps, int num)
2079 mutex_lock(&kprobe_mutex);
2080 for (i = 0; i < num; i++)
2081 if (__unregister_kprobe_top(&rps[i]->kp) < 0)
2082 rps[i]->kp.addr = NULL;
2083 mutex_unlock(&kprobe_mutex);
2085 synchronize_sched();
2086 for (i = 0; i < num; i++) {
2087 if (rps[i]->kp.addr) {
2088 __unregister_kprobe_bottom(&rps[i]->kp);
2089 cleanup_rp_inst(rps[i]);
2093 EXPORT_SYMBOL_GPL(unregister_kretprobes);
2095 #else /* CONFIG_KRETPROBES */
2096 int register_kretprobe(struct kretprobe *rp)
2100 EXPORT_SYMBOL_GPL(register_kretprobe);
2102 int register_kretprobes(struct kretprobe **rps, int num)
2106 EXPORT_SYMBOL_GPL(register_kretprobes);
2108 void unregister_kretprobe(struct kretprobe *rp)
2111 EXPORT_SYMBOL_GPL(unregister_kretprobe);
2113 void unregister_kretprobes(struct kretprobe **rps, int num)
2116 EXPORT_SYMBOL_GPL(unregister_kretprobes);
2118 static int pre_handler_kretprobe(struct kprobe *p, struct pt_regs *regs)
2122 NOKPROBE_SYMBOL(pre_handler_kretprobe);
2124 #endif /* CONFIG_KRETPROBES */
2126 /* Set the kprobe gone and remove its instruction buffer. */
2127 static void kill_kprobe(struct kprobe *p)
2131 if (WARN_ON_ONCE(kprobe_gone(p)))
2134 p->flags |= KPROBE_FLAG_GONE;
2135 if (kprobe_aggrprobe(p)) {
2137 * If this is an aggr_kprobe, we have to list all the
2138 * chained probes and mark them GONE.
2140 list_for_each_entry_rcu(kp, &p->list, list)
2141 kp->flags |= KPROBE_FLAG_GONE;
2142 p->post_handler = NULL;
2143 p->break_handler = NULL;
2144 kill_optimized_kprobe(p);
2147 * Here, we can remove insn_slot safely, because no thread calls
2148 * the original probed function (which will be freed soon) any more.
2150 arch_remove_kprobe(p);
2153 * The module is going away. We should disarm the kprobe which
2154 * is using ftrace, because ftrace framework is still available at
2155 * MODULE_STATE_GOING notification.
2157 if (kprobe_ftrace(p) && !kprobe_disabled(p) && !kprobes_all_disarmed)
2158 disarm_kprobe_ftrace(p);
2161 /* Disable one kprobe */
2162 int disable_kprobe(struct kprobe *kp)
2166 mutex_lock(&kprobe_mutex);
2168 /* Disable this kprobe */
2169 if (__disable_kprobe(kp) == NULL)
2172 mutex_unlock(&kprobe_mutex);
2175 EXPORT_SYMBOL_GPL(disable_kprobe);
2177 /* Enable one kprobe */
2178 int enable_kprobe(struct kprobe *kp)
2183 mutex_lock(&kprobe_mutex);
2185 /* Check whether specified probe is valid. */
2186 p = __get_valid_kprobe(kp);
2187 if (unlikely(p == NULL)) {
2192 if (kprobe_gone(kp)) {
2193 /* This kprobe has gone, we couldn't enable it. */
2199 kp->flags &= ~KPROBE_FLAG_DISABLED;
2201 if (!kprobes_all_disarmed && kprobe_disabled(p)) {
2202 p->flags &= ~KPROBE_FLAG_DISABLED;
2206 mutex_unlock(&kprobe_mutex);
2209 EXPORT_SYMBOL_GPL(enable_kprobe);
2211 void dump_kprobe(struct kprobe *kp)
2213 printk(KERN_WARNING "Dumping kprobe:\n");
2214 printk(KERN_WARNING "Name: %s\nAddress: %p\nOffset: %x\n",
2215 kp->symbol_name, kp->addr, kp->offset);
2217 NOKPROBE_SYMBOL(dump_kprobe);
2220 * Lookup and populate the kprobe_blacklist.
2222 * Unlike the kretprobe blacklist, we'll need to determine
2223 * the range of addresses that belong to the said functions,
2224 * since a kprobe need not necessarily be at the beginning
2227 static int __init populate_kprobe_blacklist(unsigned long *start,
2230 unsigned long *iter;
2231 struct kprobe_blacklist_entry *ent;
2232 unsigned long entry, offset = 0, size = 0;
2234 for (iter = start; iter < end; iter++) {
2235 entry = arch_deref_entry_point((void *)*iter);
2237 if (!kernel_text_address(entry) ||
2238 !kallsyms_lookup_size_offset(entry, &size, &offset)) {
2239 pr_err("Failed to find blacklist at %p\n",
2244 ent = kmalloc(sizeof(*ent), GFP_KERNEL);
2247 ent->start_addr = entry;
2248 ent->end_addr = entry + size;
2249 INIT_LIST_HEAD(&ent->list);
2250 list_add_tail(&ent->list, &kprobe_blacklist);
2255 /* Module notifier call back, checking kprobes on the module */
2256 static int kprobes_module_callback(struct notifier_block *nb,
2257 unsigned long val, void *data)
2259 struct module *mod = data;
2260 struct hlist_head *head;
2263 int checkcore = (val == MODULE_STATE_GOING);
2265 if (val != MODULE_STATE_GOING && val != MODULE_STATE_LIVE)
2269 * When MODULE_STATE_GOING was notified, both of module .text and
2270 * .init.text sections would be freed. When MODULE_STATE_LIVE was
2271 * notified, only .init.text section would be freed. We need to
2272 * disable kprobes which have been inserted in the sections.
2274 mutex_lock(&kprobe_mutex);
2275 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
2276 head = &kprobe_table[i];
2277 hlist_for_each_entry_rcu(p, head, hlist) {
2281 if (within_module_init((unsigned long)p->addr, mod) ||
2283 within_module_core((unsigned long)p->addr, mod))) {
2285 * The vaddr this probe is installed will soon
2286 * be vfreed buy not synced to disk. Hence,
2287 * disarming the breakpoint isn't needed.
2289 * Note, this will also move any optimized probes
2290 * that are pending to be removed from their
2291 * corresponding lists to the freeing_list and
2292 * will not be touched by the delayed
2293 * kprobe_optimizer work handler.
2299 mutex_unlock(&kprobe_mutex);
2303 static struct notifier_block kprobe_module_nb = {
2304 .notifier_call = kprobes_module_callback,
2308 /* Markers of _kprobe_blacklist section */
2309 extern unsigned long __start_kprobe_blacklist[];
2310 extern unsigned long __stop_kprobe_blacklist[];
2312 static int __init init_kprobes(void)
2316 /* FIXME allocate the probe table, currently defined statically */
2317 /* initialize all list heads */
2318 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
2319 INIT_HLIST_HEAD(&kprobe_table[i]);
2320 INIT_HLIST_HEAD(&kretprobe_inst_table[i]);
2321 raw_spin_lock_init(&(kretprobe_table_locks[i].lock));
2324 err = populate_kprobe_blacklist(__start_kprobe_blacklist,
2325 __stop_kprobe_blacklist);
2327 pr_err("kprobes: failed to populate blacklist: %d\n", err);
2328 pr_err("Please take care of using kprobes.\n");
2331 if (kretprobe_blacklist_size) {
2332 /* lookup the function address from its name */
2333 for (i = 0; kretprobe_blacklist[i].name != NULL; i++) {
2334 kretprobe_blacklist[i].addr =
2335 kprobe_lookup_name(kretprobe_blacklist[i].name, 0);
2336 if (!kretprobe_blacklist[i].addr)
2337 printk("kretprobe: lookup failed: %s\n",
2338 kretprobe_blacklist[i].name);
2342 #if defined(CONFIG_OPTPROBES)
2343 #if defined(__ARCH_WANT_KPROBES_INSN_SLOT)
2344 /* Init kprobe_optinsn_slots */
2345 kprobe_optinsn_slots.insn_size = MAX_OPTINSN_SIZE;
2347 /* By default, kprobes can be optimized */
2348 kprobes_allow_optimization = true;
2351 /* By default, kprobes are armed */
2352 kprobes_all_disarmed = false;
2354 err = arch_init_kprobes();
2356 err = register_die_notifier(&kprobe_exceptions_nb);
2358 err = register_module_notifier(&kprobe_module_nb);
2360 kprobes_initialized = (err == 0);
2367 #ifdef CONFIG_DEBUG_FS
2368 static void report_probe(struct seq_file *pi, struct kprobe *p,
2369 const char *sym, int offset, char *modname, struct kprobe *pp)
2373 if (p->pre_handler == pre_handler_kretprobe)
2375 else if (p->pre_handler == setjmp_pre_handler)
2381 seq_printf(pi, "%p %s %s+0x%x %s ",
2382 p->addr, kprobe_type, sym, offset,
2383 (modname ? modname : " "));
2385 seq_printf(pi, "%p %s %p ",
2386 p->addr, kprobe_type, p->addr);
2390 seq_printf(pi, "%s%s%s%s\n",
2391 (kprobe_gone(p) ? "[GONE]" : ""),
2392 ((kprobe_disabled(p) && !kprobe_gone(p)) ? "[DISABLED]" : ""),
2393 (kprobe_optimized(pp) ? "[OPTIMIZED]" : ""),
2394 (kprobe_ftrace(pp) ? "[FTRACE]" : ""));
2397 static void *kprobe_seq_start(struct seq_file *f, loff_t *pos)
2399 return (*pos < KPROBE_TABLE_SIZE) ? pos : NULL;
2402 static void *kprobe_seq_next(struct seq_file *f, void *v, loff_t *pos)
2405 if (*pos >= KPROBE_TABLE_SIZE)
2410 static void kprobe_seq_stop(struct seq_file *f, void *v)
2415 static int show_kprobe_addr(struct seq_file *pi, void *v)
2417 struct hlist_head *head;
2418 struct kprobe *p, *kp;
2419 const char *sym = NULL;
2420 unsigned int i = *(loff_t *) v;
2421 unsigned long offset = 0;
2422 char *modname, namebuf[KSYM_NAME_LEN];
2424 head = &kprobe_table[i];
2426 hlist_for_each_entry_rcu(p, head, hlist) {
2427 sym = kallsyms_lookup((unsigned long)p->addr, NULL,
2428 &offset, &modname, namebuf);
2429 if (kprobe_aggrprobe(p)) {
2430 list_for_each_entry_rcu(kp, &p->list, list)
2431 report_probe(pi, kp, sym, offset, modname, p);
2433 report_probe(pi, p, sym, offset, modname, NULL);
2439 static const struct seq_operations kprobes_seq_ops = {
2440 .start = kprobe_seq_start,
2441 .next = kprobe_seq_next,
2442 .stop = kprobe_seq_stop,
2443 .show = show_kprobe_addr
2446 static int kprobes_open(struct inode *inode, struct file *filp)
2448 return seq_open(filp, &kprobes_seq_ops);
2451 static const struct file_operations debugfs_kprobes_operations = {
2452 .open = kprobes_open,
2454 .llseek = seq_lseek,
2455 .release = seq_release,
2458 /* kprobes/blacklist -- shows which functions can not be probed */
2459 static void *kprobe_blacklist_seq_start(struct seq_file *m, loff_t *pos)
2461 return seq_list_start(&kprobe_blacklist, *pos);
2464 static void *kprobe_blacklist_seq_next(struct seq_file *m, void *v, loff_t *pos)
2466 return seq_list_next(v, &kprobe_blacklist, pos);
2469 static int kprobe_blacklist_seq_show(struct seq_file *m, void *v)
2471 struct kprobe_blacklist_entry *ent =
2472 list_entry(v, struct kprobe_blacklist_entry, list);
2474 seq_printf(m, "0x%p-0x%p\t%ps\n", (void *)ent->start_addr,
2475 (void *)ent->end_addr, (void *)ent->start_addr);
2479 static const struct seq_operations kprobe_blacklist_seq_ops = {
2480 .start = kprobe_blacklist_seq_start,
2481 .next = kprobe_blacklist_seq_next,
2482 .stop = kprobe_seq_stop, /* Reuse void function */
2483 .show = kprobe_blacklist_seq_show,
2486 static int kprobe_blacklist_open(struct inode *inode, struct file *filp)
2488 return seq_open(filp, &kprobe_blacklist_seq_ops);
2491 static const struct file_operations debugfs_kprobe_blacklist_ops = {
2492 .open = kprobe_blacklist_open,
2494 .llseek = seq_lseek,
2495 .release = seq_release,
2498 static void arm_all_kprobes(void)
2500 struct hlist_head *head;
2504 mutex_lock(&kprobe_mutex);
2506 /* If kprobes are armed, just return */
2507 if (!kprobes_all_disarmed)
2508 goto already_enabled;
2511 * optimize_kprobe() called by arm_kprobe() checks
2512 * kprobes_all_disarmed, so set kprobes_all_disarmed before
2515 kprobes_all_disarmed = false;
2516 /* Arming kprobes doesn't optimize kprobe itself */
2517 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
2518 head = &kprobe_table[i];
2519 hlist_for_each_entry_rcu(p, head, hlist)
2520 if (!kprobe_disabled(p))
2524 printk(KERN_INFO "Kprobes globally enabled\n");
2527 mutex_unlock(&kprobe_mutex);
2531 static void disarm_all_kprobes(void)
2533 struct hlist_head *head;
2537 mutex_lock(&kprobe_mutex);
2539 /* If kprobes are already disarmed, just return */
2540 if (kprobes_all_disarmed) {
2541 mutex_unlock(&kprobe_mutex);
2545 kprobes_all_disarmed = true;
2546 printk(KERN_INFO "Kprobes globally disabled\n");
2548 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
2549 head = &kprobe_table[i];
2550 hlist_for_each_entry_rcu(p, head, hlist) {
2551 if (!arch_trampoline_kprobe(p) && !kprobe_disabled(p))
2552 disarm_kprobe(p, false);
2555 mutex_unlock(&kprobe_mutex);
2557 /* Wait for disarming all kprobes by optimizer */
2558 wait_for_kprobe_optimizer();
2562 * XXX: The debugfs bool file interface doesn't allow for callbacks
2563 * when the bool state is switched. We can reuse that facility when
2566 static ssize_t read_enabled_file_bool(struct file *file,
2567 char __user *user_buf, size_t count, loff_t *ppos)
2571 if (!kprobes_all_disarmed)
2577 return simple_read_from_buffer(user_buf, count, ppos, buf, 2);
2580 static ssize_t write_enabled_file_bool(struct file *file,
2581 const char __user *user_buf, size_t count, loff_t *ppos)
2586 buf_size = min(count, (sizeof(buf)-1));
2587 if (copy_from_user(buf, user_buf, buf_size))
2590 buf[buf_size] = '\0';
2600 disarm_all_kprobes();
2609 static const struct file_operations fops_kp = {
2610 .read = read_enabled_file_bool,
2611 .write = write_enabled_file_bool,
2612 .llseek = default_llseek,
2615 static int __init debugfs_kprobe_init(void)
2617 struct dentry *dir, *file;
2618 unsigned int value = 1;
2620 dir = debugfs_create_dir("kprobes", NULL);
2624 file = debugfs_create_file("list", 0400, dir, NULL,
2625 &debugfs_kprobes_operations);
2629 file = debugfs_create_file("enabled", 0600, dir,
2634 file = debugfs_create_file("blacklist", 0400, dir, NULL,
2635 &debugfs_kprobe_blacklist_ops);
2642 debugfs_remove(dir);
2646 late_initcall(debugfs_kprobe_init);
2647 #endif /* CONFIG_DEBUG_FS */
2649 module_init(init_kprobes);
2651 /* defined in arch/.../kernel/kprobes.c */
2652 EXPORT_SYMBOL_GPL(jprobe_return);