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-generic/sections.h>
53 #include <asm/cacheflush.h>
54 #include <asm/errno.h>
55 #include <asm/uaccess.h>
57 #define KPROBE_HASH_BITS 6
58 #define KPROBE_TABLE_SIZE (1 << KPROBE_HASH_BITS)
62 * Some oddball architectures like 64bit powerpc have function descriptors
63 * so this must be overridable.
65 #ifndef kprobe_lookup_name
66 #define kprobe_lookup_name(name, addr) \
67 addr = ((kprobe_opcode_t *)(kallsyms_lookup_name(name)))
70 static int kprobes_initialized
;
71 static struct hlist_head kprobe_table
[KPROBE_TABLE_SIZE
];
72 static struct hlist_head kretprobe_inst_table
[KPROBE_TABLE_SIZE
];
74 /* NOTE: change this value only with kprobe_mutex held */
75 static bool kprobes_all_disarmed
;
77 /* This protects kprobe_table and optimizing_list */
78 static DEFINE_MUTEX(kprobe_mutex
);
79 static DEFINE_PER_CPU(struct kprobe
*, kprobe_instance
) = NULL
;
81 raw_spinlock_t lock ____cacheline_aligned_in_smp
;
82 } kretprobe_table_locks
[KPROBE_TABLE_SIZE
];
84 static raw_spinlock_t
*kretprobe_table_lock_ptr(unsigned long hash
)
86 return &(kretprobe_table_locks
[hash
].lock
);
90 * Normally, functions that we'd want to prohibit kprobes in, are marked
91 * __kprobes. But, there are cases where such functions already belong to
92 * a different section (__sched for preempt_schedule)
94 * For such cases, we now have a blacklist
96 static struct kprobe_blackpoint kprobe_blacklist
[] = {
97 {"preempt_schedule",},
98 {"native_get_debugreg",},
99 {"irq_entries_start",},
100 {"common_interrupt",},
101 {"mcount",}, /* mcount can be called from everywhere */
102 {NULL
} /* Terminator */
105 #ifdef __ARCH_WANT_KPROBES_INSN_SLOT
107 * kprobe->ainsn.insn points to the copy of the instruction to be
108 * single-stepped. x86_64, POWER4 and above have no-exec support and
109 * stepping on the instruction on a vmalloced/kmalloced/data page
110 * is a recipe for disaster
112 struct kprobe_insn_page
{
113 struct list_head list
;
114 kprobe_opcode_t
*insns
; /* Page of instruction slots */
120 #define KPROBE_INSN_PAGE_SIZE(slots) \
121 (offsetof(struct kprobe_insn_page, slot_used) + \
122 (sizeof(char) * (slots)))
124 struct kprobe_insn_cache
{
125 struct list_head pages
; /* list of kprobe_insn_page */
126 size_t insn_size
; /* size of instruction slot */
130 static int slots_per_page(struct kprobe_insn_cache
*c
)
132 return PAGE_SIZE
/(c
->insn_size
* sizeof(kprobe_opcode_t
));
135 enum kprobe_slot_state
{
141 static DEFINE_MUTEX(kprobe_insn_mutex
); /* Protects kprobe_insn_slots */
142 static struct kprobe_insn_cache kprobe_insn_slots
= {
143 .pages
= LIST_HEAD_INIT(kprobe_insn_slots
.pages
),
144 .insn_size
= MAX_INSN_SIZE
,
147 static int __kprobes
collect_garbage_slots(struct kprobe_insn_cache
*c
);
150 * __get_insn_slot() - Find a slot on an executable page for an instruction.
151 * We allocate an executable page if there's no room on existing ones.
153 static kprobe_opcode_t __kprobes
*__get_insn_slot(struct kprobe_insn_cache
*c
)
155 struct kprobe_insn_page
*kip
;
158 list_for_each_entry(kip
, &c
->pages
, list
) {
159 if (kip
->nused
< slots_per_page(c
)) {
161 for (i
= 0; i
< slots_per_page(c
); i
++) {
162 if (kip
->slot_used
[i
] == SLOT_CLEAN
) {
163 kip
->slot_used
[i
] = SLOT_USED
;
165 return kip
->insns
+ (i
* c
->insn_size
);
168 /* kip->nused is broken. Fix it. */
169 kip
->nused
= slots_per_page(c
);
174 /* If there are any garbage slots, collect it and try again. */
175 if (c
->nr_garbage
&& collect_garbage_slots(c
) == 0)
178 /* All out of space. Need to allocate a new page. */
179 kip
= kmalloc(KPROBE_INSN_PAGE_SIZE(slots_per_page(c
)), GFP_KERNEL
);
184 * Use module_alloc so this page is within +/- 2GB of where the
185 * kernel image and loaded module images reside. This is required
186 * so x86_64 can correctly handle the %rip-relative fixups.
188 kip
->insns
= module_alloc(PAGE_SIZE
);
193 INIT_LIST_HEAD(&kip
->list
);
194 memset(kip
->slot_used
, SLOT_CLEAN
, slots_per_page(c
));
195 kip
->slot_used
[0] = SLOT_USED
;
198 list_add(&kip
->list
, &c
->pages
);
203 kprobe_opcode_t __kprobes
*get_insn_slot(void)
205 kprobe_opcode_t
*ret
= NULL
;
207 mutex_lock(&kprobe_insn_mutex
);
208 ret
= __get_insn_slot(&kprobe_insn_slots
);
209 mutex_unlock(&kprobe_insn_mutex
);
214 /* Return 1 if all garbages are collected, otherwise 0. */
215 static int __kprobes
collect_one_slot(struct kprobe_insn_page
*kip
, int idx
)
217 kip
->slot_used
[idx
] = SLOT_CLEAN
;
219 if (kip
->nused
== 0) {
221 * Page is no longer in use. Free it unless
222 * it's the last one. We keep the last one
223 * so as not to have to set it up again the
224 * next time somebody inserts a probe.
226 if (!list_is_singular(&kip
->list
)) {
227 list_del(&kip
->list
);
228 module_free(NULL
, kip
->insns
);
236 static int __kprobes
collect_garbage_slots(struct kprobe_insn_cache
*c
)
238 struct kprobe_insn_page
*kip
, *next
;
240 /* Ensure no-one is interrupted on the garbages */
243 list_for_each_entry_safe(kip
, next
, &c
->pages
, list
) {
245 if (kip
->ngarbage
== 0)
247 kip
->ngarbage
= 0; /* we will collect all garbages */
248 for (i
= 0; i
< slots_per_page(c
); i
++) {
249 if (kip
->slot_used
[i
] == SLOT_DIRTY
&&
250 collect_one_slot(kip
, i
))
258 static void __kprobes
__free_insn_slot(struct kprobe_insn_cache
*c
,
259 kprobe_opcode_t
*slot
, int dirty
)
261 struct kprobe_insn_page
*kip
;
263 list_for_each_entry(kip
, &c
->pages
, list
) {
264 long idx
= ((long)slot
- (long)kip
->insns
) /
265 (c
->insn_size
* sizeof(kprobe_opcode_t
));
266 if (idx
>= 0 && idx
< slots_per_page(c
)) {
267 WARN_ON(kip
->slot_used
[idx
] != SLOT_USED
);
269 kip
->slot_used
[idx
] = SLOT_DIRTY
;
271 if (++c
->nr_garbage
> slots_per_page(c
))
272 collect_garbage_slots(c
);
274 collect_one_slot(kip
, idx
);
278 /* Could not free this slot. */
282 void __kprobes
free_insn_slot(kprobe_opcode_t
* slot
, int dirty
)
284 mutex_lock(&kprobe_insn_mutex
);
285 __free_insn_slot(&kprobe_insn_slots
, slot
, dirty
);
286 mutex_unlock(&kprobe_insn_mutex
);
288 #ifdef CONFIG_OPTPROBES
289 /* For optimized_kprobe buffer */
290 static DEFINE_MUTEX(kprobe_optinsn_mutex
); /* Protects kprobe_optinsn_slots */
291 static struct kprobe_insn_cache kprobe_optinsn_slots
= {
292 .pages
= LIST_HEAD_INIT(kprobe_optinsn_slots
.pages
),
293 /* .insn_size is initialized later */
296 /* Get a slot for optimized_kprobe buffer */
297 kprobe_opcode_t __kprobes
*get_optinsn_slot(void)
299 kprobe_opcode_t
*ret
= NULL
;
301 mutex_lock(&kprobe_optinsn_mutex
);
302 ret
= __get_insn_slot(&kprobe_optinsn_slots
);
303 mutex_unlock(&kprobe_optinsn_mutex
);
308 void __kprobes
free_optinsn_slot(kprobe_opcode_t
* slot
, int dirty
)
310 mutex_lock(&kprobe_optinsn_mutex
);
311 __free_insn_slot(&kprobe_optinsn_slots
, slot
, dirty
);
312 mutex_unlock(&kprobe_optinsn_mutex
);
317 /* We have preemption disabled.. so it is safe to use __ versions */
318 static inline void set_kprobe_instance(struct kprobe
*kp
)
320 __this_cpu_write(kprobe_instance
, kp
);
323 static inline void reset_kprobe_instance(void)
325 __this_cpu_write(kprobe_instance
, NULL
);
329 * This routine is called either:
330 * - under the kprobe_mutex - during kprobe_[un]register()
332 * - with preemption disabled - from arch/xxx/kernel/kprobes.c
334 struct kprobe __kprobes
*get_kprobe(void *addr
)
336 struct hlist_head
*head
;
337 struct hlist_node
*node
;
340 head
= &kprobe_table
[hash_ptr(addr
, KPROBE_HASH_BITS
)];
341 hlist_for_each_entry_rcu(p
, node
, head
, hlist
) {
349 static int __kprobes
aggr_pre_handler(struct kprobe
*p
, struct pt_regs
*regs
);
351 /* Return true if the kprobe is an aggregator */
352 static inline int kprobe_aggrprobe(struct kprobe
*p
)
354 return p
->pre_handler
== aggr_pre_handler
;
357 /* Return true(!0) if the kprobe is unused */
358 static inline int kprobe_unused(struct kprobe
*p
)
360 return kprobe_aggrprobe(p
) && kprobe_disabled(p
) &&
361 list_empty(&p
->list
);
365 * Keep all fields in the kprobe consistent
367 static inline void copy_kprobe(struct kprobe
*ap
, struct kprobe
*p
)
369 memcpy(&p
->opcode
, &ap
->opcode
, sizeof(kprobe_opcode_t
));
370 memcpy(&p
->ainsn
, &ap
->ainsn
, sizeof(struct arch_specific_insn
));
373 #ifdef CONFIG_OPTPROBES
374 /* NOTE: change this value only with kprobe_mutex held */
375 static bool kprobes_allow_optimization
;
378 * Call all pre_handler on the list, but ignores its return value.
379 * This must be called from arch-dep optimized caller.
381 void __kprobes
opt_pre_handler(struct kprobe
*p
, struct pt_regs
*regs
)
385 list_for_each_entry_rcu(kp
, &p
->list
, list
) {
386 if (kp
->pre_handler
&& likely(!kprobe_disabled(kp
))) {
387 set_kprobe_instance(kp
);
388 kp
->pre_handler(kp
, regs
);
390 reset_kprobe_instance();
394 /* Free optimized instructions and optimized_kprobe */
395 static __kprobes
void free_aggr_kprobe(struct kprobe
*p
)
397 struct optimized_kprobe
*op
;
399 op
= container_of(p
, struct optimized_kprobe
, kp
);
400 arch_remove_optimized_kprobe(op
);
401 arch_remove_kprobe(p
);
405 /* Return true(!0) if the kprobe is ready for optimization. */
406 static inline int kprobe_optready(struct kprobe
*p
)
408 struct optimized_kprobe
*op
;
410 if (kprobe_aggrprobe(p
)) {
411 op
= container_of(p
, struct optimized_kprobe
, kp
);
412 return arch_prepared_optinsn(&op
->optinsn
);
418 /* Return true(!0) if the kprobe is disarmed. Note: p must be on hash list */
419 static inline int kprobe_disarmed(struct kprobe
*p
)
421 struct optimized_kprobe
*op
;
423 /* If kprobe is not aggr/opt probe, just return kprobe is disabled */
424 if (!kprobe_aggrprobe(p
))
425 return kprobe_disabled(p
);
427 op
= container_of(p
, struct optimized_kprobe
, kp
);
429 return kprobe_disabled(p
) && list_empty(&op
->list
);
432 /* Return true(!0) if the probe is queued on (un)optimizing lists */
433 static int __kprobes
kprobe_queued(struct kprobe
*p
)
435 struct optimized_kprobe
*op
;
437 if (kprobe_aggrprobe(p
)) {
438 op
= container_of(p
, struct optimized_kprobe
, kp
);
439 if (!list_empty(&op
->list
))
446 * Return an optimized kprobe whose optimizing code replaces
447 * instructions including addr (exclude breakpoint).
449 static struct kprobe
*__kprobes
get_optimized_kprobe(unsigned long addr
)
452 struct kprobe
*p
= NULL
;
453 struct optimized_kprobe
*op
;
455 /* Don't check i == 0, since that is a breakpoint case. */
456 for (i
= 1; !p
&& i
< MAX_OPTIMIZED_LENGTH
; i
++)
457 p
= get_kprobe((void *)(addr
- i
));
459 if (p
&& kprobe_optready(p
)) {
460 op
= container_of(p
, struct optimized_kprobe
, kp
);
461 if (arch_within_optimized_kprobe(op
, addr
))
468 /* Optimization staging list, protected by kprobe_mutex */
469 static LIST_HEAD(optimizing_list
);
470 static LIST_HEAD(unoptimizing_list
);
472 static void kprobe_optimizer(struct work_struct
*work
);
473 static DECLARE_DELAYED_WORK(optimizing_work
, kprobe_optimizer
);
474 #define OPTIMIZE_DELAY 5
477 * Optimize (replace a breakpoint with a jump) kprobes listed on
480 static __kprobes
void do_optimize_kprobes(void)
482 /* Optimization never be done when disarmed */
483 if (kprobes_all_disarmed
|| !kprobes_allow_optimization
||
484 list_empty(&optimizing_list
))
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, we need to call get_online_cpus()
495 * for preventing cpu-hotplug outside of text_mutex locking.
498 mutex_lock(&text_mutex
);
499 arch_optimize_kprobes(&optimizing_list
);
500 mutex_unlock(&text_mutex
);
505 * Unoptimize (replace a jump with a breakpoint and remove the breakpoint
506 * if need) kprobes listed on unoptimizing_list.
508 static __kprobes
void do_unoptimize_kprobes(struct list_head
*free_list
)
510 struct optimized_kprobe
*op
, *tmp
;
512 /* Unoptimization must be done anytime */
513 if (list_empty(&unoptimizing_list
))
516 /* Ditto to do_optimize_kprobes */
518 mutex_lock(&text_mutex
);
519 arch_unoptimize_kprobes(&unoptimizing_list
, free_list
);
520 /* Loop free_list for disarming */
521 list_for_each_entry_safe(op
, tmp
, free_list
, list
) {
522 /* Disarm probes if marked disabled */
523 if (kprobe_disabled(&op
->kp
))
524 arch_disarm_kprobe(&op
->kp
);
525 if (kprobe_unused(&op
->kp
)) {
527 * Remove unused probes from hash list. After waiting
528 * for synchronization, these probes are reclaimed.
529 * (reclaiming is done by do_free_cleaned_kprobes.)
531 hlist_del_rcu(&op
->kp
.hlist
);
533 list_del_init(&op
->list
);
535 mutex_unlock(&text_mutex
);
539 /* Reclaim all kprobes on the free_list */
540 static __kprobes
void do_free_cleaned_kprobes(struct list_head
*free_list
)
542 struct optimized_kprobe
*op
, *tmp
;
544 list_for_each_entry_safe(op
, tmp
, free_list
, list
) {
545 BUG_ON(!kprobe_unused(&op
->kp
));
546 list_del_init(&op
->list
);
547 free_aggr_kprobe(&op
->kp
);
551 /* Start optimizer after OPTIMIZE_DELAY passed */
552 static __kprobes
void kick_kprobe_optimizer(void)
554 schedule_delayed_work(&optimizing_work
, OPTIMIZE_DELAY
);
557 /* Kprobe jump optimizer */
558 static __kprobes
void kprobe_optimizer(struct work_struct
*work
)
560 LIST_HEAD(free_list
);
562 mutex_lock(&kprobe_mutex
);
563 /* Lock modules while optimizing kprobes */
564 mutex_lock(&module_mutex
);
567 * Step 1: Unoptimize kprobes and collect cleaned (unused and disarmed)
568 * kprobes before waiting for quiesence period.
570 do_unoptimize_kprobes(&free_list
);
573 * Step 2: Wait for quiesence period to ensure all running interrupts
574 * are done. Because optprobe may modify multiple instructions
575 * there is a chance that Nth instruction is interrupted. In that
576 * case, running interrupt can return to 2nd-Nth byte of jump
577 * instruction. This wait is for avoiding it.
581 /* Step 3: Optimize kprobes after quiesence period */
582 do_optimize_kprobes();
584 /* Step 4: Free cleaned kprobes after quiesence period */
585 do_free_cleaned_kprobes(&free_list
);
587 mutex_unlock(&module_mutex
);
588 mutex_unlock(&kprobe_mutex
);
590 /* Step 5: Kick optimizer again if needed */
591 if (!list_empty(&optimizing_list
) || !list_empty(&unoptimizing_list
))
592 kick_kprobe_optimizer();
595 /* Wait for completing optimization and unoptimization */
596 static __kprobes
void wait_for_kprobe_optimizer(void)
598 mutex_lock(&kprobe_mutex
);
600 while (!list_empty(&optimizing_list
) || !list_empty(&unoptimizing_list
)) {
601 mutex_unlock(&kprobe_mutex
);
603 /* this will also make optimizing_work execute immmediately */
604 flush_delayed_work(&optimizing_work
);
605 /* @optimizing_work might not have been queued yet, relax */
608 mutex_lock(&kprobe_mutex
);
611 mutex_unlock(&kprobe_mutex
);
614 /* Optimize kprobe if p is ready to be optimized */
615 static __kprobes
void optimize_kprobe(struct kprobe
*p
)
617 struct optimized_kprobe
*op
;
619 /* Check if the kprobe is disabled or not ready for optimization. */
620 if (!kprobe_optready(p
) || !kprobes_allow_optimization
||
621 (kprobe_disabled(p
) || kprobes_all_disarmed
))
624 /* Both of break_handler and post_handler are not supported. */
625 if (p
->break_handler
|| p
->post_handler
)
628 op
= container_of(p
, struct optimized_kprobe
, kp
);
630 /* Check there is no other kprobes at the optimized instructions */
631 if (arch_check_optimized_kprobe(op
) < 0)
634 /* Check if it is already optimized. */
635 if (op
->kp
.flags
& KPROBE_FLAG_OPTIMIZED
)
637 op
->kp
.flags
|= KPROBE_FLAG_OPTIMIZED
;
639 if (!list_empty(&op
->list
))
640 /* This is under unoptimizing. Just dequeue the probe */
641 list_del_init(&op
->list
);
643 list_add(&op
->list
, &optimizing_list
);
644 kick_kprobe_optimizer();
648 /* Short cut to direct unoptimizing */
649 static __kprobes
void force_unoptimize_kprobe(struct optimized_kprobe
*op
)
652 arch_unoptimize_kprobe(op
);
654 if (kprobe_disabled(&op
->kp
))
655 arch_disarm_kprobe(&op
->kp
);
658 /* Unoptimize a kprobe if p is optimized */
659 static __kprobes
void unoptimize_kprobe(struct kprobe
*p
, bool force
)
661 struct optimized_kprobe
*op
;
663 if (!kprobe_aggrprobe(p
) || kprobe_disarmed(p
))
664 return; /* This is not an optprobe nor optimized */
666 op
= container_of(p
, struct optimized_kprobe
, kp
);
667 if (!kprobe_optimized(p
)) {
668 /* Unoptimized or unoptimizing case */
669 if (force
&& !list_empty(&op
->list
)) {
671 * Only if this is unoptimizing kprobe and forced,
672 * forcibly unoptimize it. (No need to unoptimize
673 * unoptimized kprobe again :)
675 list_del_init(&op
->list
);
676 force_unoptimize_kprobe(op
);
681 op
->kp
.flags
&= ~KPROBE_FLAG_OPTIMIZED
;
682 if (!list_empty(&op
->list
)) {
683 /* Dequeue from the optimization queue */
684 list_del_init(&op
->list
);
687 /* Optimized kprobe case */
689 /* Forcibly update the code: this is a special case */
690 force_unoptimize_kprobe(op
);
692 list_add(&op
->list
, &unoptimizing_list
);
693 kick_kprobe_optimizer();
697 /* Cancel unoptimizing for reusing */
698 static void reuse_unused_kprobe(struct kprobe
*ap
)
700 struct optimized_kprobe
*op
;
702 BUG_ON(!kprobe_unused(ap
));
704 * Unused kprobe MUST be on the way of delayed unoptimizing (means
705 * there is still a relative jump) and disabled.
707 op
= container_of(ap
, struct optimized_kprobe
, kp
);
708 if (unlikely(list_empty(&op
->list
)))
709 printk(KERN_WARNING
"Warning: found a stray unused "
710 "aggrprobe@%p\n", ap
->addr
);
711 /* Enable the probe again */
712 ap
->flags
&= ~KPROBE_FLAG_DISABLED
;
713 /* Optimize it again (remove from op->list) */
714 BUG_ON(!kprobe_optready(ap
));
718 /* Remove optimized instructions */
719 static void __kprobes
kill_optimized_kprobe(struct kprobe
*p
)
721 struct optimized_kprobe
*op
;
723 op
= container_of(p
, struct optimized_kprobe
, kp
);
724 if (!list_empty(&op
->list
))
725 /* Dequeue from the (un)optimization queue */
726 list_del_init(&op
->list
);
728 op
->kp
.flags
&= ~KPROBE_FLAG_OPTIMIZED
;
729 /* Don't touch the code, because it is already freed. */
730 arch_remove_optimized_kprobe(op
);
733 /* Try to prepare optimized instructions */
734 static __kprobes
void prepare_optimized_kprobe(struct kprobe
*p
)
736 struct optimized_kprobe
*op
;
738 op
= container_of(p
, struct optimized_kprobe
, kp
);
739 arch_prepare_optimized_kprobe(op
);
742 /* Allocate new optimized_kprobe and try to prepare optimized instructions */
743 static __kprobes
struct kprobe
*alloc_aggr_kprobe(struct kprobe
*p
)
745 struct optimized_kprobe
*op
;
747 op
= kzalloc(sizeof(struct optimized_kprobe
), GFP_KERNEL
);
751 INIT_LIST_HEAD(&op
->list
);
752 op
->kp
.addr
= p
->addr
;
753 arch_prepare_optimized_kprobe(op
);
758 static void __kprobes
init_aggr_kprobe(struct kprobe
*ap
, struct kprobe
*p
);
761 * Prepare an optimized_kprobe and optimize it
762 * NOTE: p must be a normal registered kprobe
764 static __kprobes
void try_to_optimize_kprobe(struct kprobe
*p
)
767 struct optimized_kprobe
*op
;
769 /* Impossible to optimize ftrace-based kprobe */
770 if (kprobe_ftrace(p
))
773 /* For preparing optimization, jump_label_text_reserved() is called */
775 mutex_lock(&text_mutex
);
777 ap
= alloc_aggr_kprobe(p
);
781 op
= container_of(ap
, struct optimized_kprobe
, kp
);
782 if (!arch_prepared_optinsn(&op
->optinsn
)) {
783 /* If failed to setup optimizing, fallback to kprobe */
784 arch_remove_optimized_kprobe(op
);
789 init_aggr_kprobe(ap
, p
);
790 optimize_kprobe(ap
); /* This just kicks optimizer thread */
793 mutex_unlock(&text_mutex
);
798 /* This should be called with kprobe_mutex locked */
799 static void __kprobes
optimize_all_kprobes(void)
801 struct hlist_head
*head
;
802 struct hlist_node
*node
;
806 /* If optimization is already allowed, just return */
807 if (kprobes_allow_optimization
)
810 kprobes_allow_optimization
= true;
811 for (i
= 0; i
< KPROBE_TABLE_SIZE
; i
++) {
812 head
= &kprobe_table
[i
];
813 hlist_for_each_entry_rcu(p
, node
, head
, hlist
)
814 if (!kprobe_disabled(p
))
817 printk(KERN_INFO
"Kprobes globally optimized\n");
820 /* This should be called with kprobe_mutex locked */
821 static void __kprobes
unoptimize_all_kprobes(void)
823 struct hlist_head
*head
;
824 struct hlist_node
*node
;
828 /* If optimization is already prohibited, just return */
829 if (!kprobes_allow_optimization
)
832 kprobes_allow_optimization
= false;
833 for (i
= 0; i
< KPROBE_TABLE_SIZE
; i
++) {
834 head
= &kprobe_table
[i
];
835 hlist_for_each_entry_rcu(p
, node
, head
, hlist
) {
836 if (!kprobe_disabled(p
))
837 unoptimize_kprobe(p
, false);
840 /* Wait for unoptimizing completion */
841 wait_for_kprobe_optimizer();
842 printk(KERN_INFO
"Kprobes globally unoptimized\n");
845 int sysctl_kprobes_optimization
;
846 int proc_kprobes_optimization_handler(struct ctl_table
*table
, int write
,
847 void __user
*buffer
, size_t *length
,
852 mutex_lock(&kprobe_mutex
);
853 sysctl_kprobes_optimization
= kprobes_allow_optimization
? 1 : 0;
854 ret
= proc_dointvec_minmax(table
, write
, buffer
, length
, ppos
);
856 if (sysctl_kprobes_optimization
)
857 optimize_all_kprobes();
859 unoptimize_all_kprobes();
860 mutex_unlock(&kprobe_mutex
);
864 #endif /* CONFIG_SYSCTL */
866 /* Put a breakpoint for a probe. Must be called with text_mutex locked */
867 static void __kprobes
__arm_kprobe(struct kprobe
*p
)
871 /* Check collision with other optimized kprobes */
872 _p
= get_optimized_kprobe((unsigned long)p
->addr
);
874 /* Fallback to unoptimized kprobe */
875 unoptimize_kprobe(_p
, true);
878 optimize_kprobe(p
); /* Try to optimize (add kprobe to a list) */
881 /* Remove the breakpoint of a probe. Must be called with text_mutex locked */
882 static void __kprobes
__disarm_kprobe(struct kprobe
*p
, bool reopt
)
886 unoptimize_kprobe(p
, false); /* Try to unoptimize */
888 if (!kprobe_queued(p
)) {
889 arch_disarm_kprobe(p
);
890 /* If another kprobe was blocked, optimize it. */
891 _p
= get_optimized_kprobe((unsigned long)p
->addr
);
892 if (unlikely(_p
) && reopt
)
895 /* TODO: reoptimize others after unoptimized this probe */
898 #else /* !CONFIG_OPTPROBES */
900 #define optimize_kprobe(p) do {} while (0)
901 #define unoptimize_kprobe(p, f) do {} while (0)
902 #define kill_optimized_kprobe(p) do {} while (0)
903 #define prepare_optimized_kprobe(p) do {} while (0)
904 #define try_to_optimize_kprobe(p) do {} while (0)
905 #define __arm_kprobe(p) arch_arm_kprobe(p)
906 #define __disarm_kprobe(p, o) arch_disarm_kprobe(p)
907 #define kprobe_disarmed(p) kprobe_disabled(p)
908 #define wait_for_kprobe_optimizer() do {} while (0)
910 /* There should be no unused kprobes can be reused without optimization */
911 static void reuse_unused_kprobe(struct kprobe
*ap
)
913 printk(KERN_ERR
"Error: There should be no unused kprobe here.\n");
914 BUG_ON(kprobe_unused(ap
));
917 static __kprobes
void free_aggr_kprobe(struct kprobe
*p
)
919 arch_remove_kprobe(p
);
923 static __kprobes
struct kprobe
*alloc_aggr_kprobe(struct kprobe
*p
)
925 return kzalloc(sizeof(struct kprobe
), GFP_KERNEL
);
927 #endif /* CONFIG_OPTPROBES */
929 #ifdef CONFIG_KPROBES_ON_FTRACE
930 static struct ftrace_ops kprobe_ftrace_ops __read_mostly
= {
931 .func
= kprobe_ftrace_handler
,
932 .flags
= FTRACE_OPS_FL_SAVE_REGS
,
934 static int kprobe_ftrace_enabled
;
936 /* Must ensure p->addr is really on ftrace */
937 static int __kprobes
prepare_kprobe(struct kprobe
*p
)
939 if (!kprobe_ftrace(p
))
940 return arch_prepare_kprobe(p
);
942 return arch_prepare_kprobe_ftrace(p
);
945 /* Caller must lock kprobe_mutex */
946 static void __kprobes
arm_kprobe_ftrace(struct kprobe
*p
)
950 ret
= ftrace_set_filter_ip(&kprobe_ftrace_ops
,
951 (unsigned long)p
->addr
, 0, 0);
952 WARN(ret
< 0, "Failed to arm kprobe-ftrace at %p (%d)\n", p
->addr
, ret
);
953 kprobe_ftrace_enabled
++;
954 if (kprobe_ftrace_enabled
== 1) {
955 ret
= register_ftrace_function(&kprobe_ftrace_ops
);
956 WARN(ret
< 0, "Failed to init kprobe-ftrace (%d)\n", ret
);
960 /* Caller must lock kprobe_mutex */
961 static void __kprobes
disarm_kprobe_ftrace(struct kprobe
*p
)
965 kprobe_ftrace_enabled
--;
966 if (kprobe_ftrace_enabled
== 0) {
967 ret
= unregister_ftrace_function(&kprobe_ftrace_ops
);
968 WARN(ret
< 0, "Failed to init kprobe-ftrace (%d)\n", ret
);
970 ret
= ftrace_set_filter_ip(&kprobe_ftrace_ops
,
971 (unsigned long)p
->addr
, 1, 0);
972 WARN(ret
< 0, "Failed to disarm kprobe-ftrace at %p (%d)\n", p
->addr
, ret
);
974 #else /* !CONFIG_KPROBES_ON_FTRACE */
975 #define prepare_kprobe(p) arch_prepare_kprobe(p)
976 #define arm_kprobe_ftrace(p) do {} while (0)
977 #define disarm_kprobe_ftrace(p) do {} while (0)
980 /* Arm a kprobe with text_mutex */
981 static void __kprobes
arm_kprobe(struct kprobe
*kp
)
983 if (unlikely(kprobe_ftrace(kp
))) {
984 arm_kprobe_ftrace(kp
);
988 * Here, since __arm_kprobe() doesn't use stop_machine(),
989 * this doesn't cause deadlock on text_mutex. So, we don't
990 * need get_online_cpus().
992 mutex_lock(&text_mutex
);
994 mutex_unlock(&text_mutex
);
997 /* Disarm a kprobe with text_mutex */
998 static void __kprobes
disarm_kprobe(struct kprobe
*kp
, bool reopt
)
1000 if (unlikely(kprobe_ftrace(kp
))) {
1001 disarm_kprobe_ftrace(kp
);
1005 mutex_lock(&text_mutex
);
1006 __disarm_kprobe(kp
, reopt
);
1007 mutex_unlock(&text_mutex
);
1011 * Aggregate handlers for multiple kprobes support - these handlers
1012 * take care of invoking the individual kprobe handlers on p->list
1014 static int __kprobes
aggr_pre_handler(struct kprobe
*p
, struct pt_regs
*regs
)
1018 list_for_each_entry_rcu(kp
, &p
->list
, list
) {
1019 if (kp
->pre_handler
&& likely(!kprobe_disabled(kp
))) {
1020 set_kprobe_instance(kp
);
1021 if (kp
->pre_handler(kp
, regs
))
1024 reset_kprobe_instance();
1029 static void __kprobes
aggr_post_handler(struct kprobe
*p
, struct pt_regs
*regs
,
1030 unsigned long flags
)
1034 list_for_each_entry_rcu(kp
, &p
->list
, list
) {
1035 if (kp
->post_handler
&& likely(!kprobe_disabled(kp
))) {
1036 set_kprobe_instance(kp
);
1037 kp
->post_handler(kp
, regs
, flags
);
1038 reset_kprobe_instance();
1043 static int __kprobes
aggr_fault_handler(struct kprobe
*p
, struct pt_regs
*regs
,
1046 struct kprobe
*cur
= __this_cpu_read(kprobe_instance
);
1049 * if we faulted "during" the execution of a user specified
1050 * probe handler, invoke just that probe's fault handler
1052 if (cur
&& cur
->fault_handler
) {
1053 if (cur
->fault_handler(cur
, regs
, trapnr
))
1059 static int __kprobes
aggr_break_handler(struct kprobe
*p
, struct pt_regs
*regs
)
1061 struct kprobe
*cur
= __this_cpu_read(kprobe_instance
);
1064 if (cur
&& cur
->break_handler
) {
1065 if (cur
->break_handler(cur
, regs
))
1068 reset_kprobe_instance();
1072 /* Walks the list and increments nmissed count for multiprobe case */
1073 void __kprobes
kprobes_inc_nmissed_count(struct kprobe
*p
)
1076 if (!kprobe_aggrprobe(p
)) {
1079 list_for_each_entry_rcu(kp
, &p
->list
, list
)
1085 void __kprobes
recycle_rp_inst(struct kretprobe_instance
*ri
,
1086 struct hlist_head
*head
)
1088 struct kretprobe
*rp
= ri
->rp
;
1090 /* remove rp inst off the rprobe_inst_table */
1091 hlist_del(&ri
->hlist
);
1092 INIT_HLIST_NODE(&ri
->hlist
);
1094 raw_spin_lock(&rp
->lock
);
1095 hlist_add_head(&ri
->hlist
, &rp
->free_instances
);
1096 raw_spin_unlock(&rp
->lock
);
1099 hlist_add_head(&ri
->hlist
, head
);
1102 void __kprobes
kretprobe_hash_lock(struct task_struct
*tsk
,
1103 struct hlist_head
**head
, unsigned long *flags
)
1104 __acquires(hlist_lock
)
1106 unsigned long hash
= hash_ptr(tsk
, KPROBE_HASH_BITS
);
1107 raw_spinlock_t
*hlist_lock
;
1109 *head
= &kretprobe_inst_table
[hash
];
1110 hlist_lock
= kretprobe_table_lock_ptr(hash
);
1111 raw_spin_lock_irqsave(hlist_lock
, *flags
);
1114 static void __kprobes
kretprobe_table_lock(unsigned long hash
,
1115 unsigned long *flags
)
1116 __acquires(hlist_lock
)
1118 raw_spinlock_t
*hlist_lock
= kretprobe_table_lock_ptr(hash
);
1119 raw_spin_lock_irqsave(hlist_lock
, *flags
);
1122 void __kprobes
kretprobe_hash_unlock(struct task_struct
*tsk
,
1123 unsigned long *flags
)
1124 __releases(hlist_lock
)
1126 unsigned long hash
= hash_ptr(tsk
, KPROBE_HASH_BITS
);
1127 raw_spinlock_t
*hlist_lock
;
1129 hlist_lock
= kretprobe_table_lock_ptr(hash
);
1130 raw_spin_unlock_irqrestore(hlist_lock
, *flags
);
1133 static void __kprobes
kretprobe_table_unlock(unsigned long hash
,
1134 unsigned long *flags
)
1135 __releases(hlist_lock
)
1137 raw_spinlock_t
*hlist_lock
= kretprobe_table_lock_ptr(hash
);
1138 raw_spin_unlock_irqrestore(hlist_lock
, *flags
);
1142 * This function is called from finish_task_switch when task tk becomes dead,
1143 * so that we can recycle any function-return probe instances associated
1144 * with this task. These left over instances represent probed functions
1145 * that have been called but will never return.
1147 void __kprobes
kprobe_flush_task(struct task_struct
*tk
)
1149 struct kretprobe_instance
*ri
;
1150 struct hlist_head
*head
, empty_rp
;
1151 struct hlist_node
*node
, *tmp
;
1152 unsigned long hash
, flags
= 0;
1154 if (unlikely(!kprobes_initialized
))
1155 /* Early boot. kretprobe_table_locks not yet initialized. */
1158 INIT_HLIST_HEAD(&empty_rp
);
1159 hash
= hash_ptr(tk
, KPROBE_HASH_BITS
);
1160 head
= &kretprobe_inst_table
[hash
];
1161 kretprobe_table_lock(hash
, &flags
);
1162 hlist_for_each_entry_safe(ri
, node
, tmp
, head
, hlist
) {
1164 recycle_rp_inst(ri
, &empty_rp
);
1166 kretprobe_table_unlock(hash
, &flags
);
1167 hlist_for_each_entry_safe(ri
, node
, tmp
, &empty_rp
, hlist
) {
1168 hlist_del(&ri
->hlist
);
1173 static inline void free_rp_inst(struct kretprobe
*rp
)
1175 struct kretprobe_instance
*ri
;
1176 struct hlist_node
*pos
, *next
;
1178 hlist_for_each_entry_safe(ri
, pos
, next
, &rp
->free_instances
, hlist
) {
1179 hlist_del(&ri
->hlist
);
1184 static void __kprobes
cleanup_rp_inst(struct kretprobe
*rp
)
1186 unsigned long flags
, hash
;
1187 struct kretprobe_instance
*ri
;
1188 struct hlist_node
*pos
, *next
;
1189 struct hlist_head
*head
;
1192 for (hash
= 0; hash
< KPROBE_TABLE_SIZE
; hash
++) {
1193 kretprobe_table_lock(hash
, &flags
);
1194 head
= &kretprobe_inst_table
[hash
];
1195 hlist_for_each_entry_safe(ri
, pos
, next
, head
, hlist
) {
1199 kretprobe_table_unlock(hash
, &flags
);
1205 * Add the new probe to ap->list. Fail if this is the
1206 * second jprobe at the address - two jprobes can't coexist
1208 static int __kprobes
add_new_kprobe(struct kprobe
*ap
, struct kprobe
*p
)
1210 BUG_ON(kprobe_gone(ap
) || kprobe_gone(p
));
1212 if (p
->break_handler
|| p
->post_handler
)
1213 unoptimize_kprobe(ap
, true); /* Fall back to normal kprobe */
1215 if (p
->break_handler
) {
1216 if (ap
->break_handler
)
1218 list_add_tail_rcu(&p
->list
, &ap
->list
);
1219 ap
->break_handler
= aggr_break_handler
;
1221 list_add_rcu(&p
->list
, &ap
->list
);
1222 if (p
->post_handler
&& !ap
->post_handler
)
1223 ap
->post_handler
= aggr_post_handler
;
1229 * Fill in the required fields of the "manager kprobe". Replace the
1230 * earlier kprobe in the hlist with the manager kprobe
1232 static void __kprobes
init_aggr_kprobe(struct kprobe
*ap
, struct kprobe
*p
)
1234 /* Copy p's insn slot to ap */
1236 flush_insn_slot(ap
);
1238 ap
->flags
= p
->flags
& ~KPROBE_FLAG_OPTIMIZED
;
1239 ap
->pre_handler
= aggr_pre_handler
;
1240 ap
->fault_handler
= aggr_fault_handler
;
1241 /* We don't care the kprobe which has gone. */
1242 if (p
->post_handler
&& !kprobe_gone(p
))
1243 ap
->post_handler
= aggr_post_handler
;
1244 if (p
->break_handler
&& !kprobe_gone(p
))
1245 ap
->break_handler
= aggr_break_handler
;
1247 INIT_LIST_HEAD(&ap
->list
);
1248 INIT_HLIST_NODE(&ap
->hlist
);
1250 list_add_rcu(&p
->list
, &ap
->list
);
1251 hlist_replace_rcu(&p
->hlist
, &ap
->hlist
);
1255 * This is the second or subsequent kprobe at the address - handle
1258 static int __kprobes
register_aggr_kprobe(struct kprobe
*orig_p
,
1262 struct kprobe
*ap
= orig_p
;
1264 /* For preparing optimization, jump_label_text_reserved() is called */
1267 * Get online CPUs to avoid text_mutex deadlock.with stop machine,
1268 * which is invoked by unoptimize_kprobe() in add_new_kprobe()
1271 mutex_lock(&text_mutex
);
1273 if (!kprobe_aggrprobe(orig_p
)) {
1274 /* If orig_p is not an aggr_kprobe, create new aggr_kprobe. */
1275 ap
= alloc_aggr_kprobe(orig_p
);
1280 init_aggr_kprobe(ap
, orig_p
);
1281 } else if (kprobe_unused(ap
))
1282 /* This probe is going to die. Rescue it */
1283 reuse_unused_kprobe(ap
);
1285 if (kprobe_gone(ap
)) {
1287 * Attempting to insert new probe at the same location that
1288 * had a probe in the module vaddr area which already
1289 * freed. So, the instruction slot has already been
1290 * released. We need a new slot for the new probe.
1292 ret
= arch_prepare_kprobe(ap
);
1295 * Even if fail to allocate new slot, don't need to
1296 * free aggr_probe. It will be used next time, or
1297 * freed by unregister_kprobe.
1301 /* Prepare optimized instructions if possible. */
1302 prepare_optimized_kprobe(ap
);
1305 * Clear gone flag to prevent allocating new slot again, and
1306 * set disabled flag because it is not armed yet.
1308 ap
->flags
= (ap
->flags
& ~KPROBE_FLAG_GONE
)
1309 | KPROBE_FLAG_DISABLED
;
1312 /* Copy ap's insn slot to p */
1314 ret
= add_new_kprobe(ap
, p
);
1317 mutex_unlock(&text_mutex
);
1319 jump_label_unlock();
1321 if (ret
== 0 && kprobe_disabled(ap
) && !kprobe_disabled(p
)) {
1322 ap
->flags
&= ~KPROBE_FLAG_DISABLED
;
1323 if (!kprobes_all_disarmed
)
1324 /* Arm the breakpoint again. */
1330 static int __kprobes
in_kprobes_functions(unsigned long addr
)
1332 struct kprobe_blackpoint
*kb
;
1334 if (addr
>= (unsigned long)__kprobes_text_start
&&
1335 addr
< (unsigned long)__kprobes_text_end
)
1338 * If there exists a kprobe_blacklist, verify and
1339 * fail any probe registration in the prohibited area
1341 for (kb
= kprobe_blacklist
; kb
->name
!= NULL
; kb
++) {
1342 if (kb
->start_addr
) {
1343 if (addr
>= kb
->start_addr
&&
1344 addr
< (kb
->start_addr
+ kb
->range
))
1352 * If we have a symbol_name argument, look it up and add the offset field
1353 * to it. This way, we can specify a relative address to a symbol.
1354 * This returns encoded errors if it fails to look up symbol or invalid
1355 * combination of parameters.
1357 static kprobe_opcode_t __kprobes
*kprobe_addr(struct kprobe
*p
)
1359 kprobe_opcode_t
*addr
= p
->addr
;
1361 if ((p
->symbol_name
&& p
->addr
) ||
1362 (!p
->symbol_name
&& !p
->addr
))
1365 if (p
->symbol_name
) {
1366 kprobe_lookup_name(p
->symbol_name
, addr
);
1368 return ERR_PTR(-ENOENT
);
1371 addr
= (kprobe_opcode_t
*)(((char *)addr
) + p
->offset
);
1376 return ERR_PTR(-EINVAL
);
1379 /* Check passed kprobe is valid and return kprobe in kprobe_table. */
1380 static struct kprobe
* __kprobes
__get_valid_kprobe(struct kprobe
*p
)
1382 struct kprobe
*ap
, *list_p
;
1384 ap
= get_kprobe(p
->addr
);
1389 list_for_each_entry_rcu(list_p
, &ap
->list
, list
)
1391 /* kprobe p is a valid probe */
1399 /* Return error if the kprobe is being re-registered */
1400 static inline int check_kprobe_rereg(struct kprobe
*p
)
1404 mutex_lock(&kprobe_mutex
);
1405 if (__get_valid_kprobe(p
))
1407 mutex_unlock(&kprobe_mutex
);
1412 static __kprobes
int check_kprobe_address_safe(struct kprobe
*p
,
1413 struct module
**probed_mod
)
1416 unsigned long ftrace_addr
;
1419 * If the address is located on a ftrace nop, set the
1420 * breakpoint to the following instruction.
1422 ftrace_addr
= ftrace_location((unsigned long)p
->addr
);
1424 #ifdef CONFIG_KPROBES_ON_FTRACE
1425 /* Given address is not on the instruction boundary */
1426 if ((unsigned long)p
->addr
!= ftrace_addr
)
1428 p
->flags
|= KPROBE_FLAG_FTRACE
;
1429 #else /* !CONFIG_KPROBES_ON_FTRACE */
1437 /* Ensure it is not in reserved area nor out of text */
1438 if (!kernel_text_address((unsigned long) p
->addr
) ||
1439 in_kprobes_functions((unsigned long) p
->addr
) ||
1440 jump_label_text_reserved(p
->addr
, p
->addr
)) {
1445 /* Check if are we probing a module */
1446 *probed_mod
= __module_text_address((unsigned long) p
->addr
);
1449 * We must hold a refcount of the probed module while updating
1450 * its code to prohibit unexpected unloading.
1452 if (unlikely(!try_module_get(*probed_mod
))) {
1458 * If the module freed .init.text, we couldn't insert
1461 if (within_module_init((unsigned long)p
->addr
, *probed_mod
) &&
1462 (*probed_mod
)->state
!= MODULE_STATE_COMING
) {
1463 module_put(*probed_mod
);
1470 jump_label_unlock();
1475 int __kprobes
register_kprobe(struct kprobe
*p
)
1478 struct kprobe
*old_p
;
1479 struct module
*probed_mod
;
1480 kprobe_opcode_t
*addr
;
1482 /* Adjust probe address from symbol */
1483 addr
= kprobe_addr(p
);
1485 return PTR_ERR(addr
);
1488 ret
= check_kprobe_rereg(p
);
1492 /* User can pass only KPROBE_FLAG_DISABLED to register_kprobe */
1493 p
->flags
&= KPROBE_FLAG_DISABLED
;
1495 INIT_LIST_HEAD(&p
->list
);
1497 ret
= check_kprobe_address_safe(p
, &probed_mod
);
1501 mutex_lock(&kprobe_mutex
);
1503 old_p
= get_kprobe(p
->addr
);
1505 /* Since this may unoptimize old_p, locking text_mutex. */
1506 ret
= register_aggr_kprobe(old_p
, p
);
1510 mutex_lock(&text_mutex
); /* Avoiding text modification */
1511 ret
= prepare_kprobe(p
);
1512 mutex_unlock(&text_mutex
);
1516 INIT_HLIST_NODE(&p
->hlist
);
1517 hlist_add_head_rcu(&p
->hlist
,
1518 &kprobe_table
[hash_ptr(p
->addr
, KPROBE_HASH_BITS
)]);
1520 if (!kprobes_all_disarmed
&& !kprobe_disabled(p
))
1523 /* Try to optimize kprobe */
1524 try_to_optimize_kprobe(p
);
1527 mutex_unlock(&kprobe_mutex
);
1530 module_put(probed_mod
);
1534 EXPORT_SYMBOL_GPL(register_kprobe
);
1536 /* Check if all probes on the aggrprobe are disabled */
1537 static int __kprobes
aggr_kprobe_disabled(struct kprobe
*ap
)
1541 list_for_each_entry_rcu(kp
, &ap
->list
, list
)
1542 if (!kprobe_disabled(kp
))
1544 * There is an active probe on the list.
1545 * We can't disable this ap.
1552 /* Disable one kprobe: Make sure called under kprobe_mutex is locked */
1553 static struct kprobe
*__kprobes
__disable_kprobe(struct kprobe
*p
)
1555 struct kprobe
*orig_p
;
1557 /* Get an original kprobe for return */
1558 orig_p
= __get_valid_kprobe(p
);
1559 if (unlikely(orig_p
== NULL
))
1562 if (!kprobe_disabled(p
)) {
1563 /* Disable probe if it is a child probe */
1565 p
->flags
|= KPROBE_FLAG_DISABLED
;
1567 /* Try to disarm and disable this/parent probe */
1568 if (p
== orig_p
|| aggr_kprobe_disabled(orig_p
)) {
1569 disarm_kprobe(orig_p
, true);
1570 orig_p
->flags
|= KPROBE_FLAG_DISABLED
;
1578 * Unregister a kprobe without a scheduler synchronization.
1580 static int __kprobes
__unregister_kprobe_top(struct kprobe
*p
)
1582 struct kprobe
*ap
, *list_p
;
1584 /* Disable kprobe. This will disarm it if needed. */
1585 ap
= __disable_kprobe(p
);
1591 * This probe is an independent(and non-optimized) kprobe
1592 * (not an aggrprobe). Remove from the hash list.
1596 /* Following process expects this probe is an aggrprobe */
1597 WARN_ON(!kprobe_aggrprobe(ap
));
1599 if (list_is_singular(&ap
->list
) && kprobe_disarmed(ap
))
1601 * !disarmed could be happen if the probe is under delayed
1606 /* If disabling probe has special handlers, update aggrprobe */
1607 if (p
->break_handler
&& !kprobe_gone(p
))
1608 ap
->break_handler
= NULL
;
1609 if (p
->post_handler
&& !kprobe_gone(p
)) {
1610 list_for_each_entry_rcu(list_p
, &ap
->list
, list
) {
1611 if ((list_p
!= p
) && (list_p
->post_handler
))
1614 ap
->post_handler
= NULL
;
1618 * Remove from the aggrprobe: this path will do nothing in
1619 * __unregister_kprobe_bottom().
1621 list_del_rcu(&p
->list
);
1622 if (!kprobe_disabled(ap
) && !kprobes_all_disarmed
)
1624 * Try to optimize this probe again, because post
1625 * handler may have been changed.
1627 optimize_kprobe(ap
);
1632 BUG_ON(!kprobe_disarmed(ap
));
1633 hlist_del_rcu(&ap
->hlist
);
1637 static void __kprobes
__unregister_kprobe_bottom(struct kprobe
*p
)
1641 if (list_empty(&p
->list
))
1642 /* This is an independent kprobe */
1643 arch_remove_kprobe(p
);
1644 else if (list_is_singular(&p
->list
)) {
1645 /* This is the last child of an aggrprobe */
1646 ap
= list_entry(p
->list
.next
, struct kprobe
, list
);
1648 free_aggr_kprobe(ap
);
1650 /* Otherwise, do nothing. */
1653 int __kprobes
register_kprobes(struct kprobe
**kps
, int num
)
1659 for (i
= 0; i
< num
; i
++) {
1660 ret
= register_kprobe(kps
[i
]);
1663 unregister_kprobes(kps
, i
);
1669 EXPORT_SYMBOL_GPL(register_kprobes
);
1671 void __kprobes
unregister_kprobe(struct kprobe
*p
)
1673 unregister_kprobes(&p
, 1);
1675 EXPORT_SYMBOL_GPL(unregister_kprobe
);
1677 void __kprobes
unregister_kprobes(struct kprobe
**kps
, int num
)
1683 mutex_lock(&kprobe_mutex
);
1684 for (i
= 0; i
< num
; i
++)
1685 if (__unregister_kprobe_top(kps
[i
]) < 0)
1686 kps
[i
]->addr
= NULL
;
1687 mutex_unlock(&kprobe_mutex
);
1689 synchronize_sched();
1690 for (i
= 0; i
< num
; i
++)
1692 __unregister_kprobe_bottom(kps
[i
]);
1694 EXPORT_SYMBOL_GPL(unregister_kprobes
);
1696 static struct notifier_block kprobe_exceptions_nb
= {
1697 .notifier_call
= kprobe_exceptions_notify
,
1698 .priority
= 0x7fffffff /* we need to be notified first */
1701 unsigned long __weak
arch_deref_entry_point(void *entry
)
1703 return (unsigned long)entry
;
1706 int __kprobes
register_jprobes(struct jprobe
**jps
, int num
)
1713 for (i
= 0; i
< num
; i
++) {
1714 unsigned long addr
, offset
;
1716 addr
= arch_deref_entry_point(jp
->entry
);
1718 /* Verify probepoint is a function entry point */
1719 if (kallsyms_lookup_size_offset(addr
, NULL
, &offset
) &&
1721 jp
->kp
.pre_handler
= setjmp_pre_handler
;
1722 jp
->kp
.break_handler
= longjmp_break_handler
;
1723 ret
= register_kprobe(&jp
->kp
);
1729 unregister_jprobes(jps
, i
);
1735 EXPORT_SYMBOL_GPL(register_jprobes
);
1737 int __kprobes
register_jprobe(struct jprobe
*jp
)
1739 return register_jprobes(&jp
, 1);
1741 EXPORT_SYMBOL_GPL(register_jprobe
);
1743 void __kprobes
unregister_jprobe(struct jprobe
*jp
)
1745 unregister_jprobes(&jp
, 1);
1747 EXPORT_SYMBOL_GPL(unregister_jprobe
);
1749 void __kprobes
unregister_jprobes(struct jprobe
**jps
, int num
)
1755 mutex_lock(&kprobe_mutex
);
1756 for (i
= 0; i
< num
; i
++)
1757 if (__unregister_kprobe_top(&jps
[i
]->kp
) < 0)
1758 jps
[i
]->kp
.addr
= NULL
;
1759 mutex_unlock(&kprobe_mutex
);
1761 synchronize_sched();
1762 for (i
= 0; i
< num
; i
++) {
1763 if (jps
[i
]->kp
.addr
)
1764 __unregister_kprobe_bottom(&jps
[i
]->kp
);
1767 EXPORT_SYMBOL_GPL(unregister_jprobes
);
1769 #ifdef CONFIG_KRETPROBES
1771 * This kprobe pre_handler is registered with every kretprobe. When probe
1772 * hits it will set up the return probe.
1774 static int __kprobes
pre_handler_kretprobe(struct kprobe
*p
,
1775 struct pt_regs
*regs
)
1777 struct kretprobe
*rp
= container_of(p
, struct kretprobe
, kp
);
1778 unsigned long hash
, flags
= 0;
1779 struct kretprobe_instance
*ri
;
1781 /*TODO: consider to only swap the RA after the last pre_handler fired */
1782 hash
= hash_ptr(current
, KPROBE_HASH_BITS
);
1783 raw_spin_lock_irqsave(&rp
->lock
, flags
);
1784 if (!hlist_empty(&rp
->free_instances
)) {
1785 ri
= hlist_entry(rp
->free_instances
.first
,
1786 struct kretprobe_instance
, hlist
);
1787 hlist_del(&ri
->hlist
);
1788 raw_spin_unlock_irqrestore(&rp
->lock
, flags
);
1793 if (rp
->entry_handler
&& rp
->entry_handler(ri
, regs
)) {
1794 raw_spin_lock_irqsave(&rp
->lock
, flags
);
1795 hlist_add_head(&ri
->hlist
, &rp
->free_instances
);
1796 raw_spin_unlock_irqrestore(&rp
->lock
, flags
);
1800 arch_prepare_kretprobe(ri
, regs
);
1802 /* XXX(hch): why is there no hlist_move_head? */
1803 INIT_HLIST_NODE(&ri
->hlist
);
1804 kretprobe_table_lock(hash
, &flags
);
1805 hlist_add_head(&ri
->hlist
, &kretprobe_inst_table
[hash
]);
1806 kretprobe_table_unlock(hash
, &flags
);
1809 raw_spin_unlock_irqrestore(&rp
->lock
, flags
);
1814 int __kprobes
register_kretprobe(struct kretprobe
*rp
)
1817 struct kretprobe_instance
*inst
;
1821 if (kretprobe_blacklist_size
) {
1822 addr
= kprobe_addr(&rp
->kp
);
1824 return PTR_ERR(addr
);
1826 for (i
= 0; kretprobe_blacklist
[i
].name
!= NULL
; i
++) {
1827 if (kretprobe_blacklist
[i
].addr
== addr
)
1832 rp
->kp
.pre_handler
= pre_handler_kretprobe
;
1833 rp
->kp
.post_handler
= NULL
;
1834 rp
->kp
.fault_handler
= NULL
;
1835 rp
->kp
.break_handler
= NULL
;
1837 /* Pre-allocate memory for max kretprobe instances */
1838 if (rp
->maxactive
<= 0) {
1839 #ifdef CONFIG_PREEMPT
1840 rp
->maxactive
= max_t(unsigned int, 10, 2*num_possible_cpus());
1842 rp
->maxactive
= num_possible_cpus();
1845 raw_spin_lock_init(&rp
->lock
);
1846 INIT_HLIST_HEAD(&rp
->free_instances
);
1847 for (i
= 0; i
< rp
->maxactive
; i
++) {
1848 inst
= kmalloc(sizeof(struct kretprobe_instance
) +
1849 rp
->data_size
, GFP_KERNEL
);
1854 INIT_HLIST_NODE(&inst
->hlist
);
1855 hlist_add_head(&inst
->hlist
, &rp
->free_instances
);
1859 /* Establish function entry probe point */
1860 ret
= register_kprobe(&rp
->kp
);
1865 EXPORT_SYMBOL_GPL(register_kretprobe
);
1867 int __kprobes
register_kretprobes(struct kretprobe
**rps
, int num
)
1873 for (i
= 0; i
< num
; i
++) {
1874 ret
= register_kretprobe(rps
[i
]);
1877 unregister_kretprobes(rps
, i
);
1883 EXPORT_SYMBOL_GPL(register_kretprobes
);
1885 void __kprobes
unregister_kretprobe(struct kretprobe
*rp
)
1887 unregister_kretprobes(&rp
, 1);
1889 EXPORT_SYMBOL_GPL(unregister_kretprobe
);
1891 void __kprobes
unregister_kretprobes(struct kretprobe
**rps
, int num
)
1897 mutex_lock(&kprobe_mutex
);
1898 for (i
= 0; i
< num
; i
++)
1899 if (__unregister_kprobe_top(&rps
[i
]->kp
) < 0)
1900 rps
[i
]->kp
.addr
= NULL
;
1901 mutex_unlock(&kprobe_mutex
);
1903 synchronize_sched();
1904 for (i
= 0; i
< num
; i
++) {
1905 if (rps
[i
]->kp
.addr
) {
1906 __unregister_kprobe_bottom(&rps
[i
]->kp
);
1907 cleanup_rp_inst(rps
[i
]);
1911 EXPORT_SYMBOL_GPL(unregister_kretprobes
);
1913 #else /* CONFIG_KRETPROBES */
1914 int __kprobes
register_kretprobe(struct kretprobe
*rp
)
1918 EXPORT_SYMBOL_GPL(register_kretprobe
);
1920 int __kprobes
register_kretprobes(struct kretprobe
**rps
, int num
)
1924 EXPORT_SYMBOL_GPL(register_kretprobes
);
1926 void __kprobes
unregister_kretprobe(struct kretprobe
*rp
)
1929 EXPORT_SYMBOL_GPL(unregister_kretprobe
);
1931 void __kprobes
unregister_kretprobes(struct kretprobe
**rps
, int num
)
1934 EXPORT_SYMBOL_GPL(unregister_kretprobes
);
1936 static int __kprobes
pre_handler_kretprobe(struct kprobe
*p
,
1937 struct pt_regs
*regs
)
1942 #endif /* CONFIG_KRETPROBES */
1944 /* Set the kprobe gone and remove its instruction buffer. */
1945 static void __kprobes
kill_kprobe(struct kprobe
*p
)
1949 p
->flags
|= KPROBE_FLAG_GONE
;
1950 if (kprobe_aggrprobe(p
)) {
1952 * If this is an aggr_kprobe, we have to list all the
1953 * chained probes and mark them GONE.
1955 list_for_each_entry_rcu(kp
, &p
->list
, list
)
1956 kp
->flags
|= KPROBE_FLAG_GONE
;
1957 p
->post_handler
= NULL
;
1958 p
->break_handler
= NULL
;
1959 kill_optimized_kprobe(p
);
1962 * Here, we can remove insn_slot safely, because no thread calls
1963 * the original probed function (which will be freed soon) any more.
1965 arch_remove_kprobe(p
);
1968 /* Disable one kprobe */
1969 int __kprobes
disable_kprobe(struct kprobe
*kp
)
1973 mutex_lock(&kprobe_mutex
);
1975 /* Disable this kprobe */
1976 if (__disable_kprobe(kp
) == NULL
)
1979 mutex_unlock(&kprobe_mutex
);
1982 EXPORT_SYMBOL_GPL(disable_kprobe
);
1984 /* Enable one kprobe */
1985 int __kprobes
enable_kprobe(struct kprobe
*kp
)
1990 mutex_lock(&kprobe_mutex
);
1992 /* Check whether specified probe is valid. */
1993 p
= __get_valid_kprobe(kp
);
1994 if (unlikely(p
== NULL
)) {
1999 if (kprobe_gone(kp
)) {
2000 /* This kprobe has gone, we couldn't enable it. */
2006 kp
->flags
&= ~KPROBE_FLAG_DISABLED
;
2008 if (!kprobes_all_disarmed
&& kprobe_disabled(p
)) {
2009 p
->flags
&= ~KPROBE_FLAG_DISABLED
;
2013 mutex_unlock(&kprobe_mutex
);
2016 EXPORT_SYMBOL_GPL(enable_kprobe
);
2018 void __kprobes
dump_kprobe(struct kprobe
*kp
)
2020 printk(KERN_WARNING
"Dumping kprobe:\n");
2021 printk(KERN_WARNING
"Name: %s\nAddress: %p\nOffset: %x\n",
2022 kp
->symbol_name
, kp
->addr
, kp
->offset
);
2025 /* Module notifier call back, checking kprobes on the module */
2026 static int __kprobes
kprobes_module_callback(struct notifier_block
*nb
,
2027 unsigned long val
, void *data
)
2029 struct module
*mod
= data
;
2030 struct hlist_head
*head
;
2031 struct hlist_node
*node
;
2034 int checkcore
= (val
== MODULE_STATE_GOING
);
2036 if (val
!= MODULE_STATE_GOING
&& val
!= MODULE_STATE_LIVE
)
2040 * When MODULE_STATE_GOING was notified, both of module .text and
2041 * .init.text sections would be freed. When MODULE_STATE_LIVE was
2042 * notified, only .init.text section would be freed. We need to
2043 * disable kprobes which have been inserted in the sections.
2045 mutex_lock(&kprobe_mutex
);
2046 for (i
= 0; i
< KPROBE_TABLE_SIZE
; i
++) {
2047 head
= &kprobe_table
[i
];
2048 hlist_for_each_entry_rcu(p
, node
, head
, hlist
)
2049 if (within_module_init((unsigned long)p
->addr
, mod
) ||
2051 within_module_core((unsigned long)p
->addr
, mod
))) {
2053 * The vaddr this probe is installed will soon
2054 * be vfreed buy not synced to disk. Hence,
2055 * disarming the breakpoint isn't needed.
2060 mutex_unlock(&kprobe_mutex
);
2064 static struct notifier_block kprobe_module_nb
= {
2065 .notifier_call
= kprobes_module_callback
,
2069 static int __init
init_kprobes(void)
2072 unsigned long offset
= 0, size
= 0;
2073 char *modname
, namebuf
[128];
2074 const char *symbol_name
;
2076 struct kprobe_blackpoint
*kb
;
2078 /* FIXME allocate the probe table, currently defined statically */
2079 /* initialize all list heads */
2080 for (i
= 0; i
< KPROBE_TABLE_SIZE
; i
++) {
2081 INIT_HLIST_HEAD(&kprobe_table
[i
]);
2082 INIT_HLIST_HEAD(&kretprobe_inst_table
[i
]);
2083 raw_spin_lock_init(&(kretprobe_table_locks
[i
].lock
));
2087 * Lookup and populate the kprobe_blacklist.
2089 * Unlike the kretprobe blacklist, we'll need to determine
2090 * the range of addresses that belong to the said functions,
2091 * since a kprobe need not necessarily be at the beginning
2094 for (kb
= kprobe_blacklist
; kb
->name
!= NULL
; kb
++) {
2095 kprobe_lookup_name(kb
->name
, addr
);
2099 kb
->start_addr
= (unsigned long)addr
;
2100 symbol_name
= kallsyms_lookup(kb
->start_addr
,
2101 &size
, &offset
, &modname
, namebuf
);
2108 if (kretprobe_blacklist_size
) {
2109 /* lookup the function address from its name */
2110 for (i
= 0; kretprobe_blacklist
[i
].name
!= NULL
; i
++) {
2111 kprobe_lookup_name(kretprobe_blacklist
[i
].name
,
2112 kretprobe_blacklist
[i
].addr
);
2113 if (!kretprobe_blacklist
[i
].addr
)
2114 printk("kretprobe: lookup failed: %s\n",
2115 kretprobe_blacklist
[i
].name
);
2119 #if defined(CONFIG_OPTPROBES)
2120 #if defined(__ARCH_WANT_KPROBES_INSN_SLOT)
2121 /* Init kprobe_optinsn_slots */
2122 kprobe_optinsn_slots
.insn_size
= MAX_OPTINSN_SIZE
;
2124 /* By default, kprobes can be optimized */
2125 kprobes_allow_optimization
= true;
2128 /* By default, kprobes are armed */
2129 kprobes_all_disarmed
= false;
2131 err
= arch_init_kprobes();
2133 err
= register_die_notifier(&kprobe_exceptions_nb
);
2135 err
= register_module_notifier(&kprobe_module_nb
);
2137 kprobes_initialized
= (err
== 0);
2144 #ifdef CONFIG_DEBUG_FS
2145 static void __kprobes
report_probe(struct seq_file
*pi
, struct kprobe
*p
,
2146 const char *sym
, int offset
, char *modname
, struct kprobe
*pp
)
2150 if (p
->pre_handler
== pre_handler_kretprobe
)
2152 else if (p
->pre_handler
== setjmp_pre_handler
)
2158 seq_printf(pi
, "%p %s %s+0x%x %s ",
2159 p
->addr
, kprobe_type
, sym
, offset
,
2160 (modname
? modname
: " "));
2162 seq_printf(pi
, "%p %s %p ",
2163 p
->addr
, kprobe_type
, p
->addr
);
2167 seq_printf(pi
, "%s%s%s%s\n",
2168 (kprobe_gone(p
) ? "[GONE]" : ""),
2169 ((kprobe_disabled(p
) && !kprobe_gone(p
)) ? "[DISABLED]" : ""),
2170 (kprobe_optimized(pp
) ? "[OPTIMIZED]" : ""),
2171 (kprobe_ftrace(pp
) ? "[FTRACE]" : ""));
2174 static void __kprobes
*kprobe_seq_start(struct seq_file
*f
, loff_t
*pos
)
2176 return (*pos
< KPROBE_TABLE_SIZE
) ? pos
: NULL
;
2179 static void __kprobes
*kprobe_seq_next(struct seq_file
*f
, void *v
, loff_t
*pos
)
2182 if (*pos
>= KPROBE_TABLE_SIZE
)
2187 static void __kprobes
kprobe_seq_stop(struct seq_file
*f
, void *v
)
2192 static int __kprobes
show_kprobe_addr(struct seq_file
*pi
, void *v
)
2194 struct hlist_head
*head
;
2195 struct hlist_node
*node
;
2196 struct kprobe
*p
, *kp
;
2197 const char *sym
= NULL
;
2198 unsigned int i
= *(loff_t
*) v
;
2199 unsigned long offset
= 0;
2200 char *modname
, namebuf
[128];
2202 head
= &kprobe_table
[i
];
2204 hlist_for_each_entry_rcu(p
, node
, head
, hlist
) {
2205 sym
= kallsyms_lookup((unsigned long)p
->addr
, NULL
,
2206 &offset
, &modname
, namebuf
);
2207 if (kprobe_aggrprobe(p
)) {
2208 list_for_each_entry_rcu(kp
, &p
->list
, list
)
2209 report_probe(pi
, kp
, sym
, offset
, modname
, p
);
2211 report_probe(pi
, p
, sym
, offset
, modname
, NULL
);
2217 static const struct seq_operations kprobes_seq_ops
= {
2218 .start
= kprobe_seq_start
,
2219 .next
= kprobe_seq_next
,
2220 .stop
= kprobe_seq_stop
,
2221 .show
= show_kprobe_addr
2224 static int __kprobes
kprobes_open(struct inode
*inode
, struct file
*filp
)
2226 return seq_open(filp
, &kprobes_seq_ops
);
2229 static const struct file_operations debugfs_kprobes_operations
= {
2230 .open
= kprobes_open
,
2232 .llseek
= seq_lseek
,
2233 .release
= seq_release
,
2236 static void __kprobes
arm_all_kprobes(void)
2238 struct hlist_head
*head
;
2239 struct hlist_node
*node
;
2243 mutex_lock(&kprobe_mutex
);
2245 /* If kprobes are armed, just return */
2246 if (!kprobes_all_disarmed
)
2247 goto already_enabled
;
2249 /* Arming kprobes doesn't optimize kprobe itself */
2250 for (i
= 0; i
< KPROBE_TABLE_SIZE
; i
++) {
2251 head
= &kprobe_table
[i
];
2252 hlist_for_each_entry_rcu(p
, node
, head
, hlist
)
2253 if (!kprobe_disabled(p
))
2257 kprobes_all_disarmed
= false;
2258 printk(KERN_INFO
"Kprobes globally enabled\n");
2261 mutex_unlock(&kprobe_mutex
);
2265 static void __kprobes
disarm_all_kprobes(void)
2267 struct hlist_head
*head
;
2268 struct hlist_node
*node
;
2272 mutex_lock(&kprobe_mutex
);
2274 /* If kprobes are already disarmed, just return */
2275 if (kprobes_all_disarmed
) {
2276 mutex_unlock(&kprobe_mutex
);
2280 kprobes_all_disarmed
= true;
2281 printk(KERN_INFO
"Kprobes globally disabled\n");
2283 for (i
= 0; i
< KPROBE_TABLE_SIZE
; i
++) {
2284 head
= &kprobe_table
[i
];
2285 hlist_for_each_entry_rcu(p
, node
, head
, hlist
) {
2286 if (!arch_trampoline_kprobe(p
) && !kprobe_disabled(p
))
2287 disarm_kprobe(p
, false);
2290 mutex_unlock(&kprobe_mutex
);
2292 /* Wait for disarming all kprobes by optimizer */
2293 wait_for_kprobe_optimizer();
2297 * XXX: The debugfs bool file interface doesn't allow for callbacks
2298 * when the bool state is switched. We can reuse that facility when
2301 static ssize_t
read_enabled_file_bool(struct file
*file
,
2302 char __user
*user_buf
, size_t count
, loff_t
*ppos
)
2306 if (!kprobes_all_disarmed
)
2312 return simple_read_from_buffer(user_buf
, count
, ppos
, buf
, 2);
2315 static ssize_t
write_enabled_file_bool(struct file
*file
,
2316 const char __user
*user_buf
, size_t count
, loff_t
*ppos
)
2321 buf_size
= min(count
, (sizeof(buf
)-1));
2322 if (copy_from_user(buf
, user_buf
, buf_size
))
2334 disarm_all_kprobes();
2341 static const struct file_operations fops_kp
= {
2342 .read
= read_enabled_file_bool
,
2343 .write
= write_enabled_file_bool
,
2344 .llseek
= default_llseek
,
2347 static int __kprobes
debugfs_kprobe_init(void)
2349 struct dentry
*dir
, *file
;
2350 unsigned int value
= 1;
2352 dir
= debugfs_create_dir("kprobes", NULL
);
2356 file
= debugfs_create_file("list", 0444, dir
, NULL
,
2357 &debugfs_kprobes_operations
);
2359 debugfs_remove(dir
);
2363 file
= debugfs_create_file("enabled", 0600, dir
,
2366 debugfs_remove(dir
);
2373 late_initcall(debugfs_kprobe_init
);
2374 #endif /* CONFIG_DEBUG_FS */
2376 module_init(init_kprobes
);
2378 /* defined in arch/.../kernel/kprobes.c */
2379 EXPORT_SYMBOL_GPL(jprobe_return
);