Loading...
1// SPDX-License-Identifier: GPL-2.0-or-later
2/*
3 * Kernel Probes (KProbes)
4 *
5 * Copyright (C) IBM Corporation, 2002, 2004
6 *
7 * 2002-Oct Created by Vamsi Krishna S <vamsi_krishna@in.ibm.com> Kernel
8 * Probes initial implementation (includes suggestions from
9 * Rusty Russell).
10 * 2004-Aug Updated by Prasanna S Panchamukhi <prasanna@in.ibm.com> with
11 * hlists and exceptions notifier as suggested by Andi Kleen.
12 * 2004-July Suparna Bhattacharya <suparna@in.ibm.com> added jumper probes
13 * interface to access function arguments.
14 * 2004-Sep Prasanna S Panchamukhi <prasanna@in.ibm.com> Changed Kprobes
15 * exceptions notifier to be first on the priority list.
16 * 2005-May Hien Nguyen <hien@us.ibm.com>, Jim Keniston
17 * <jkenisto@us.ibm.com> and Prasanna S Panchamukhi
18 * <prasanna@in.ibm.com> added function-return probes.
19 */
20
21#define pr_fmt(fmt) "kprobes: " fmt
22
23#include <linux/kprobes.h>
24#include <linux/hash.h>
25#include <linux/init.h>
26#include <linux/slab.h>
27#include <linux/stddef.h>
28#include <linux/export.h>
29#include <linux/moduleloader.h>
30#include <linux/kallsyms.h>
31#include <linux/freezer.h>
32#include <linux/seq_file.h>
33#include <linux/debugfs.h>
34#include <linux/sysctl.h>
35#include <linux/kdebug.h>
36#include <linux/memory.h>
37#include <linux/ftrace.h>
38#include <linux/cpu.h>
39#include <linux/jump_label.h>
40#include <linux/static_call.h>
41#include <linux/perf_event.h>
42
43#include <asm/sections.h>
44#include <asm/cacheflush.h>
45#include <asm/errno.h>
46#include <linux/uaccess.h>
47
48#define KPROBE_HASH_BITS 6
49#define KPROBE_TABLE_SIZE (1 << KPROBE_HASH_BITS)
50
51#if !defined(CONFIG_OPTPROBES) || !defined(CONFIG_SYSCTL)
52#define kprobe_sysctls_init() do { } while (0)
53#endif
54
55static int kprobes_initialized;
56/* kprobe_table can be accessed by
57 * - Normal hlist traversal and RCU add/del under 'kprobe_mutex' is held.
58 * Or
59 * - RCU hlist traversal under disabling preempt (breakpoint handlers)
60 */
61static struct hlist_head kprobe_table[KPROBE_TABLE_SIZE];
62
63/* NOTE: change this value only with 'kprobe_mutex' held */
64static bool kprobes_all_disarmed;
65
66/* This protects 'kprobe_table' and 'optimizing_list' */
67static DEFINE_MUTEX(kprobe_mutex);
68static DEFINE_PER_CPU(struct kprobe *, kprobe_instance);
69
70kprobe_opcode_t * __weak kprobe_lookup_name(const char *name,
71 unsigned int __unused)
72{
73 return ((kprobe_opcode_t *)(kallsyms_lookup_name(name)));
74}
75
76/*
77 * Blacklist -- list of 'struct kprobe_blacklist_entry' to store info where
78 * kprobes can not probe.
79 */
80static LIST_HEAD(kprobe_blacklist);
81
82#ifdef __ARCH_WANT_KPROBES_INSN_SLOT
83/*
84 * 'kprobe::ainsn.insn' points to the copy of the instruction to be
85 * single-stepped. x86_64, POWER4 and above have no-exec support and
86 * stepping on the instruction on a vmalloced/kmalloced/data page
87 * is a recipe for disaster
88 */
89struct kprobe_insn_page {
90 struct list_head list;
91 kprobe_opcode_t *insns; /* Page of instruction slots */
92 struct kprobe_insn_cache *cache;
93 int nused;
94 int ngarbage;
95 char slot_used[];
96};
97
98#define KPROBE_INSN_PAGE_SIZE(slots) \
99 (offsetof(struct kprobe_insn_page, slot_used) + \
100 (sizeof(char) * (slots)))
101
102static int slots_per_page(struct kprobe_insn_cache *c)
103{
104 return PAGE_SIZE/(c->insn_size * sizeof(kprobe_opcode_t));
105}
106
107enum kprobe_slot_state {
108 SLOT_CLEAN = 0,
109 SLOT_DIRTY = 1,
110 SLOT_USED = 2,
111};
112
113void __weak *alloc_insn_page(void)
114{
115 /*
116 * Use module_alloc() so this page is within +/- 2GB of where the
117 * kernel image and loaded module images reside. This is required
118 * for most of the architectures.
119 * (e.g. x86-64 needs this to handle the %rip-relative fixups.)
120 */
121 return module_alloc(PAGE_SIZE);
122}
123
124static void free_insn_page(void *page)
125{
126 module_memfree(page);
127}
128
129struct kprobe_insn_cache kprobe_insn_slots = {
130 .mutex = __MUTEX_INITIALIZER(kprobe_insn_slots.mutex),
131 .alloc = alloc_insn_page,
132 .free = free_insn_page,
133 .sym = KPROBE_INSN_PAGE_SYM,
134 .pages = LIST_HEAD_INIT(kprobe_insn_slots.pages),
135 .insn_size = MAX_INSN_SIZE,
136 .nr_garbage = 0,
137};
138static int collect_garbage_slots(struct kprobe_insn_cache *c);
139
140/**
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.
143 */
144kprobe_opcode_t *__get_insn_slot(struct kprobe_insn_cache *c)
145{
146 struct kprobe_insn_page *kip;
147 kprobe_opcode_t *slot = NULL;
148
149 /* Since the slot array is not protected by rcu, we need a mutex */
150 mutex_lock(&c->mutex);
151 retry:
152 rcu_read_lock();
153 list_for_each_entry_rcu(kip, &c->pages, list) {
154 if (kip->nused < slots_per_page(c)) {
155 int i;
156
157 for (i = 0; i < slots_per_page(c); i++) {
158 if (kip->slot_used[i] == SLOT_CLEAN) {
159 kip->slot_used[i] = SLOT_USED;
160 kip->nused++;
161 slot = kip->insns + (i * c->insn_size);
162 rcu_read_unlock();
163 goto out;
164 }
165 }
166 /* kip->nused is broken. Fix it. */
167 kip->nused = slots_per_page(c);
168 WARN_ON(1);
169 }
170 }
171 rcu_read_unlock();
172
173 /* If there are any garbage slots, collect it and try again. */
174 if (c->nr_garbage && collect_garbage_slots(c) == 0)
175 goto retry;
176
177 /* All out of space. Need to allocate a new page. */
178 kip = kmalloc(KPROBE_INSN_PAGE_SIZE(slots_per_page(c)), GFP_KERNEL);
179 if (!kip)
180 goto out;
181
182 kip->insns = c->alloc();
183 if (!kip->insns) {
184 kfree(kip);
185 goto out;
186 }
187 INIT_LIST_HEAD(&kip->list);
188 memset(kip->slot_used, SLOT_CLEAN, slots_per_page(c));
189 kip->slot_used[0] = SLOT_USED;
190 kip->nused = 1;
191 kip->ngarbage = 0;
192 kip->cache = c;
193 list_add_rcu(&kip->list, &c->pages);
194 slot = kip->insns;
195
196 /* Record the perf ksymbol register event after adding the page */
197 perf_event_ksymbol(PERF_RECORD_KSYMBOL_TYPE_OOL, (unsigned long)kip->insns,
198 PAGE_SIZE, false, c->sym);
199out:
200 mutex_unlock(&c->mutex);
201 return slot;
202}
203
204/* Return true if all garbages are collected, otherwise false. */
205static bool collect_one_slot(struct kprobe_insn_page *kip, int idx)
206{
207 kip->slot_used[idx] = SLOT_CLEAN;
208 kip->nused--;
209 if (kip->nused == 0) {
210 /*
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.
215 */
216 if (!list_is_singular(&kip->list)) {
217 /*
218 * Record perf ksymbol unregister event before removing
219 * the page.
220 */
221 perf_event_ksymbol(PERF_RECORD_KSYMBOL_TYPE_OOL,
222 (unsigned long)kip->insns, PAGE_SIZE, true,
223 kip->cache->sym);
224 list_del_rcu(&kip->list);
225 synchronize_rcu();
226 kip->cache->free(kip->insns);
227 kfree(kip);
228 }
229 return true;
230 }
231 return false;
232}
233
234static int collect_garbage_slots(struct kprobe_insn_cache *c)
235{
236 struct kprobe_insn_page *kip, *next;
237
238 /* Ensure no-one is interrupted on the garbages */
239 synchronize_rcu();
240
241 list_for_each_entry_safe(kip, next, &c->pages, list) {
242 int i;
243
244 if (kip->ngarbage == 0)
245 continue;
246 kip->ngarbage = 0; /* we will collect all garbages */
247 for (i = 0; i < slots_per_page(c); i++) {
248 if (kip->slot_used[i] == SLOT_DIRTY && collect_one_slot(kip, i))
249 break;
250 }
251 }
252 c->nr_garbage = 0;
253 return 0;
254}
255
256void __free_insn_slot(struct kprobe_insn_cache *c,
257 kprobe_opcode_t *slot, int dirty)
258{
259 struct kprobe_insn_page *kip;
260 long idx;
261
262 mutex_lock(&c->mutex);
263 rcu_read_lock();
264 list_for_each_entry_rcu(kip, &c->pages, list) {
265 idx = ((long)slot - (long)kip->insns) /
266 (c->insn_size * sizeof(kprobe_opcode_t));
267 if (idx >= 0 && idx < slots_per_page(c))
268 goto out;
269 }
270 /* Could not find this slot. */
271 WARN_ON(1);
272 kip = NULL;
273out:
274 rcu_read_unlock();
275 /* Mark and sweep: this may sleep */
276 if (kip) {
277 /* Check double free */
278 WARN_ON(kip->slot_used[idx] != SLOT_USED);
279 if (dirty) {
280 kip->slot_used[idx] = SLOT_DIRTY;
281 kip->ngarbage++;
282 if (++c->nr_garbage > slots_per_page(c))
283 collect_garbage_slots(c);
284 } else {
285 collect_one_slot(kip, idx);
286 }
287 }
288 mutex_unlock(&c->mutex);
289}
290
291/*
292 * Check given address is on the page of kprobe instruction slots.
293 * This will be used for checking whether the address on a stack
294 * is on a text area or not.
295 */
296bool __is_insn_slot_addr(struct kprobe_insn_cache *c, unsigned long addr)
297{
298 struct kprobe_insn_page *kip;
299 bool ret = false;
300
301 rcu_read_lock();
302 list_for_each_entry_rcu(kip, &c->pages, list) {
303 if (addr >= (unsigned long)kip->insns &&
304 addr < (unsigned long)kip->insns + PAGE_SIZE) {
305 ret = true;
306 break;
307 }
308 }
309 rcu_read_unlock();
310
311 return ret;
312}
313
314int kprobe_cache_get_kallsym(struct kprobe_insn_cache *c, unsigned int *symnum,
315 unsigned long *value, char *type, char *sym)
316{
317 struct kprobe_insn_page *kip;
318 int ret = -ERANGE;
319
320 rcu_read_lock();
321 list_for_each_entry_rcu(kip, &c->pages, list) {
322 if ((*symnum)--)
323 continue;
324 strscpy(sym, c->sym, KSYM_NAME_LEN);
325 *type = 't';
326 *value = (unsigned long)kip->insns;
327 ret = 0;
328 break;
329 }
330 rcu_read_unlock();
331
332 return ret;
333}
334
335#ifdef CONFIG_OPTPROBES
336void __weak *alloc_optinsn_page(void)
337{
338 return alloc_insn_page();
339}
340
341void __weak free_optinsn_page(void *page)
342{
343 free_insn_page(page);
344}
345
346/* For optimized_kprobe buffer */
347struct kprobe_insn_cache kprobe_optinsn_slots = {
348 .mutex = __MUTEX_INITIALIZER(kprobe_optinsn_slots.mutex),
349 .alloc = alloc_optinsn_page,
350 .free = free_optinsn_page,
351 .sym = KPROBE_OPTINSN_PAGE_SYM,
352 .pages = LIST_HEAD_INIT(kprobe_optinsn_slots.pages),
353 /* .insn_size is initialized later */
354 .nr_garbage = 0,
355};
356#endif
357#endif
358
359/* We have preemption disabled.. so it is safe to use __ versions */
360static inline void set_kprobe_instance(struct kprobe *kp)
361{
362 __this_cpu_write(kprobe_instance, kp);
363}
364
365static inline void reset_kprobe_instance(void)
366{
367 __this_cpu_write(kprobe_instance, NULL);
368}
369
370/*
371 * This routine is called either:
372 * - under the 'kprobe_mutex' - during kprobe_[un]register().
373 * OR
374 * - with preemption disabled - from architecture specific code.
375 */
376struct kprobe *get_kprobe(void *addr)
377{
378 struct hlist_head *head;
379 struct kprobe *p;
380
381 head = &kprobe_table[hash_ptr(addr, KPROBE_HASH_BITS)];
382 hlist_for_each_entry_rcu(p, head, hlist,
383 lockdep_is_held(&kprobe_mutex)) {
384 if (p->addr == addr)
385 return p;
386 }
387
388 return NULL;
389}
390NOKPROBE_SYMBOL(get_kprobe);
391
392static int aggr_pre_handler(struct kprobe *p, struct pt_regs *regs);
393
394/* Return true if 'p' is an aggregator */
395static inline bool kprobe_aggrprobe(struct kprobe *p)
396{
397 return p->pre_handler == aggr_pre_handler;
398}
399
400/* Return true if 'p' is unused */
401static inline bool kprobe_unused(struct kprobe *p)
402{
403 return kprobe_aggrprobe(p) && kprobe_disabled(p) &&
404 list_empty(&p->list);
405}
406
407/* Keep all fields in the kprobe consistent. */
408static inline void copy_kprobe(struct kprobe *ap, struct kprobe *p)
409{
410 memcpy(&p->opcode, &ap->opcode, sizeof(kprobe_opcode_t));
411 memcpy(&p->ainsn, &ap->ainsn, sizeof(struct arch_specific_insn));
412}
413
414#ifdef CONFIG_OPTPROBES
415/* NOTE: This is protected by 'kprobe_mutex'. */
416static bool kprobes_allow_optimization;
417
418/*
419 * Call all 'kprobe::pre_handler' on the list, but ignores its return value.
420 * This must be called from arch-dep optimized caller.
421 */
422void opt_pre_handler(struct kprobe *p, struct pt_regs *regs)
423{
424 struct kprobe *kp;
425
426 list_for_each_entry_rcu(kp, &p->list, list) {
427 if (kp->pre_handler && likely(!kprobe_disabled(kp))) {
428 set_kprobe_instance(kp);
429 kp->pre_handler(kp, regs);
430 }
431 reset_kprobe_instance();
432 }
433}
434NOKPROBE_SYMBOL(opt_pre_handler);
435
436/* Free optimized instructions and optimized_kprobe */
437static void free_aggr_kprobe(struct kprobe *p)
438{
439 struct optimized_kprobe *op;
440
441 op = container_of(p, struct optimized_kprobe, kp);
442 arch_remove_optimized_kprobe(op);
443 arch_remove_kprobe(p);
444 kfree(op);
445}
446
447/* Return true if the kprobe is ready for optimization. */
448static inline int kprobe_optready(struct kprobe *p)
449{
450 struct optimized_kprobe *op;
451
452 if (kprobe_aggrprobe(p)) {
453 op = container_of(p, struct optimized_kprobe, kp);
454 return arch_prepared_optinsn(&op->optinsn);
455 }
456
457 return 0;
458}
459
460/* Return true if the kprobe is disarmed. Note: p must be on hash list */
461static inline bool kprobe_disarmed(struct kprobe *p)
462{
463 struct optimized_kprobe *op;
464
465 /* If kprobe is not aggr/opt probe, just return kprobe is disabled */
466 if (!kprobe_aggrprobe(p))
467 return kprobe_disabled(p);
468
469 op = container_of(p, struct optimized_kprobe, kp);
470
471 return kprobe_disabled(p) && list_empty(&op->list);
472}
473
474/* Return true if the probe is queued on (un)optimizing lists */
475static bool kprobe_queued(struct kprobe *p)
476{
477 struct optimized_kprobe *op;
478
479 if (kprobe_aggrprobe(p)) {
480 op = container_of(p, struct optimized_kprobe, kp);
481 if (!list_empty(&op->list))
482 return true;
483 }
484 return false;
485}
486
487/*
488 * Return an optimized kprobe whose optimizing code replaces
489 * instructions including 'addr' (exclude breakpoint).
490 */
491static struct kprobe *get_optimized_kprobe(kprobe_opcode_t *addr)
492{
493 int i;
494 struct kprobe *p = NULL;
495 struct optimized_kprobe *op;
496
497 /* Don't check i == 0, since that is a breakpoint case. */
498 for (i = 1; !p && i < MAX_OPTIMIZED_LENGTH / sizeof(kprobe_opcode_t); i++)
499 p = get_kprobe(addr - i);
500
501 if (p && kprobe_optready(p)) {
502 op = container_of(p, struct optimized_kprobe, kp);
503 if (arch_within_optimized_kprobe(op, addr))
504 return p;
505 }
506
507 return NULL;
508}
509
510/* Optimization staging list, protected by 'kprobe_mutex' */
511static LIST_HEAD(optimizing_list);
512static LIST_HEAD(unoptimizing_list);
513static LIST_HEAD(freeing_list);
514
515static void kprobe_optimizer(struct work_struct *work);
516static DECLARE_DELAYED_WORK(optimizing_work, kprobe_optimizer);
517#define OPTIMIZE_DELAY 5
518
519/*
520 * Optimize (replace a breakpoint with a jump) kprobes listed on
521 * 'optimizing_list'.
522 */
523static void do_optimize_kprobes(void)
524{
525 lockdep_assert_held(&text_mutex);
526 /*
527 * The optimization/unoptimization refers 'online_cpus' via
528 * stop_machine() and cpu-hotplug modifies the 'online_cpus'.
529 * And same time, 'text_mutex' will be held in cpu-hotplug and here.
530 * This combination can cause a deadlock (cpu-hotplug tries to lock
531 * 'text_mutex' but stop_machine() can not be done because
532 * the 'online_cpus' has been changed)
533 * To avoid this deadlock, caller must have locked cpu-hotplug
534 * for preventing cpu-hotplug outside of 'text_mutex' locking.
535 */
536 lockdep_assert_cpus_held();
537
538 /* Optimization never be done when disarmed */
539 if (kprobes_all_disarmed || !kprobes_allow_optimization ||
540 list_empty(&optimizing_list))
541 return;
542
543 arch_optimize_kprobes(&optimizing_list);
544}
545
546/*
547 * Unoptimize (replace a jump with a breakpoint and remove the breakpoint
548 * if need) kprobes listed on 'unoptimizing_list'.
549 */
550static void do_unoptimize_kprobes(void)
551{
552 struct optimized_kprobe *op, *tmp;
553
554 lockdep_assert_held(&text_mutex);
555 /* See comment in do_optimize_kprobes() */
556 lockdep_assert_cpus_held();
557
558 /* Unoptimization must be done anytime */
559 if (list_empty(&unoptimizing_list))
560 return;
561
562 arch_unoptimize_kprobes(&unoptimizing_list, &freeing_list);
563 /* Loop on 'freeing_list' for disarming */
564 list_for_each_entry_safe(op, tmp, &freeing_list, list) {
565 /* Switching from detour code to origin */
566 op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
567 /* Disarm probes if marked disabled */
568 if (kprobe_disabled(&op->kp))
569 arch_disarm_kprobe(&op->kp);
570 if (kprobe_unused(&op->kp)) {
571 /*
572 * Remove unused probes from hash list. After waiting
573 * for synchronization, these probes are reclaimed.
574 * (reclaiming is done by do_free_cleaned_kprobes().)
575 */
576 hlist_del_rcu(&op->kp.hlist);
577 } else
578 list_del_init(&op->list);
579 }
580}
581
582/* Reclaim all kprobes on the 'freeing_list' */
583static void do_free_cleaned_kprobes(void)
584{
585 struct optimized_kprobe *op, *tmp;
586
587 list_for_each_entry_safe(op, tmp, &freeing_list, list) {
588 list_del_init(&op->list);
589 if (WARN_ON_ONCE(!kprobe_unused(&op->kp))) {
590 /*
591 * This must not happen, but if there is a kprobe
592 * still in use, keep it on kprobes hash list.
593 */
594 continue;
595 }
596 free_aggr_kprobe(&op->kp);
597 }
598}
599
600/* Start optimizer after OPTIMIZE_DELAY passed */
601static void kick_kprobe_optimizer(void)
602{
603 schedule_delayed_work(&optimizing_work, OPTIMIZE_DELAY);
604}
605
606/* Kprobe jump optimizer */
607static void kprobe_optimizer(struct work_struct *work)
608{
609 mutex_lock(&kprobe_mutex);
610 cpus_read_lock();
611 mutex_lock(&text_mutex);
612
613 /*
614 * Step 1: Unoptimize kprobes and collect cleaned (unused and disarmed)
615 * kprobes before waiting for quiesence period.
616 */
617 do_unoptimize_kprobes();
618
619 /*
620 * Step 2: Wait for quiesence period to ensure all potentially
621 * preempted tasks to have normally scheduled. Because optprobe
622 * may modify multiple instructions, there is a chance that Nth
623 * instruction is preempted. In that case, such tasks can return
624 * to 2nd-Nth byte of jump instruction. This wait is for avoiding it.
625 * Note that on non-preemptive kernel, this is transparently converted
626 * to synchronoze_sched() to wait for all interrupts to have completed.
627 */
628 synchronize_rcu_tasks();
629
630 /* Step 3: Optimize kprobes after quiesence period */
631 do_optimize_kprobes();
632
633 /* Step 4: Free cleaned kprobes after quiesence period */
634 do_free_cleaned_kprobes();
635
636 mutex_unlock(&text_mutex);
637 cpus_read_unlock();
638
639 /* Step 5: Kick optimizer again if needed */
640 if (!list_empty(&optimizing_list) || !list_empty(&unoptimizing_list))
641 kick_kprobe_optimizer();
642
643 mutex_unlock(&kprobe_mutex);
644}
645
646/* Wait for completing optimization and unoptimization */
647void wait_for_kprobe_optimizer(void)
648{
649 mutex_lock(&kprobe_mutex);
650
651 while (!list_empty(&optimizing_list) || !list_empty(&unoptimizing_list)) {
652 mutex_unlock(&kprobe_mutex);
653
654 /* This will also make 'optimizing_work' execute immmediately */
655 flush_delayed_work(&optimizing_work);
656 /* 'optimizing_work' might not have been queued yet, relax */
657 cpu_relax();
658
659 mutex_lock(&kprobe_mutex);
660 }
661
662 mutex_unlock(&kprobe_mutex);
663}
664
665static bool optprobe_queued_unopt(struct optimized_kprobe *op)
666{
667 struct optimized_kprobe *_op;
668
669 list_for_each_entry(_op, &unoptimizing_list, list) {
670 if (op == _op)
671 return true;
672 }
673
674 return false;
675}
676
677/* Optimize kprobe if p is ready to be optimized */
678static void optimize_kprobe(struct kprobe *p)
679{
680 struct optimized_kprobe *op;
681
682 /* Check if the kprobe is disabled or not ready for optimization. */
683 if (!kprobe_optready(p) || !kprobes_allow_optimization ||
684 (kprobe_disabled(p) || kprobes_all_disarmed))
685 return;
686
687 /* kprobes with 'post_handler' can not be optimized */
688 if (p->post_handler)
689 return;
690
691 op = container_of(p, struct optimized_kprobe, kp);
692
693 /* Check there is no other kprobes at the optimized instructions */
694 if (arch_check_optimized_kprobe(op) < 0)
695 return;
696
697 /* Check if it is already optimized. */
698 if (op->kp.flags & KPROBE_FLAG_OPTIMIZED) {
699 if (optprobe_queued_unopt(op)) {
700 /* This is under unoptimizing. Just dequeue the probe */
701 list_del_init(&op->list);
702 }
703 return;
704 }
705 op->kp.flags |= KPROBE_FLAG_OPTIMIZED;
706
707 /*
708 * On the 'unoptimizing_list' and 'optimizing_list',
709 * 'op' must have OPTIMIZED flag
710 */
711 if (WARN_ON_ONCE(!list_empty(&op->list)))
712 return;
713
714 list_add(&op->list, &optimizing_list);
715 kick_kprobe_optimizer();
716}
717
718/* Short cut to direct unoptimizing */
719static void force_unoptimize_kprobe(struct optimized_kprobe *op)
720{
721 lockdep_assert_cpus_held();
722 arch_unoptimize_kprobe(op);
723 op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
724}
725
726/* Unoptimize a kprobe if p is optimized */
727static void unoptimize_kprobe(struct kprobe *p, bool force)
728{
729 struct optimized_kprobe *op;
730
731 if (!kprobe_aggrprobe(p) || kprobe_disarmed(p))
732 return; /* This is not an optprobe nor optimized */
733
734 op = container_of(p, struct optimized_kprobe, kp);
735 if (!kprobe_optimized(p))
736 return;
737
738 if (!list_empty(&op->list)) {
739 if (optprobe_queued_unopt(op)) {
740 /* Queued in unoptimizing queue */
741 if (force) {
742 /*
743 * Forcibly unoptimize the kprobe here, and queue it
744 * in the freeing list for release afterwards.
745 */
746 force_unoptimize_kprobe(op);
747 list_move(&op->list, &freeing_list);
748 }
749 } else {
750 /* Dequeue from the optimizing queue */
751 list_del_init(&op->list);
752 op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
753 }
754 return;
755 }
756
757 /* Optimized kprobe case */
758 if (force) {
759 /* Forcibly update the code: this is a special case */
760 force_unoptimize_kprobe(op);
761 } else {
762 list_add(&op->list, &unoptimizing_list);
763 kick_kprobe_optimizer();
764 }
765}
766
767/* Cancel unoptimizing for reusing */
768static int reuse_unused_kprobe(struct kprobe *ap)
769{
770 struct optimized_kprobe *op;
771
772 /*
773 * Unused kprobe MUST be on the way of delayed unoptimizing (means
774 * there is still a relative jump) and disabled.
775 */
776 op = container_of(ap, struct optimized_kprobe, kp);
777 WARN_ON_ONCE(list_empty(&op->list));
778 /* Enable the probe again */
779 ap->flags &= ~KPROBE_FLAG_DISABLED;
780 /* Optimize it again. (remove from 'op->list') */
781 if (!kprobe_optready(ap))
782 return -EINVAL;
783
784 optimize_kprobe(ap);
785 return 0;
786}
787
788/* Remove optimized instructions */
789static void kill_optimized_kprobe(struct kprobe *p)
790{
791 struct optimized_kprobe *op;
792
793 op = container_of(p, struct optimized_kprobe, kp);
794 if (!list_empty(&op->list))
795 /* Dequeue from the (un)optimization queue */
796 list_del_init(&op->list);
797 op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
798
799 if (kprobe_unused(p)) {
800 /* Enqueue if it is unused */
801 list_add(&op->list, &freeing_list);
802 /*
803 * Remove unused probes from the hash list. After waiting
804 * for synchronization, this probe is reclaimed.
805 * (reclaiming is done by do_free_cleaned_kprobes().)
806 */
807 hlist_del_rcu(&op->kp.hlist);
808 }
809
810 /* Don't touch the code, because it is already freed. */
811 arch_remove_optimized_kprobe(op);
812}
813
814static inline
815void __prepare_optimized_kprobe(struct optimized_kprobe *op, struct kprobe *p)
816{
817 if (!kprobe_ftrace(p))
818 arch_prepare_optimized_kprobe(op, p);
819}
820
821/* Try to prepare optimized instructions */
822static void prepare_optimized_kprobe(struct kprobe *p)
823{
824 struct optimized_kprobe *op;
825
826 op = container_of(p, struct optimized_kprobe, kp);
827 __prepare_optimized_kprobe(op, p);
828}
829
830/* Allocate new optimized_kprobe and try to prepare optimized instructions. */
831static struct kprobe *alloc_aggr_kprobe(struct kprobe *p)
832{
833 struct optimized_kprobe *op;
834
835 op = kzalloc(sizeof(struct optimized_kprobe), GFP_KERNEL);
836 if (!op)
837 return NULL;
838
839 INIT_LIST_HEAD(&op->list);
840 op->kp.addr = p->addr;
841 __prepare_optimized_kprobe(op, p);
842
843 return &op->kp;
844}
845
846static void init_aggr_kprobe(struct kprobe *ap, struct kprobe *p);
847
848/*
849 * Prepare an optimized_kprobe and optimize it.
850 * NOTE: 'p' must be a normal registered kprobe.
851 */
852static void try_to_optimize_kprobe(struct kprobe *p)
853{
854 struct kprobe *ap;
855 struct optimized_kprobe *op;
856
857 /* Impossible to optimize ftrace-based kprobe. */
858 if (kprobe_ftrace(p))
859 return;
860
861 /* For preparing optimization, jump_label_text_reserved() is called. */
862 cpus_read_lock();
863 jump_label_lock();
864 mutex_lock(&text_mutex);
865
866 ap = alloc_aggr_kprobe(p);
867 if (!ap)
868 goto out;
869
870 op = container_of(ap, struct optimized_kprobe, kp);
871 if (!arch_prepared_optinsn(&op->optinsn)) {
872 /* If failed to setup optimizing, fallback to kprobe. */
873 arch_remove_optimized_kprobe(op);
874 kfree(op);
875 goto out;
876 }
877
878 init_aggr_kprobe(ap, p);
879 optimize_kprobe(ap); /* This just kicks optimizer thread. */
880
881out:
882 mutex_unlock(&text_mutex);
883 jump_label_unlock();
884 cpus_read_unlock();
885}
886
887static void optimize_all_kprobes(void)
888{
889 struct hlist_head *head;
890 struct kprobe *p;
891 unsigned int i;
892
893 mutex_lock(&kprobe_mutex);
894 /* If optimization is already allowed, just return. */
895 if (kprobes_allow_optimization)
896 goto out;
897
898 cpus_read_lock();
899 kprobes_allow_optimization = true;
900 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
901 head = &kprobe_table[i];
902 hlist_for_each_entry(p, head, hlist)
903 if (!kprobe_disabled(p))
904 optimize_kprobe(p);
905 }
906 cpus_read_unlock();
907 pr_info("kprobe jump-optimization is enabled. All kprobes are optimized if possible.\n");
908out:
909 mutex_unlock(&kprobe_mutex);
910}
911
912#ifdef CONFIG_SYSCTL
913static void unoptimize_all_kprobes(void)
914{
915 struct hlist_head *head;
916 struct kprobe *p;
917 unsigned int i;
918
919 mutex_lock(&kprobe_mutex);
920 /* If optimization is already prohibited, just return. */
921 if (!kprobes_allow_optimization) {
922 mutex_unlock(&kprobe_mutex);
923 return;
924 }
925
926 cpus_read_lock();
927 kprobes_allow_optimization = false;
928 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
929 head = &kprobe_table[i];
930 hlist_for_each_entry(p, head, hlist) {
931 if (!kprobe_disabled(p))
932 unoptimize_kprobe(p, false);
933 }
934 }
935 cpus_read_unlock();
936 mutex_unlock(&kprobe_mutex);
937
938 /* Wait for unoptimizing completion. */
939 wait_for_kprobe_optimizer();
940 pr_info("kprobe jump-optimization is disabled. All kprobes are based on software breakpoint.\n");
941}
942
943static DEFINE_MUTEX(kprobe_sysctl_mutex);
944static int sysctl_kprobes_optimization;
945static int proc_kprobes_optimization_handler(struct ctl_table *table,
946 int write, void *buffer,
947 size_t *length, loff_t *ppos)
948{
949 int ret;
950
951 mutex_lock(&kprobe_sysctl_mutex);
952 sysctl_kprobes_optimization = kprobes_allow_optimization ? 1 : 0;
953 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
954
955 if (sysctl_kprobes_optimization)
956 optimize_all_kprobes();
957 else
958 unoptimize_all_kprobes();
959 mutex_unlock(&kprobe_sysctl_mutex);
960
961 return ret;
962}
963
964static struct ctl_table kprobe_sysctls[] = {
965 {
966 .procname = "kprobes-optimization",
967 .data = &sysctl_kprobes_optimization,
968 .maxlen = sizeof(int),
969 .mode = 0644,
970 .proc_handler = proc_kprobes_optimization_handler,
971 .extra1 = SYSCTL_ZERO,
972 .extra2 = SYSCTL_ONE,
973 },
974 {}
975};
976
977static void __init kprobe_sysctls_init(void)
978{
979 register_sysctl_init("debug", kprobe_sysctls);
980}
981#endif /* CONFIG_SYSCTL */
982
983/* Put a breakpoint for a probe. */
984static void __arm_kprobe(struct kprobe *p)
985{
986 struct kprobe *_p;
987
988 lockdep_assert_held(&text_mutex);
989
990 /* Find the overlapping optimized kprobes. */
991 _p = get_optimized_kprobe(p->addr);
992 if (unlikely(_p))
993 /* Fallback to unoptimized kprobe */
994 unoptimize_kprobe(_p, true);
995
996 arch_arm_kprobe(p);
997 optimize_kprobe(p); /* Try to optimize (add kprobe to a list) */
998}
999
1000/* Remove the breakpoint of a probe. */
1001static void __disarm_kprobe(struct kprobe *p, bool reopt)
1002{
1003 struct kprobe *_p;
1004
1005 lockdep_assert_held(&text_mutex);
1006
1007 /* Try to unoptimize */
1008 unoptimize_kprobe(p, kprobes_all_disarmed);
1009
1010 if (!kprobe_queued(p)) {
1011 arch_disarm_kprobe(p);
1012 /* If another kprobe was blocked, re-optimize it. */
1013 _p = get_optimized_kprobe(p->addr);
1014 if (unlikely(_p) && reopt)
1015 optimize_kprobe(_p);
1016 }
1017 /*
1018 * TODO: Since unoptimization and real disarming will be done by
1019 * the worker thread, we can not check whether another probe are
1020 * unoptimized because of this probe here. It should be re-optimized
1021 * by the worker thread.
1022 */
1023}
1024
1025#else /* !CONFIG_OPTPROBES */
1026
1027#define optimize_kprobe(p) do {} while (0)
1028#define unoptimize_kprobe(p, f) do {} while (0)
1029#define kill_optimized_kprobe(p) do {} while (0)
1030#define prepare_optimized_kprobe(p) do {} while (0)
1031#define try_to_optimize_kprobe(p) do {} while (0)
1032#define __arm_kprobe(p) arch_arm_kprobe(p)
1033#define __disarm_kprobe(p, o) arch_disarm_kprobe(p)
1034#define kprobe_disarmed(p) kprobe_disabled(p)
1035#define wait_for_kprobe_optimizer() do {} while (0)
1036
1037static int reuse_unused_kprobe(struct kprobe *ap)
1038{
1039 /*
1040 * If the optimized kprobe is NOT supported, the aggr kprobe is
1041 * released at the same time that the last aggregated kprobe is
1042 * unregistered.
1043 * Thus there should be no chance to reuse unused kprobe.
1044 */
1045 WARN_ON_ONCE(1);
1046 return -EINVAL;
1047}
1048
1049static void free_aggr_kprobe(struct kprobe *p)
1050{
1051 arch_remove_kprobe(p);
1052 kfree(p);
1053}
1054
1055static struct kprobe *alloc_aggr_kprobe(struct kprobe *p)
1056{
1057 return kzalloc(sizeof(struct kprobe), GFP_KERNEL);
1058}
1059#endif /* CONFIG_OPTPROBES */
1060
1061#ifdef CONFIG_KPROBES_ON_FTRACE
1062static struct ftrace_ops kprobe_ftrace_ops __read_mostly = {
1063 .func = kprobe_ftrace_handler,
1064 .flags = FTRACE_OPS_FL_SAVE_REGS,
1065};
1066
1067static struct ftrace_ops kprobe_ipmodify_ops __read_mostly = {
1068 .func = kprobe_ftrace_handler,
1069 .flags = FTRACE_OPS_FL_SAVE_REGS | FTRACE_OPS_FL_IPMODIFY,
1070};
1071
1072static int kprobe_ipmodify_enabled;
1073static int kprobe_ftrace_enabled;
1074
1075static int __arm_kprobe_ftrace(struct kprobe *p, struct ftrace_ops *ops,
1076 int *cnt)
1077{
1078 int ret = 0;
1079
1080 lockdep_assert_held(&kprobe_mutex);
1081
1082 ret = ftrace_set_filter_ip(ops, (unsigned long)p->addr, 0, 0);
1083 if (WARN_ONCE(ret < 0, "Failed to arm kprobe-ftrace at %pS (error %d)\n", p->addr, ret))
1084 return ret;
1085
1086 if (*cnt == 0) {
1087 ret = register_ftrace_function(ops);
1088 if (WARN(ret < 0, "Failed to register kprobe-ftrace (error %d)\n", ret))
1089 goto err_ftrace;
1090 }
1091
1092 (*cnt)++;
1093 return ret;
1094
1095err_ftrace:
1096 /*
1097 * At this point, sinec ops is not registered, we should be sefe from
1098 * registering empty filter.
1099 */
1100 ftrace_set_filter_ip(ops, (unsigned long)p->addr, 1, 0);
1101 return ret;
1102}
1103
1104static int arm_kprobe_ftrace(struct kprobe *p)
1105{
1106 bool ipmodify = (p->post_handler != NULL);
1107
1108 return __arm_kprobe_ftrace(p,
1109 ipmodify ? &kprobe_ipmodify_ops : &kprobe_ftrace_ops,
1110 ipmodify ? &kprobe_ipmodify_enabled : &kprobe_ftrace_enabled);
1111}
1112
1113static int __disarm_kprobe_ftrace(struct kprobe *p, struct ftrace_ops *ops,
1114 int *cnt)
1115{
1116 int ret = 0;
1117
1118 lockdep_assert_held(&kprobe_mutex);
1119
1120 if (*cnt == 1) {
1121 ret = unregister_ftrace_function(ops);
1122 if (WARN(ret < 0, "Failed to unregister kprobe-ftrace (error %d)\n", ret))
1123 return ret;
1124 }
1125
1126 (*cnt)--;
1127
1128 ret = ftrace_set_filter_ip(ops, (unsigned long)p->addr, 1, 0);
1129 WARN_ONCE(ret < 0, "Failed to disarm kprobe-ftrace at %pS (error %d)\n",
1130 p->addr, ret);
1131 return ret;
1132}
1133
1134static int disarm_kprobe_ftrace(struct kprobe *p)
1135{
1136 bool ipmodify = (p->post_handler != NULL);
1137
1138 return __disarm_kprobe_ftrace(p,
1139 ipmodify ? &kprobe_ipmodify_ops : &kprobe_ftrace_ops,
1140 ipmodify ? &kprobe_ipmodify_enabled : &kprobe_ftrace_enabled);
1141}
1142#else /* !CONFIG_KPROBES_ON_FTRACE */
1143static inline int arm_kprobe_ftrace(struct kprobe *p)
1144{
1145 return -ENODEV;
1146}
1147
1148static inline int disarm_kprobe_ftrace(struct kprobe *p)
1149{
1150 return -ENODEV;
1151}
1152#endif
1153
1154static int prepare_kprobe(struct kprobe *p)
1155{
1156 /* Must ensure p->addr is really on ftrace */
1157 if (kprobe_ftrace(p))
1158 return arch_prepare_kprobe_ftrace(p);
1159
1160 return arch_prepare_kprobe(p);
1161}
1162
1163static int arm_kprobe(struct kprobe *kp)
1164{
1165 if (unlikely(kprobe_ftrace(kp)))
1166 return arm_kprobe_ftrace(kp);
1167
1168 cpus_read_lock();
1169 mutex_lock(&text_mutex);
1170 __arm_kprobe(kp);
1171 mutex_unlock(&text_mutex);
1172 cpus_read_unlock();
1173
1174 return 0;
1175}
1176
1177static int disarm_kprobe(struct kprobe *kp, bool reopt)
1178{
1179 if (unlikely(kprobe_ftrace(kp)))
1180 return disarm_kprobe_ftrace(kp);
1181
1182 cpus_read_lock();
1183 mutex_lock(&text_mutex);
1184 __disarm_kprobe(kp, reopt);
1185 mutex_unlock(&text_mutex);
1186 cpus_read_unlock();
1187
1188 return 0;
1189}
1190
1191/*
1192 * Aggregate handlers for multiple kprobes support - these handlers
1193 * take care of invoking the individual kprobe handlers on p->list
1194 */
1195static int aggr_pre_handler(struct kprobe *p, struct pt_regs *regs)
1196{
1197 struct kprobe *kp;
1198
1199 list_for_each_entry_rcu(kp, &p->list, list) {
1200 if (kp->pre_handler && likely(!kprobe_disabled(kp))) {
1201 set_kprobe_instance(kp);
1202 if (kp->pre_handler(kp, regs))
1203 return 1;
1204 }
1205 reset_kprobe_instance();
1206 }
1207 return 0;
1208}
1209NOKPROBE_SYMBOL(aggr_pre_handler);
1210
1211static void aggr_post_handler(struct kprobe *p, struct pt_regs *regs,
1212 unsigned long flags)
1213{
1214 struct kprobe *kp;
1215
1216 list_for_each_entry_rcu(kp, &p->list, list) {
1217 if (kp->post_handler && likely(!kprobe_disabled(kp))) {
1218 set_kprobe_instance(kp);
1219 kp->post_handler(kp, regs, flags);
1220 reset_kprobe_instance();
1221 }
1222 }
1223}
1224NOKPROBE_SYMBOL(aggr_post_handler);
1225
1226/* Walks the list and increments 'nmissed' if 'p' has child probes. */
1227void kprobes_inc_nmissed_count(struct kprobe *p)
1228{
1229 struct kprobe *kp;
1230
1231 if (!kprobe_aggrprobe(p)) {
1232 p->nmissed++;
1233 } else {
1234 list_for_each_entry_rcu(kp, &p->list, list)
1235 kp->nmissed++;
1236 }
1237}
1238NOKPROBE_SYMBOL(kprobes_inc_nmissed_count);
1239
1240static struct kprobe kprobe_busy = {
1241 .addr = (void *) get_kprobe,
1242};
1243
1244void kprobe_busy_begin(void)
1245{
1246 struct kprobe_ctlblk *kcb;
1247
1248 preempt_disable();
1249 __this_cpu_write(current_kprobe, &kprobe_busy);
1250 kcb = get_kprobe_ctlblk();
1251 kcb->kprobe_status = KPROBE_HIT_ACTIVE;
1252}
1253
1254void kprobe_busy_end(void)
1255{
1256 __this_cpu_write(current_kprobe, NULL);
1257 preempt_enable();
1258}
1259
1260/* Add the new probe to 'ap->list'. */
1261static int add_new_kprobe(struct kprobe *ap, struct kprobe *p)
1262{
1263 if (p->post_handler)
1264 unoptimize_kprobe(ap, true); /* Fall back to normal kprobe */
1265
1266 list_add_rcu(&p->list, &ap->list);
1267 if (p->post_handler && !ap->post_handler)
1268 ap->post_handler = aggr_post_handler;
1269
1270 return 0;
1271}
1272
1273/*
1274 * Fill in the required fields of the aggregator kprobe. Replace the
1275 * earlier kprobe in the hlist with the aggregator kprobe.
1276 */
1277static void init_aggr_kprobe(struct kprobe *ap, struct kprobe *p)
1278{
1279 /* Copy the insn slot of 'p' to 'ap'. */
1280 copy_kprobe(p, ap);
1281 flush_insn_slot(ap);
1282 ap->addr = p->addr;
1283 ap->flags = p->flags & ~KPROBE_FLAG_OPTIMIZED;
1284 ap->pre_handler = aggr_pre_handler;
1285 /* We don't care the kprobe which has gone. */
1286 if (p->post_handler && !kprobe_gone(p))
1287 ap->post_handler = aggr_post_handler;
1288
1289 INIT_LIST_HEAD(&ap->list);
1290 INIT_HLIST_NODE(&ap->hlist);
1291
1292 list_add_rcu(&p->list, &ap->list);
1293 hlist_replace_rcu(&p->hlist, &ap->hlist);
1294}
1295
1296/*
1297 * This registers the second or subsequent kprobe at the same address.
1298 */
1299static int register_aggr_kprobe(struct kprobe *orig_p, struct kprobe *p)
1300{
1301 int ret = 0;
1302 struct kprobe *ap = orig_p;
1303
1304 cpus_read_lock();
1305
1306 /* For preparing optimization, jump_label_text_reserved() is called */
1307 jump_label_lock();
1308 mutex_lock(&text_mutex);
1309
1310 if (!kprobe_aggrprobe(orig_p)) {
1311 /* If 'orig_p' is not an 'aggr_kprobe', create new one. */
1312 ap = alloc_aggr_kprobe(orig_p);
1313 if (!ap) {
1314 ret = -ENOMEM;
1315 goto out;
1316 }
1317 init_aggr_kprobe(ap, orig_p);
1318 } else if (kprobe_unused(ap)) {
1319 /* This probe is going to die. Rescue it */
1320 ret = reuse_unused_kprobe(ap);
1321 if (ret)
1322 goto out;
1323 }
1324
1325 if (kprobe_gone(ap)) {
1326 /*
1327 * Attempting to insert new probe at the same location that
1328 * had a probe in the module vaddr area which already
1329 * freed. So, the instruction slot has already been
1330 * released. We need a new slot for the new probe.
1331 */
1332 ret = arch_prepare_kprobe(ap);
1333 if (ret)
1334 /*
1335 * Even if fail to allocate new slot, don't need to
1336 * free the 'ap'. It will be used next time, or
1337 * freed by unregister_kprobe().
1338 */
1339 goto out;
1340
1341 /* Prepare optimized instructions if possible. */
1342 prepare_optimized_kprobe(ap);
1343
1344 /*
1345 * Clear gone flag to prevent allocating new slot again, and
1346 * set disabled flag because it is not armed yet.
1347 */
1348 ap->flags = (ap->flags & ~KPROBE_FLAG_GONE)
1349 | KPROBE_FLAG_DISABLED;
1350 }
1351
1352 /* Copy the insn slot of 'p' to 'ap'. */
1353 copy_kprobe(ap, p);
1354 ret = add_new_kprobe(ap, p);
1355
1356out:
1357 mutex_unlock(&text_mutex);
1358 jump_label_unlock();
1359 cpus_read_unlock();
1360
1361 if (ret == 0 && kprobe_disabled(ap) && !kprobe_disabled(p)) {
1362 ap->flags &= ~KPROBE_FLAG_DISABLED;
1363 if (!kprobes_all_disarmed) {
1364 /* Arm the breakpoint again. */
1365 ret = arm_kprobe(ap);
1366 if (ret) {
1367 ap->flags |= KPROBE_FLAG_DISABLED;
1368 list_del_rcu(&p->list);
1369 synchronize_rcu();
1370 }
1371 }
1372 }
1373 return ret;
1374}
1375
1376bool __weak arch_within_kprobe_blacklist(unsigned long addr)
1377{
1378 /* The '__kprobes' functions and entry code must not be probed. */
1379 return addr >= (unsigned long)__kprobes_text_start &&
1380 addr < (unsigned long)__kprobes_text_end;
1381}
1382
1383static bool __within_kprobe_blacklist(unsigned long addr)
1384{
1385 struct kprobe_blacklist_entry *ent;
1386
1387 if (arch_within_kprobe_blacklist(addr))
1388 return true;
1389 /*
1390 * If 'kprobe_blacklist' is defined, check the address and
1391 * reject any probe registration in the prohibited area.
1392 */
1393 list_for_each_entry(ent, &kprobe_blacklist, list) {
1394 if (addr >= ent->start_addr && addr < ent->end_addr)
1395 return true;
1396 }
1397 return false;
1398}
1399
1400bool within_kprobe_blacklist(unsigned long addr)
1401{
1402 char symname[KSYM_NAME_LEN], *p;
1403
1404 if (__within_kprobe_blacklist(addr))
1405 return true;
1406
1407 /* Check if the address is on a suffixed-symbol */
1408 if (!lookup_symbol_name(addr, symname)) {
1409 p = strchr(symname, '.');
1410 if (!p)
1411 return false;
1412 *p = '\0';
1413 addr = (unsigned long)kprobe_lookup_name(symname, 0);
1414 if (addr)
1415 return __within_kprobe_blacklist(addr);
1416 }
1417 return false;
1418}
1419
1420/*
1421 * arch_adjust_kprobe_addr - adjust the address
1422 * @addr: symbol base address
1423 * @offset: offset within the symbol
1424 * @on_func_entry: was this @addr+@offset on the function entry
1425 *
1426 * Typically returns @addr + @offset, except for special cases where the
1427 * function might be prefixed by a CFI landing pad, in that case any offset
1428 * inside the landing pad is mapped to the first 'real' instruction of the
1429 * symbol.
1430 *
1431 * Specifically, for things like IBT/BTI, skip the resp. ENDBR/BTI.C
1432 * instruction at +0.
1433 */
1434kprobe_opcode_t *__weak arch_adjust_kprobe_addr(unsigned long addr,
1435 unsigned long offset,
1436 bool *on_func_entry)
1437{
1438 *on_func_entry = !offset;
1439 return (kprobe_opcode_t *)(addr + offset);
1440}
1441
1442/*
1443 * If 'symbol_name' is specified, look it up and add the 'offset'
1444 * to it. This way, we can specify a relative address to a symbol.
1445 * This returns encoded errors if it fails to look up symbol or invalid
1446 * combination of parameters.
1447 */
1448static kprobe_opcode_t *
1449_kprobe_addr(kprobe_opcode_t *addr, const char *symbol_name,
1450 unsigned long offset, bool *on_func_entry)
1451{
1452 if ((symbol_name && addr) || (!symbol_name && !addr))
1453 goto invalid;
1454
1455 if (symbol_name) {
1456 /*
1457 * Input: @sym + @offset
1458 * Output: @addr + @offset
1459 *
1460 * NOTE: kprobe_lookup_name() does *NOT* fold the offset
1461 * argument into it's output!
1462 */
1463 addr = kprobe_lookup_name(symbol_name, offset);
1464 if (!addr)
1465 return ERR_PTR(-ENOENT);
1466 }
1467
1468 /*
1469 * So here we have @addr + @offset, displace it into a new
1470 * @addr' + @offset' where @addr' is the symbol start address.
1471 */
1472 addr = (void *)addr + offset;
1473 if (!kallsyms_lookup_size_offset((unsigned long)addr, NULL, &offset))
1474 return ERR_PTR(-ENOENT);
1475 addr = (void *)addr - offset;
1476
1477 /*
1478 * Then ask the architecture to re-combine them, taking care of
1479 * magical function entry details while telling us if this was indeed
1480 * at the start of the function.
1481 */
1482 addr = arch_adjust_kprobe_addr((unsigned long)addr, offset, on_func_entry);
1483 if (addr)
1484 return addr;
1485
1486invalid:
1487 return ERR_PTR(-EINVAL);
1488}
1489
1490static kprobe_opcode_t *kprobe_addr(struct kprobe *p)
1491{
1492 bool on_func_entry;
1493 return _kprobe_addr(p->addr, p->symbol_name, p->offset, &on_func_entry);
1494}
1495
1496/*
1497 * Check the 'p' is valid and return the aggregator kprobe
1498 * at the same address.
1499 */
1500static struct kprobe *__get_valid_kprobe(struct kprobe *p)
1501{
1502 struct kprobe *ap, *list_p;
1503
1504 lockdep_assert_held(&kprobe_mutex);
1505
1506 ap = get_kprobe(p->addr);
1507 if (unlikely(!ap))
1508 return NULL;
1509
1510 if (p != ap) {
1511 list_for_each_entry(list_p, &ap->list, list)
1512 if (list_p == p)
1513 /* kprobe p is a valid probe */
1514 goto valid;
1515 return NULL;
1516 }
1517valid:
1518 return ap;
1519}
1520
1521/*
1522 * Warn and return error if the kprobe is being re-registered since
1523 * there must be a software bug.
1524 */
1525static inline int warn_kprobe_rereg(struct kprobe *p)
1526{
1527 int ret = 0;
1528
1529 mutex_lock(&kprobe_mutex);
1530 if (WARN_ON_ONCE(__get_valid_kprobe(p)))
1531 ret = -EINVAL;
1532 mutex_unlock(&kprobe_mutex);
1533
1534 return ret;
1535}
1536
1537static int check_ftrace_location(struct kprobe *p)
1538{
1539 unsigned long addr = (unsigned long)p->addr;
1540
1541 if (ftrace_location(addr) == addr) {
1542#ifdef CONFIG_KPROBES_ON_FTRACE
1543 p->flags |= KPROBE_FLAG_FTRACE;
1544#else /* !CONFIG_KPROBES_ON_FTRACE */
1545 return -EINVAL;
1546#endif
1547 }
1548 return 0;
1549}
1550
1551static int check_kprobe_address_safe(struct kprobe *p,
1552 struct module **probed_mod)
1553{
1554 int ret;
1555
1556 ret = check_ftrace_location(p);
1557 if (ret)
1558 return ret;
1559 jump_label_lock();
1560 preempt_disable();
1561
1562 /* Ensure it is not in reserved area nor out of text */
1563 if (!(core_kernel_text((unsigned long) p->addr) ||
1564 is_module_text_address((unsigned long) p->addr)) ||
1565 in_gate_area_no_mm((unsigned long) p->addr) ||
1566 within_kprobe_blacklist((unsigned long) p->addr) ||
1567 jump_label_text_reserved(p->addr, p->addr) ||
1568 static_call_text_reserved(p->addr, p->addr) ||
1569 find_bug((unsigned long)p->addr)) {
1570 ret = -EINVAL;
1571 goto out;
1572 }
1573
1574 /* Check if 'p' is probing a module. */
1575 *probed_mod = __module_text_address((unsigned long) p->addr);
1576 if (*probed_mod) {
1577 /*
1578 * We must hold a refcount of the probed module while updating
1579 * its code to prohibit unexpected unloading.
1580 */
1581 if (unlikely(!try_module_get(*probed_mod))) {
1582 ret = -ENOENT;
1583 goto out;
1584 }
1585
1586 /*
1587 * If the module freed '.init.text', we couldn't insert
1588 * kprobes in there.
1589 */
1590 if (within_module_init((unsigned long)p->addr, *probed_mod) &&
1591 (*probed_mod)->state != MODULE_STATE_COMING) {
1592 module_put(*probed_mod);
1593 *probed_mod = NULL;
1594 ret = -ENOENT;
1595 }
1596 }
1597out:
1598 preempt_enable();
1599 jump_label_unlock();
1600
1601 return ret;
1602}
1603
1604int register_kprobe(struct kprobe *p)
1605{
1606 int ret;
1607 struct kprobe *old_p;
1608 struct module *probed_mod;
1609 kprobe_opcode_t *addr;
1610 bool on_func_entry;
1611
1612 /* Adjust probe address from symbol */
1613 addr = _kprobe_addr(p->addr, p->symbol_name, p->offset, &on_func_entry);
1614 if (IS_ERR(addr))
1615 return PTR_ERR(addr);
1616 p->addr = addr;
1617
1618 ret = warn_kprobe_rereg(p);
1619 if (ret)
1620 return ret;
1621
1622 /* User can pass only KPROBE_FLAG_DISABLED to register_kprobe */
1623 p->flags &= KPROBE_FLAG_DISABLED;
1624 p->nmissed = 0;
1625 INIT_LIST_HEAD(&p->list);
1626
1627 ret = check_kprobe_address_safe(p, &probed_mod);
1628 if (ret)
1629 return ret;
1630
1631 mutex_lock(&kprobe_mutex);
1632
1633 if (on_func_entry)
1634 p->flags |= KPROBE_FLAG_ON_FUNC_ENTRY;
1635
1636 old_p = get_kprobe(p->addr);
1637 if (old_p) {
1638 /* Since this may unoptimize 'old_p', locking 'text_mutex'. */
1639 ret = register_aggr_kprobe(old_p, p);
1640 goto out;
1641 }
1642
1643 cpus_read_lock();
1644 /* Prevent text modification */
1645 mutex_lock(&text_mutex);
1646 ret = prepare_kprobe(p);
1647 mutex_unlock(&text_mutex);
1648 cpus_read_unlock();
1649 if (ret)
1650 goto out;
1651
1652 INIT_HLIST_NODE(&p->hlist);
1653 hlist_add_head_rcu(&p->hlist,
1654 &kprobe_table[hash_ptr(p->addr, KPROBE_HASH_BITS)]);
1655
1656 if (!kprobes_all_disarmed && !kprobe_disabled(p)) {
1657 ret = arm_kprobe(p);
1658 if (ret) {
1659 hlist_del_rcu(&p->hlist);
1660 synchronize_rcu();
1661 goto out;
1662 }
1663 }
1664
1665 /* Try to optimize kprobe */
1666 try_to_optimize_kprobe(p);
1667out:
1668 mutex_unlock(&kprobe_mutex);
1669
1670 if (probed_mod)
1671 module_put(probed_mod);
1672
1673 return ret;
1674}
1675EXPORT_SYMBOL_GPL(register_kprobe);
1676
1677/* Check if all probes on the 'ap' are disabled. */
1678static bool aggr_kprobe_disabled(struct kprobe *ap)
1679{
1680 struct kprobe *kp;
1681
1682 lockdep_assert_held(&kprobe_mutex);
1683
1684 list_for_each_entry(kp, &ap->list, list)
1685 if (!kprobe_disabled(kp))
1686 /*
1687 * Since there is an active probe on the list,
1688 * we can't disable this 'ap'.
1689 */
1690 return false;
1691
1692 return true;
1693}
1694
1695static struct kprobe *__disable_kprobe(struct kprobe *p)
1696{
1697 struct kprobe *orig_p;
1698 int ret;
1699
1700 lockdep_assert_held(&kprobe_mutex);
1701
1702 /* Get an original kprobe for return */
1703 orig_p = __get_valid_kprobe(p);
1704 if (unlikely(orig_p == NULL))
1705 return ERR_PTR(-EINVAL);
1706
1707 if (!kprobe_disabled(p)) {
1708 /* Disable probe if it is a child probe */
1709 if (p != orig_p)
1710 p->flags |= KPROBE_FLAG_DISABLED;
1711
1712 /* Try to disarm and disable this/parent probe */
1713 if (p == orig_p || aggr_kprobe_disabled(orig_p)) {
1714 /*
1715 * Don't be lazy here. Even if 'kprobes_all_disarmed'
1716 * is false, 'orig_p' might not have been armed yet.
1717 * Note arm_all_kprobes() __tries__ to arm all kprobes
1718 * on the best effort basis.
1719 */
1720 if (!kprobes_all_disarmed && !kprobe_disabled(orig_p)) {
1721 ret = disarm_kprobe(orig_p, true);
1722 if (ret) {
1723 p->flags &= ~KPROBE_FLAG_DISABLED;
1724 return ERR_PTR(ret);
1725 }
1726 }
1727 orig_p->flags |= KPROBE_FLAG_DISABLED;
1728 }
1729 }
1730
1731 return orig_p;
1732}
1733
1734/*
1735 * Unregister a kprobe without a scheduler synchronization.
1736 */
1737static int __unregister_kprobe_top(struct kprobe *p)
1738{
1739 struct kprobe *ap, *list_p;
1740
1741 /* Disable kprobe. This will disarm it if needed. */
1742 ap = __disable_kprobe(p);
1743 if (IS_ERR(ap))
1744 return PTR_ERR(ap);
1745
1746 if (ap == p)
1747 /*
1748 * This probe is an independent(and non-optimized) kprobe
1749 * (not an aggrprobe). Remove from the hash list.
1750 */
1751 goto disarmed;
1752
1753 /* Following process expects this probe is an aggrprobe */
1754 WARN_ON(!kprobe_aggrprobe(ap));
1755
1756 if (list_is_singular(&ap->list) && kprobe_disarmed(ap))
1757 /*
1758 * !disarmed could be happen if the probe is under delayed
1759 * unoptimizing.
1760 */
1761 goto disarmed;
1762 else {
1763 /* If disabling probe has special handlers, update aggrprobe */
1764 if (p->post_handler && !kprobe_gone(p)) {
1765 list_for_each_entry(list_p, &ap->list, list) {
1766 if ((list_p != p) && (list_p->post_handler))
1767 goto noclean;
1768 }
1769 /*
1770 * For the kprobe-on-ftrace case, we keep the
1771 * post_handler setting to identify this aggrprobe
1772 * armed with kprobe_ipmodify_ops.
1773 */
1774 if (!kprobe_ftrace(ap))
1775 ap->post_handler = NULL;
1776 }
1777noclean:
1778 /*
1779 * Remove from the aggrprobe: this path will do nothing in
1780 * __unregister_kprobe_bottom().
1781 */
1782 list_del_rcu(&p->list);
1783 if (!kprobe_disabled(ap) && !kprobes_all_disarmed)
1784 /*
1785 * Try to optimize this probe again, because post
1786 * handler may have been changed.
1787 */
1788 optimize_kprobe(ap);
1789 }
1790 return 0;
1791
1792disarmed:
1793 hlist_del_rcu(&ap->hlist);
1794 return 0;
1795}
1796
1797static void __unregister_kprobe_bottom(struct kprobe *p)
1798{
1799 struct kprobe *ap;
1800
1801 if (list_empty(&p->list))
1802 /* This is an independent kprobe */
1803 arch_remove_kprobe(p);
1804 else if (list_is_singular(&p->list)) {
1805 /* This is the last child of an aggrprobe */
1806 ap = list_entry(p->list.next, struct kprobe, list);
1807 list_del(&p->list);
1808 free_aggr_kprobe(ap);
1809 }
1810 /* Otherwise, do nothing. */
1811}
1812
1813int register_kprobes(struct kprobe **kps, int num)
1814{
1815 int i, ret = 0;
1816
1817 if (num <= 0)
1818 return -EINVAL;
1819 for (i = 0; i < num; i++) {
1820 ret = register_kprobe(kps[i]);
1821 if (ret < 0) {
1822 if (i > 0)
1823 unregister_kprobes(kps, i);
1824 break;
1825 }
1826 }
1827 return ret;
1828}
1829EXPORT_SYMBOL_GPL(register_kprobes);
1830
1831void unregister_kprobe(struct kprobe *p)
1832{
1833 unregister_kprobes(&p, 1);
1834}
1835EXPORT_SYMBOL_GPL(unregister_kprobe);
1836
1837void unregister_kprobes(struct kprobe **kps, int num)
1838{
1839 int i;
1840
1841 if (num <= 0)
1842 return;
1843 mutex_lock(&kprobe_mutex);
1844 for (i = 0; i < num; i++)
1845 if (__unregister_kprobe_top(kps[i]) < 0)
1846 kps[i]->addr = NULL;
1847 mutex_unlock(&kprobe_mutex);
1848
1849 synchronize_rcu();
1850 for (i = 0; i < num; i++)
1851 if (kps[i]->addr)
1852 __unregister_kprobe_bottom(kps[i]);
1853}
1854EXPORT_SYMBOL_GPL(unregister_kprobes);
1855
1856int __weak kprobe_exceptions_notify(struct notifier_block *self,
1857 unsigned long val, void *data)
1858{
1859 return NOTIFY_DONE;
1860}
1861NOKPROBE_SYMBOL(kprobe_exceptions_notify);
1862
1863static struct notifier_block kprobe_exceptions_nb = {
1864 .notifier_call = kprobe_exceptions_notify,
1865 .priority = 0x7fffffff /* we need to be notified first */
1866};
1867
1868#ifdef CONFIG_KRETPROBES
1869
1870#if !defined(CONFIG_KRETPROBE_ON_RETHOOK)
1871static void free_rp_inst_rcu(struct rcu_head *head)
1872{
1873 struct kretprobe_instance *ri = container_of(head, struct kretprobe_instance, rcu);
1874
1875 if (refcount_dec_and_test(&ri->rph->ref))
1876 kfree(ri->rph);
1877 kfree(ri);
1878}
1879NOKPROBE_SYMBOL(free_rp_inst_rcu);
1880
1881static void recycle_rp_inst(struct kretprobe_instance *ri)
1882{
1883 struct kretprobe *rp = get_kretprobe(ri);
1884
1885 if (likely(rp))
1886 freelist_add(&ri->freelist, &rp->freelist);
1887 else
1888 call_rcu(&ri->rcu, free_rp_inst_rcu);
1889}
1890NOKPROBE_SYMBOL(recycle_rp_inst);
1891
1892/*
1893 * This function is called from delayed_put_task_struct() when a task is
1894 * dead and cleaned up to recycle any kretprobe instances associated with
1895 * this task. These left over instances represent probed functions that
1896 * have been called but will never return.
1897 */
1898void kprobe_flush_task(struct task_struct *tk)
1899{
1900 struct kretprobe_instance *ri;
1901 struct llist_node *node;
1902
1903 /* Early boot, not yet initialized. */
1904 if (unlikely(!kprobes_initialized))
1905 return;
1906
1907 kprobe_busy_begin();
1908
1909 node = __llist_del_all(&tk->kretprobe_instances);
1910 while (node) {
1911 ri = container_of(node, struct kretprobe_instance, llist);
1912 node = node->next;
1913
1914 recycle_rp_inst(ri);
1915 }
1916
1917 kprobe_busy_end();
1918}
1919NOKPROBE_SYMBOL(kprobe_flush_task);
1920
1921static inline void free_rp_inst(struct kretprobe *rp)
1922{
1923 struct kretprobe_instance *ri;
1924 struct freelist_node *node;
1925 int count = 0;
1926
1927 node = rp->freelist.head;
1928 while (node) {
1929 ri = container_of(node, struct kretprobe_instance, freelist);
1930 node = node->next;
1931
1932 kfree(ri);
1933 count++;
1934 }
1935
1936 if (refcount_sub_and_test(count, &rp->rph->ref)) {
1937 kfree(rp->rph);
1938 rp->rph = NULL;
1939 }
1940}
1941
1942/* This assumes the 'tsk' is the current task or the is not running. */
1943static kprobe_opcode_t *__kretprobe_find_ret_addr(struct task_struct *tsk,
1944 struct llist_node **cur)
1945{
1946 struct kretprobe_instance *ri = NULL;
1947 struct llist_node *node = *cur;
1948
1949 if (!node)
1950 node = tsk->kretprobe_instances.first;
1951 else
1952 node = node->next;
1953
1954 while (node) {
1955 ri = container_of(node, struct kretprobe_instance, llist);
1956 if (ri->ret_addr != kretprobe_trampoline_addr()) {
1957 *cur = node;
1958 return ri->ret_addr;
1959 }
1960 node = node->next;
1961 }
1962 return NULL;
1963}
1964NOKPROBE_SYMBOL(__kretprobe_find_ret_addr);
1965
1966/**
1967 * kretprobe_find_ret_addr -- Find correct return address modified by kretprobe
1968 * @tsk: Target task
1969 * @fp: A frame pointer
1970 * @cur: a storage of the loop cursor llist_node pointer for next call
1971 *
1972 * Find the correct return address modified by a kretprobe on @tsk in unsigned
1973 * long type. If it finds the return address, this returns that address value,
1974 * or this returns 0.
1975 * The @tsk must be 'current' or a task which is not running. @fp is a hint
1976 * to get the currect return address - which is compared with the
1977 * kretprobe_instance::fp field. The @cur is a loop cursor for searching the
1978 * kretprobe return addresses on the @tsk. The '*@cur' should be NULL at the
1979 * first call, but '@cur' itself must NOT NULL.
1980 */
1981unsigned long kretprobe_find_ret_addr(struct task_struct *tsk, void *fp,
1982 struct llist_node **cur)
1983{
1984 struct kretprobe_instance *ri = NULL;
1985 kprobe_opcode_t *ret;
1986
1987 if (WARN_ON_ONCE(!cur))
1988 return 0;
1989
1990 do {
1991 ret = __kretprobe_find_ret_addr(tsk, cur);
1992 if (!ret)
1993 break;
1994 ri = container_of(*cur, struct kretprobe_instance, llist);
1995 } while (ri->fp != fp);
1996
1997 return (unsigned long)ret;
1998}
1999NOKPROBE_SYMBOL(kretprobe_find_ret_addr);
2000
2001void __weak arch_kretprobe_fixup_return(struct pt_regs *regs,
2002 kprobe_opcode_t *correct_ret_addr)
2003{
2004 /*
2005 * Do nothing by default. Please fill this to update the fake return
2006 * address on the stack with the correct one on each arch if possible.
2007 */
2008}
2009
2010unsigned long __kretprobe_trampoline_handler(struct pt_regs *regs,
2011 void *frame_pointer)
2012{
2013 kprobe_opcode_t *correct_ret_addr = NULL;
2014 struct kretprobe_instance *ri = NULL;
2015 struct llist_node *first, *node = NULL;
2016 struct kretprobe *rp;
2017
2018 /* Find correct address and all nodes for this frame. */
2019 correct_ret_addr = __kretprobe_find_ret_addr(current, &node);
2020 if (!correct_ret_addr) {
2021 pr_err("kretprobe: Return address not found, not execute handler. Maybe there is a bug in the kernel.\n");
2022 BUG_ON(1);
2023 }
2024
2025 /*
2026 * Set the return address as the instruction pointer, because if the
2027 * user handler calls stack_trace_save_regs() with this 'regs',
2028 * the stack trace will start from the instruction pointer.
2029 */
2030 instruction_pointer_set(regs, (unsigned long)correct_ret_addr);
2031
2032 /* Run the user handler of the nodes. */
2033 first = current->kretprobe_instances.first;
2034 while (first) {
2035 ri = container_of(first, struct kretprobe_instance, llist);
2036
2037 if (WARN_ON_ONCE(ri->fp != frame_pointer))
2038 break;
2039
2040 rp = get_kretprobe(ri);
2041 if (rp && rp->handler) {
2042 struct kprobe *prev = kprobe_running();
2043
2044 __this_cpu_write(current_kprobe, &rp->kp);
2045 ri->ret_addr = correct_ret_addr;
2046 rp->handler(ri, regs);
2047 __this_cpu_write(current_kprobe, prev);
2048 }
2049 if (first == node)
2050 break;
2051
2052 first = first->next;
2053 }
2054
2055 arch_kretprobe_fixup_return(regs, correct_ret_addr);
2056
2057 /* Unlink all nodes for this frame. */
2058 first = current->kretprobe_instances.first;
2059 current->kretprobe_instances.first = node->next;
2060 node->next = NULL;
2061
2062 /* Recycle free instances. */
2063 while (first) {
2064 ri = container_of(first, struct kretprobe_instance, llist);
2065 first = first->next;
2066
2067 recycle_rp_inst(ri);
2068 }
2069
2070 return (unsigned long)correct_ret_addr;
2071}
2072NOKPROBE_SYMBOL(__kretprobe_trampoline_handler)
2073
2074/*
2075 * This kprobe pre_handler is registered with every kretprobe. When probe
2076 * hits it will set up the return probe.
2077 */
2078static int pre_handler_kretprobe(struct kprobe *p, struct pt_regs *regs)
2079{
2080 struct kretprobe *rp = container_of(p, struct kretprobe, kp);
2081 struct kretprobe_instance *ri;
2082 struct freelist_node *fn;
2083
2084 fn = freelist_try_get(&rp->freelist);
2085 if (!fn) {
2086 rp->nmissed++;
2087 return 0;
2088 }
2089
2090 ri = container_of(fn, struct kretprobe_instance, freelist);
2091
2092 if (rp->entry_handler && rp->entry_handler(ri, regs)) {
2093 freelist_add(&ri->freelist, &rp->freelist);
2094 return 0;
2095 }
2096
2097 arch_prepare_kretprobe(ri, regs);
2098
2099 __llist_add(&ri->llist, ¤t->kretprobe_instances);
2100
2101 return 0;
2102}
2103NOKPROBE_SYMBOL(pre_handler_kretprobe);
2104#else /* CONFIG_KRETPROBE_ON_RETHOOK */
2105/*
2106 * This kprobe pre_handler is registered with every kretprobe. When probe
2107 * hits it will set up the return probe.
2108 */
2109static int pre_handler_kretprobe(struct kprobe *p, struct pt_regs *regs)
2110{
2111 struct kretprobe *rp = container_of(p, struct kretprobe, kp);
2112 struct kretprobe_instance *ri;
2113 struct rethook_node *rhn;
2114
2115 rhn = rethook_try_get(rp->rh);
2116 if (!rhn) {
2117 rp->nmissed++;
2118 return 0;
2119 }
2120
2121 ri = container_of(rhn, struct kretprobe_instance, node);
2122
2123 if (rp->entry_handler && rp->entry_handler(ri, regs))
2124 rethook_recycle(rhn);
2125 else
2126 rethook_hook(rhn, regs, kprobe_ftrace(p));
2127
2128 return 0;
2129}
2130NOKPROBE_SYMBOL(pre_handler_kretprobe);
2131
2132static void kretprobe_rethook_handler(struct rethook_node *rh, void *data,
2133 struct pt_regs *regs)
2134{
2135 struct kretprobe *rp = (struct kretprobe *)data;
2136 struct kretprobe_instance *ri;
2137 struct kprobe_ctlblk *kcb;
2138
2139 /* The data must NOT be null. This means rethook data structure is broken. */
2140 if (WARN_ON_ONCE(!data) || !rp->handler)
2141 return;
2142
2143 __this_cpu_write(current_kprobe, &rp->kp);
2144 kcb = get_kprobe_ctlblk();
2145 kcb->kprobe_status = KPROBE_HIT_ACTIVE;
2146
2147 ri = container_of(rh, struct kretprobe_instance, node);
2148 rp->handler(ri, regs);
2149
2150 __this_cpu_write(current_kprobe, NULL);
2151}
2152NOKPROBE_SYMBOL(kretprobe_rethook_handler);
2153
2154#endif /* !CONFIG_KRETPROBE_ON_RETHOOK */
2155
2156/**
2157 * kprobe_on_func_entry() -- check whether given address is function entry
2158 * @addr: Target address
2159 * @sym: Target symbol name
2160 * @offset: The offset from the symbol or the address
2161 *
2162 * This checks whether the given @addr+@offset or @sym+@offset is on the
2163 * function entry address or not.
2164 * This returns 0 if it is the function entry, or -EINVAL if it is not.
2165 * And also it returns -ENOENT if it fails the symbol or address lookup.
2166 * Caller must pass @addr or @sym (either one must be NULL), or this
2167 * returns -EINVAL.
2168 */
2169int kprobe_on_func_entry(kprobe_opcode_t *addr, const char *sym, unsigned long offset)
2170{
2171 bool on_func_entry;
2172 kprobe_opcode_t *kp_addr = _kprobe_addr(addr, sym, offset, &on_func_entry);
2173
2174 if (IS_ERR(kp_addr))
2175 return PTR_ERR(kp_addr);
2176
2177 if (!on_func_entry)
2178 return -EINVAL;
2179
2180 return 0;
2181}
2182
2183int register_kretprobe(struct kretprobe *rp)
2184{
2185 int ret;
2186 struct kretprobe_instance *inst;
2187 int i;
2188 void *addr;
2189
2190 ret = kprobe_on_func_entry(rp->kp.addr, rp->kp.symbol_name, rp->kp.offset);
2191 if (ret)
2192 return ret;
2193
2194 /* If only 'rp->kp.addr' is specified, check reregistering kprobes */
2195 if (rp->kp.addr && warn_kprobe_rereg(&rp->kp))
2196 return -EINVAL;
2197
2198 if (kretprobe_blacklist_size) {
2199 addr = kprobe_addr(&rp->kp);
2200 if (IS_ERR(addr))
2201 return PTR_ERR(addr);
2202
2203 for (i = 0; kretprobe_blacklist[i].name != NULL; i++) {
2204 if (kretprobe_blacklist[i].addr == addr)
2205 return -EINVAL;
2206 }
2207 }
2208
2209 if (rp->data_size > KRETPROBE_MAX_DATA_SIZE)
2210 return -E2BIG;
2211
2212 rp->kp.pre_handler = pre_handler_kretprobe;
2213 rp->kp.post_handler = NULL;
2214
2215 /* Pre-allocate memory for max kretprobe instances */
2216 if (rp->maxactive <= 0)
2217 rp->maxactive = max_t(unsigned int, 10, 2*num_possible_cpus());
2218
2219#ifdef CONFIG_KRETPROBE_ON_RETHOOK
2220 rp->rh = rethook_alloc((void *)rp, kretprobe_rethook_handler);
2221 if (!rp->rh)
2222 return -ENOMEM;
2223
2224 for (i = 0; i < rp->maxactive; i++) {
2225 inst = kzalloc(sizeof(struct kretprobe_instance) +
2226 rp->data_size, GFP_KERNEL);
2227 if (inst == NULL) {
2228 rethook_free(rp->rh);
2229 rp->rh = NULL;
2230 return -ENOMEM;
2231 }
2232 rethook_add_node(rp->rh, &inst->node);
2233 }
2234 rp->nmissed = 0;
2235 /* Establish function entry probe point */
2236 ret = register_kprobe(&rp->kp);
2237 if (ret != 0) {
2238 rethook_free(rp->rh);
2239 rp->rh = NULL;
2240 }
2241#else /* !CONFIG_KRETPROBE_ON_RETHOOK */
2242 rp->freelist.head = NULL;
2243 rp->rph = kzalloc(sizeof(struct kretprobe_holder), GFP_KERNEL);
2244 if (!rp->rph)
2245 return -ENOMEM;
2246
2247 rp->rph->rp = rp;
2248 for (i = 0; i < rp->maxactive; i++) {
2249 inst = kzalloc(sizeof(struct kretprobe_instance) +
2250 rp->data_size, GFP_KERNEL);
2251 if (inst == NULL) {
2252 refcount_set(&rp->rph->ref, i);
2253 free_rp_inst(rp);
2254 return -ENOMEM;
2255 }
2256 inst->rph = rp->rph;
2257 freelist_add(&inst->freelist, &rp->freelist);
2258 }
2259 refcount_set(&rp->rph->ref, i);
2260
2261 rp->nmissed = 0;
2262 /* Establish function entry probe point */
2263 ret = register_kprobe(&rp->kp);
2264 if (ret != 0)
2265 free_rp_inst(rp);
2266#endif
2267 return ret;
2268}
2269EXPORT_SYMBOL_GPL(register_kretprobe);
2270
2271int register_kretprobes(struct kretprobe **rps, int num)
2272{
2273 int ret = 0, i;
2274
2275 if (num <= 0)
2276 return -EINVAL;
2277 for (i = 0; i < num; i++) {
2278 ret = register_kretprobe(rps[i]);
2279 if (ret < 0) {
2280 if (i > 0)
2281 unregister_kretprobes(rps, i);
2282 break;
2283 }
2284 }
2285 return ret;
2286}
2287EXPORT_SYMBOL_GPL(register_kretprobes);
2288
2289void unregister_kretprobe(struct kretprobe *rp)
2290{
2291 unregister_kretprobes(&rp, 1);
2292}
2293EXPORT_SYMBOL_GPL(unregister_kretprobe);
2294
2295void unregister_kretprobes(struct kretprobe **rps, int num)
2296{
2297 int i;
2298
2299 if (num <= 0)
2300 return;
2301 mutex_lock(&kprobe_mutex);
2302 for (i = 0; i < num; i++) {
2303 if (__unregister_kprobe_top(&rps[i]->kp) < 0)
2304 rps[i]->kp.addr = NULL;
2305#ifdef CONFIG_KRETPROBE_ON_RETHOOK
2306 rethook_free(rps[i]->rh);
2307#else
2308 rps[i]->rph->rp = NULL;
2309#endif
2310 }
2311 mutex_unlock(&kprobe_mutex);
2312
2313 synchronize_rcu();
2314 for (i = 0; i < num; i++) {
2315 if (rps[i]->kp.addr) {
2316 __unregister_kprobe_bottom(&rps[i]->kp);
2317#ifndef CONFIG_KRETPROBE_ON_RETHOOK
2318 free_rp_inst(rps[i]);
2319#endif
2320 }
2321 }
2322}
2323EXPORT_SYMBOL_GPL(unregister_kretprobes);
2324
2325#else /* CONFIG_KRETPROBES */
2326int register_kretprobe(struct kretprobe *rp)
2327{
2328 return -EOPNOTSUPP;
2329}
2330EXPORT_SYMBOL_GPL(register_kretprobe);
2331
2332int register_kretprobes(struct kretprobe **rps, int num)
2333{
2334 return -EOPNOTSUPP;
2335}
2336EXPORT_SYMBOL_GPL(register_kretprobes);
2337
2338void unregister_kretprobe(struct kretprobe *rp)
2339{
2340}
2341EXPORT_SYMBOL_GPL(unregister_kretprobe);
2342
2343void unregister_kretprobes(struct kretprobe **rps, int num)
2344{
2345}
2346EXPORT_SYMBOL_GPL(unregister_kretprobes);
2347
2348static int pre_handler_kretprobe(struct kprobe *p, struct pt_regs *regs)
2349{
2350 return 0;
2351}
2352NOKPROBE_SYMBOL(pre_handler_kretprobe);
2353
2354#endif /* CONFIG_KRETPROBES */
2355
2356/* Set the kprobe gone and remove its instruction buffer. */
2357static void kill_kprobe(struct kprobe *p)
2358{
2359 struct kprobe *kp;
2360
2361 lockdep_assert_held(&kprobe_mutex);
2362
2363 /*
2364 * The module is going away. We should disarm the kprobe which
2365 * is using ftrace, because ftrace framework is still available at
2366 * 'MODULE_STATE_GOING' notification.
2367 */
2368 if (kprobe_ftrace(p) && !kprobe_disabled(p) && !kprobes_all_disarmed)
2369 disarm_kprobe_ftrace(p);
2370
2371 p->flags |= KPROBE_FLAG_GONE;
2372 if (kprobe_aggrprobe(p)) {
2373 /*
2374 * If this is an aggr_kprobe, we have to list all the
2375 * chained probes and mark them GONE.
2376 */
2377 list_for_each_entry(kp, &p->list, list)
2378 kp->flags |= KPROBE_FLAG_GONE;
2379 p->post_handler = NULL;
2380 kill_optimized_kprobe(p);
2381 }
2382 /*
2383 * Here, we can remove insn_slot safely, because no thread calls
2384 * the original probed function (which will be freed soon) any more.
2385 */
2386 arch_remove_kprobe(p);
2387}
2388
2389/* Disable one kprobe */
2390int disable_kprobe(struct kprobe *kp)
2391{
2392 int ret = 0;
2393 struct kprobe *p;
2394
2395 mutex_lock(&kprobe_mutex);
2396
2397 /* Disable this kprobe */
2398 p = __disable_kprobe(kp);
2399 if (IS_ERR(p))
2400 ret = PTR_ERR(p);
2401
2402 mutex_unlock(&kprobe_mutex);
2403 return ret;
2404}
2405EXPORT_SYMBOL_GPL(disable_kprobe);
2406
2407/* Enable one kprobe */
2408int enable_kprobe(struct kprobe *kp)
2409{
2410 int ret = 0;
2411 struct kprobe *p;
2412
2413 mutex_lock(&kprobe_mutex);
2414
2415 /* Check whether specified probe is valid. */
2416 p = __get_valid_kprobe(kp);
2417 if (unlikely(p == NULL)) {
2418 ret = -EINVAL;
2419 goto out;
2420 }
2421
2422 if (kprobe_gone(kp)) {
2423 /* This kprobe has gone, we couldn't enable it. */
2424 ret = -EINVAL;
2425 goto out;
2426 }
2427
2428 if (p != kp)
2429 kp->flags &= ~KPROBE_FLAG_DISABLED;
2430
2431 if (!kprobes_all_disarmed && kprobe_disabled(p)) {
2432 p->flags &= ~KPROBE_FLAG_DISABLED;
2433 ret = arm_kprobe(p);
2434 if (ret) {
2435 p->flags |= KPROBE_FLAG_DISABLED;
2436 if (p != kp)
2437 kp->flags |= KPROBE_FLAG_DISABLED;
2438 }
2439 }
2440out:
2441 mutex_unlock(&kprobe_mutex);
2442 return ret;
2443}
2444EXPORT_SYMBOL_GPL(enable_kprobe);
2445
2446/* Caller must NOT call this in usual path. This is only for critical case */
2447void dump_kprobe(struct kprobe *kp)
2448{
2449 pr_err("Dump kprobe:\n.symbol_name = %s, .offset = %x, .addr = %pS\n",
2450 kp->symbol_name, kp->offset, kp->addr);
2451}
2452NOKPROBE_SYMBOL(dump_kprobe);
2453
2454int kprobe_add_ksym_blacklist(unsigned long entry)
2455{
2456 struct kprobe_blacklist_entry *ent;
2457 unsigned long offset = 0, size = 0;
2458
2459 if (!kernel_text_address(entry) ||
2460 !kallsyms_lookup_size_offset(entry, &size, &offset))
2461 return -EINVAL;
2462
2463 ent = kmalloc(sizeof(*ent), GFP_KERNEL);
2464 if (!ent)
2465 return -ENOMEM;
2466 ent->start_addr = entry;
2467 ent->end_addr = entry + size;
2468 INIT_LIST_HEAD(&ent->list);
2469 list_add_tail(&ent->list, &kprobe_blacklist);
2470
2471 return (int)size;
2472}
2473
2474/* Add all symbols in given area into kprobe blacklist */
2475int kprobe_add_area_blacklist(unsigned long start, unsigned long end)
2476{
2477 unsigned long entry;
2478 int ret = 0;
2479
2480 for (entry = start; entry < end; entry += ret) {
2481 ret = kprobe_add_ksym_blacklist(entry);
2482 if (ret < 0)
2483 return ret;
2484 if (ret == 0) /* In case of alias symbol */
2485 ret = 1;
2486 }
2487 return 0;
2488}
2489
2490/* Remove all symbols in given area from kprobe blacklist */
2491static void kprobe_remove_area_blacklist(unsigned long start, unsigned long end)
2492{
2493 struct kprobe_blacklist_entry *ent, *n;
2494
2495 list_for_each_entry_safe(ent, n, &kprobe_blacklist, list) {
2496 if (ent->start_addr < start || ent->start_addr >= end)
2497 continue;
2498 list_del(&ent->list);
2499 kfree(ent);
2500 }
2501}
2502
2503static void kprobe_remove_ksym_blacklist(unsigned long entry)
2504{
2505 kprobe_remove_area_blacklist(entry, entry + 1);
2506}
2507
2508int __weak arch_kprobe_get_kallsym(unsigned int *symnum, unsigned long *value,
2509 char *type, char *sym)
2510{
2511 return -ERANGE;
2512}
2513
2514int kprobe_get_kallsym(unsigned int symnum, unsigned long *value, char *type,
2515 char *sym)
2516{
2517#ifdef __ARCH_WANT_KPROBES_INSN_SLOT
2518 if (!kprobe_cache_get_kallsym(&kprobe_insn_slots, &symnum, value, type, sym))
2519 return 0;
2520#ifdef CONFIG_OPTPROBES
2521 if (!kprobe_cache_get_kallsym(&kprobe_optinsn_slots, &symnum, value, type, sym))
2522 return 0;
2523#endif
2524#endif
2525 if (!arch_kprobe_get_kallsym(&symnum, value, type, sym))
2526 return 0;
2527 return -ERANGE;
2528}
2529
2530int __init __weak arch_populate_kprobe_blacklist(void)
2531{
2532 return 0;
2533}
2534
2535/*
2536 * Lookup and populate the kprobe_blacklist.
2537 *
2538 * Unlike the kretprobe blacklist, we'll need to determine
2539 * the range of addresses that belong to the said functions,
2540 * since a kprobe need not necessarily be at the beginning
2541 * of a function.
2542 */
2543static int __init populate_kprobe_blacklist(unsigned long *start,
2544 unsigned long *end)
2545{
2546 unsigned long entry;
2547 unsigned long *iter;
2548 int ret;
2549
2550 for (iter = start; iter < end; iter++) {
2551 entry = (unsigned long)dereference_symbol_descriptor((void *)*iter);
2552 ret = kprobe_add_ksym_blacklist(entry);
2553 if (ret == -EINVAL)
2554 continue;
2555 if (ret < 0)
2556 return ret;
2557 }
2558
2559 /* Symbols in '__kprobes_text' are blacklisted */
2560 ret = kprobe_add_area_blacklist((unsigned long)__kprobes_text_start,
2561 (unsigned long)__kprobes_text_end);
2562 if (ret)
2563 return ret;
2564
2565 /* Symbols in 'noinstr' section are blacklisted */
2566 ret = kprobe_add_area_blacklist((unsigned long)__noinstr_text_start,
2567 (unsigned long)__noinstr_text_end);
2568
2569 return ret ? : arch_populate_kprobe_blacklist();
2570}
2571
2572static void add_module_kprobe_blacklist(struct module *mod)
2573{
2574 unsigned long start, end;
2575 int i;
2576
2577 if (mod->kprobe_blacklist) {
2578 for (i = 0; i < mod->num_kprobe_blacklist; i++)
2579 kprobe_add_ksym_blacklist(mod->kprobe_blacklist[i]);
2580 }
2581
2582 start = (unsigned long)mod->kprobes_text_start;
2583 if (start) {
2584 end = start + mod->kprobes_text_size;
2585 kprobe_add_area_blacklist(start, end);
2586 }
2587
2588 start = (unsigned long)mod->noinstr_text_start;
2589 if (start) {
2590 end = start + mod->noinstr_text_size;
2591 kprobe_add_area_blacklist(start, end);
2592 }
2593}
2594
2595static void remove_module_kprobe_blacklist(struct module *mod)
2596{
2597 unsigned long start, end;
2598 int i;
2599
2600 if (mod->kprobe_blacklist) {
2601 for (i = 0; i < mod->num_kprobe_blacklist; i++)
2602 kprobe_remove_ksym_blacklist(mod->kprobe_blacklist[i]);
2603 }
2604
2605 start = (unsigned long)mod->kprobes_text_start;
2606 if (start) {
2607 end = start + mod->kprobes_text_size;
2608 kprobe_remove_area_blacklist(start, end);
2609 }
2610
2611 start = (unsigned long)mod->noinstr_text_start;
2612 if (start) {
2613 end = start + mod->noinstr_text_size;
2614 kprobe_remove_area_blacklist(start, end);
2615 }
2616}
2617
2618/* Module notifier call back, checking kprobes on the module */
2619static int kprobes_module_callback(struct notifier_block *nb,
2620 unsigned long val, void *data)
2621{
2622 struct module *mod = data;
2623 struct hlist_head *head;
2624 struct kprobe *p;
2625 unsigned int i;
2626 int checkcore = (val == MODULE_STATE_GOING);
2627
2628 if (val == MODULE_STATE_COMING) {
2629 mutex_lock(&kprobe_mutex);
2630 add_module_kprobe_blacklist(mod);
2631 mutex_unlock(&kprobe_mutex);
2632 }
2633 if (val != MODULE_STATE_GOING && val != MODULE_STATE_LIVE)
2634 return NOTIFY_DONE;
2635
2636 /*
2637 * When 'MODULE_STATE_GOING' was notified, both of module '.text' and
2638 * '.init.text' sections would be freed. When 'MODULE_STATE_LIVE' was
2639 * notified, only '.init.text' section would be freed. We need to
2640 * disable kprobes which have been inserted in the sections.
2641 */
2642 mutex_lock(&kprobe_mutex);
2643 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
2644 head = &kprobe_table[i];
2645 hlist_for_each_entry(p, head, hlist)
2646 if (within_module_init((unsigned long)p->addr, mod) ||
2647 (checkcore &&
2648 within_module_core((unsigned long)p->addr, mod))) {
2649 /*
2650 * The vaddr this probe is installed will soon
2651 * be vfreed buy not synced to disk. Hence,
2652 * disarming the breakpoint isn't needed.
2653 *
2654 * Note, this will also move any optimized probes
2655 * that are pending to be removed from their
2656 * corresponding lists to the 'freeing_list' and
2657 * will not be touched by the delayed
2658 * kprobe_optimizer() work handler.
2659 */
2660 kill_kprobe(p);
2661 }
2662 }
2663 if (val == MODULE_STATE_GOING)
2664 remove_module_kprobe_blacklist(mod);
2665 mutex_unlock(&kprobe_mutex);
2666 return NOTIFY_DONE;
2667}
2668
2669static struct notifier_block kprobe_module_nb = {
2670 .notifier_call = kprobes_module_callback,
2671 .priority = 0
2672};
2673
2674void kprobe_free_init_mem(void)
2675{
2676 void *start = (void *)(&__init_begin);
2677 void *end = (void *)(&__init_end);
2678 struct hlist_head *head;
2679 struct kprobe *p;
2680 int i;
2681
2682 mutex_lock(&kprobe_mutex);
2683
2684 /* Kill all kprobes on initmem because the target code has been freed. */
2685 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
2686 head = &kprobe_table[i];
2687 hlist_for_each_entry(p, head, hlist) {
2688 if (start <= (void *)p->addr && (void *)p->addr < end)
2689 kill_kprobe(p);
2690 }
2691 }
2692
2693 mutex_unlock(&kprobe_mutex);
2694}
2695
2696static int __init init_kprobes(void)
2697{
2698 int i, err = 0;
2699
2700 /* FIXME allocate the probe table, currently defined statically */
2701 /* initialize all list heads */
2702 for (i = 0; i < KPROBE_TABLE_SIZE; i++)
2703 INIT_HLIST_HEAD(&kprobe_table[i]);
2704
2705 err = populate_kprobe_blacklist(__start_kprobe_blacklist,
2706 __stop_kprobe_blacklist);
2707 if (err)
2708 pr_err("Failed to populate blacklist (error %d), kprobes not restricted, be careful using them!\n", err);
2709
2710 if (kretprobe_blacklist_size) {
2711 /* lookup the function address from its name */
2712 for (i = 0; kretprobe_blacklist[i].name != NULL; i++) {
2713 kretprobe_blacklist[i].addr =
2714 kprobe_lookup_name(kretprobe_blacklist[i].name, 0);
2715 if (!kretprobe_blacklist[i].addr)
2716 pr_err("Failed to lookup symbol '%s' for kretprobe blacklist. Maybe the target function is removed or renamed.\n",
2717 kretprobe_blacklist[i].name);
2718 }
2719 }
2720
2721 /* By default, kprobes are armed */
2722 kprobes_all_disarmed = false;
2723
2724#if defined(CONFIG_OPTPROBES) && defined(__ARCH_WANT_KPROBES_INSN_SLOT)
2725 /* Init 'kprobe_optinsn_slots' for allocation */
2726 kprobe_optinsn_slots.insn_size = MAX_OPTINSN_SIZE;
2727#endif
2728
2729 err = arch_init_kprobes();
2730 if (!err)
2731 err = register_die_notifier(&kprobe_exceptions_nb);
2732 if (!err)
2733 err = register_module_notifier(&kprobe_module_nb);
2734
2735 kprobes_initialized = (err == 0);
2736 kprobe_sysctls_init();
2737 return err;
2738}
2739early_initcall(init_kprobes);
2740
2741#if defined(CONFIG_OPTPROBES)
2742static int __init init_optprobes(void)
2743{
2744 /*
2745 * Enable kprobe optimization - this kicks the optimizer which
2746 * depends on synchronize_rcu_tasks() and ksoftirqd, that is
2747 * not spawned in early initcall. So delay the optimization.
2748 */
2749 optimize_all_kprobes();
2750
2751 return 0;
2752}
2753subsys_initcall(init_optprobes);
2754#endif
2755
2756#ifdef CONFIG_DEBUG_FS
2757static void report_probe(struct seq_file *pi, struct kprobe *p,
2758 const char *sym, int offset, char *modname, struct kprobe *pp)
2759{
2760 char *kprobe_type;
2761 void *addr = p->addr;
2762
2763 if (p->pre_handler == pre_handler_kretprobe)
2764 kprobe_type = "r";
2765 else
2766 kprobe_type = "k";
2767
2768 if (!kallsyms_show_value(pi->file->f_cred))
2769 addr = NULL;
2770
2771 if (sym)
2772 seq_printf(pi, "%px %s %s+0x%x %s ",
2773 addr, kprobe_type, sym, offset,
2774 (modname ? modname : " "));
2775 else /* try to use %pS */
2776 seq_printf(pi, "%px %s %pS ",
2777 addr, kprobe_type, p->addr);
2778
2779 if (!pp)
2780 pp = p;
2781 seq_printf(pi, "%s%s%s%s\n",
2782 (kprobe_gone(p) ? "[GONE]" : ""),
2783 ((kprobe_disabled(p) && !kprobe_gone(p)) ? "[DISABLED]" : ""),
2784 (kprobe_optimized(pp) ? "[OPTIMIZED]" : ""),
2785 (kprobe_ftrace(pp) ? "[FTRACE]" : ""));
2786}
2787
2788static void *kprobe_seq_start(struct seq_file *f, loff_t *pos)
2789{
2790 return (*pos < KPROBE_TABLE_SIZE) ? pos : NULL;
2791}
2792
2793static void *kprobe_seq_next(struct seq_file *f, void *v, loff_t *pos)
2794{
2795 (*pos)++;
2796 if (*pos >= KPROBE_TABLE_SIZE)
2797 return NULL;
2798 return pos;
2799}
2800
2801static void kprobe_seq_stop(struct seq_file *f, void *v)
2802{
2803 /* Nothing to do */
2804}
2805
2806static int show_kprobe_addr(struct seq_file *pi, void *v)
2807{
2808 struct hlist_head *head;
2809 struct kprobe *p, *kp;
2810 const char *sym = NULL;
2811 unsigned int i = *(loff_t *) v;
2812 unsigned long offset = 0;
2813 char *modname, namebuf[KSYM_NAME_LEN];
2814
2815 head = &kprobe_table[i];
2816 preempt_disable();
2817 hlist_for_each_entry_rcu(p, head, hlist) {
2818 sym = kallsyms_lookup((unsigned long)p->addr, NULL,
2819 &offset, &modname, namebuf);
2820 if (kprobe_aggrprobe(p)) {
2821 list_for_each_entry_rcu(kp, &p->list, list)
2822 report_probe(pi, kp, sym, offset, modname, p);
2823 } else
2824 report_probe(pi, p, sym, offset, modname, NULL);
2825 }
2826 preempt_enable();
2827 return 0;
2828}
2829
2830static const struct seq_operations kprobes_sops = {
2831 .start = kprobe_seq_start,
2832 .next = kprobe_seq_next,
2833 .stop = kprobe_seq_stop,
2834 .show = show_kprobe_addr
2835};
2836
2837DEFINE_SEQ_ATTRIBUTE(kprobes);
2838
2839/* kprobes/blacklist -- shows which functions can not be probed */
2840static void *kprobe_blacklist_seq_start(struct seq_file *m, loff_t *pos)
2841{
2842 mutex_lock(&kprobe_mutex);
2843 return seq_list_start(&kprobe_blacklist, *pos);
2844}
2845
2846static void *kprobe_blacklist_seq_next(struct seq_file *m, void *v, loff_t *pos)
2847{
2848 return seq_list_next(v, &kprobe_blacklist, pos);
2849}
2850
2851static int kprobe_blacklist_seq_show(struct seq_file *m, void *v)
2852{
2853 struct kprobe_blacklist_entry *ent =
2854 list_entry(v, struct kprobe_blacklist_entry, list);
2855
2856 /*
2857 * If '/proc/kallsyms' is not showing kernel address, we won't
2858 * show them here either.
2859 */
2860 if (!kallsyms_show_value(m->file->f_cred))
2861 seq_printf(m, "0x%px-0x%px\t%ps\n", NULL, NULL,
2862 (void *)ent->start_addr);
2863 else
2864 seq_printf(m, "0x%px-0x%px\t%ps\n", (void *)ent->start_addr,
2865 (void *)ent->end_addr, (void *)ent->start_addr);
2866 return 0;
2867}
2868
2869static void kprobe_blacklist_seq_stop(struct seq_file *f, void *v)
2870{
2871 mutex_unlock(&kprobe_mutex);
2872}
2873
2874static const struct seq_operations kprobe_blacklist_sops = {
2875 .start = kprobe_blacklist_seq_start,
2876 .next = kprobe_blacklist_seq_next,
2877 .stop = kprobe_blacklist_seq_stop,
2878 .show = kprobe_blacklist_seq_show,
2879};
2880DEFINE_SEQ_ATTRIBUTE(kprobe_blacklist);
2881
2882static int arm_all_kprobes(void)
2883{
2884 struct hlist_head *head;
2885 struct kprobe *p;
2886 unsigned int i, total = 0, errors = 0;
2887 int err, ret = 0;
2888
2889 mutex_lock(&kprobe_mutex);
2890
2891 /* If kprobes are armed, just return */
2892 if (!kprobes_all_disarmed)
2893 goto already_enabled;
2894
2895 /*
2896 * optimize_kprobe() called by arm_kprobe() checks
2897 * kprobes_all_disarmed, so set kprobes_all_disarmed before
2898 * arm_kprobe.
2899 */
2900 kprobes_all_disarmed = false;
2901 /* Arming kprobes doesn't optimize kprobe itself */
2902 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
2903 head = &kprobe_table[i];
2904 /* Arm all kprobes on a best-effort basis */
2905 hlist_for_each_entry(p, head, hlist) {
2906 if (!kprobe_disabled(p)) {
2907 err = arm_kprobe(p);
2908 if (err) {
2909 errors++;
2910 ret = err;
2911 }
2912 total++;
2913 }
2914 }
2915 }
2916
2917 if (errors)
2918 pr_warn("Kprobes globally enabled, but failed to enable %d out of %d probes. Please check which kprobes are kept disabled via debugfs.\n",
2919 errors, total);
2920 else
2921 pr_info("Kprobes globally enabled\n");
2922
2923already_enabled:
2924 mutex_unlock(&kprobe_mutex);
2925 return ret;
2926}
2927
2928static int disarm_all_kprobes(void)
2929{
2930 struct hlist_head *head;
2931 struct kprobe *p;
2932 unsigned int i, total = 0, errors = 0;
2933 int err, ret = 0;
2934
2935 mutex_lock(&kprobe_mutex);
2936
2937 /* If kprobes are already disarmed, just return */
2938 if (kprobes_all_disarmed) {
2939 mutex_unlock(&kprobe_mutex);
2940 return 0;
2941 }
2942
2943 kprobes_all_disarmed = true;
2944
2945 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
2946 head = &kprobe_table[i];
2947 /* Disarm all kprobes on a best-effort basis */
2948 hlist_for_each_entry(p, head, hlist) {
2949 if (!arch_trampoline_kprobe(p) && !kprobe_disabled(p)) {
2950 err = disarm_kprobe(p, false);
2951 if (err) {
2952 errors++;
2953 ret = err;
2954 }
2955 total++;
2956 }
2957 }
2958 }
2959
2960 if (errors)
2961 pr_warn("Kprobes globally disabled, but failed to disable %d out of %d probes. Please check which kprobes are kept enabled via debugfs.\n",
2962 errors, total);
2963 else
2964 pr_info("Kprobes globally disabled\n");
2965
2966 mutex_unlock(&kprobe_mutex);
2967
2968 /* Wait for disarming all kprobes by optimizer */
2969 wait_for_kprobe_optimizer();
2970
2971 return ret;
2972}
2973
2974/*
2975 * XXX: The debugfs bool file interface doesn't allow for callbacks
2976 * when the bool state is switched. We can reuse that facility when
2977 * available
2978 */
2979static ssize_t read_enabled_file_bool(struct file *file,
2980 char __user *user_buf, size_t count, loff_t *ppos)
2981{
2982 char buf[3];
2983
2984 if (!kprobes_all_disarmed)
2985 buf[0] = '1';
2986 else
2987 buf[0] = '0';
2988 buf[1] = '\n';
2989 buf[2] = 0x00;
2990 return simple_read_from_buffer(user_buf, count, ppos, buf, 2);
2991}
2992
2993static ssize_t write_enabled_file_bool(struct file *file,
2994 const char __user *user_buf, size_t count, loff_t *ppos)
2995{
2996 bool enable;
2997 int ret;
2998
2999 ret = kstrtobool_from_user(user_buf, count, &enable);
3000 if (ret)
3001 return ret;
3002
3003 ret = enable ? arm_all_kprobes() : disarm_all_kprobes();
3004 if (ret)
3005 return ret;
3006
3007 return count;
3008}
3009
3010static const struct file_operations fops_kp = {
3011 .read = read_enabled_file_bool,
3012 .write = write_enabled_file_bool,
3013 .llseek = default_llseek,
3014};
3015
3016static int __init debugfs_kprobe_init(void)
3017{
3018 struct dentry *dir;
3019
3020 dir = debugfs_create_dir("kprobes", NULL);
3021
3022 debugfs_create_file("list", 0400, dir, NULL, &kprobes_fops);
3023
3024 debugfs_create_file("enabled", 0600, dir, NULL, &fops_kp);
3025
3026 debugfs_create_file("blacklist", 0400, dir, NULL,
3027 &kprobe_blacklist_fops);
3028
3029 return 0;
3030}
3031
3032late_initcall(debugfs_kprobe_init);
3033#endif /* CONFIG_DEBUG_FS */
1// SPDX-License-Identifier: GPL-2.0-or-later
2/*
3 * Kernel Probes (KProbes)
4 * kernel/kprobes.c
5 *
6 * Copyright (C) IBM Corporation, 2002, 2004
7 *
8 * 2002-Oct Created by Vamsi Krishna S <vamsi_krishna@in.ibm.com> Kernel
9 * Probes initial implementation (includes suggestions from
10 * Rusty Russell).
11 * 2004-Aug Updated by Prasanna S Panchamukhi <prasanna@in.ibm.com> with
12 * hlists and exceptions notifier as suggested by Andi Kleen.
13 * 2004-July Suparna Bhattacharya <suparna@in.ibm.com> added jumper probes
14 * interface to access function arguments.
15 * 2004-Sep Prasanna S Panchamukhi <prasanna@in.ibm.com> Changed Kprobes
16 * exceptions notifier to be first on the priority list.
17 * 2005-May Hien Nguyen <hien@us.ibm.com>, Jim Keniston
18 * <jkenisto@us.ibm.com> and Prasanna S Panchamukhi
19 * <prasanna@in.ibm.com> added function-return probes.
20 */
21#include <linux/kprobes.h>
22#include <linux/hash.h>
23#include <linux/init.h>
24#include <linux/slab.h>
25#include <linux/stddef.h>
26#include <linux/export.h>
27#include <linux/moduleloader.h>
28#include <linux/kallsyms.h>
29#include <linux/freezer.h>
30#include <linux/seq_file.h>
31#include <linux/debugfs.h>
32#include <linux/sysctl.h>
33#include <linux/kdebug.h>
34#include <linux/memory.h>
35#include <linux/ftrace.h>
36#include <linux/cpu.h>
37#include <linux/jump_label.h>
38#include <linux/perf_event.h>
39
40#include <asm/sections.h>
41#include <asm/cacheflush.h>
42#include <asm/errno.h>
43#include <linux/uaccess.h>
44
45#define KPROBE_HASH_BITS 6
46#define KPROBE_TABLE_SIZE (1 << KPROBE_HASH_BITS)
47
48
49static int kprobes_initialized;
50/* kprobe_table can be accessed by
51 * - Normal hlist traversal and RCU add/del under kprobe_mutex is held.
52 * Or
53 * - RCU hlist traversal under disabling preempt (breakpoint handlers)
54 */
55static struct hlist_head kprobe_table[KPROBE_TABLE_SIZE];
56static struct hlist_head kretprobe_inst_table[KPROBE_TABLE_SIZE];
57
58/* NOTE: change this value only with kprobe_mutex held */
59static bool kprobes_all_disarmed;
60
61/* This protects kprobe_table and optimizing_list */
62static DEFINE_MUTEX(kprobe_mutex);
63static DEFINE_PER_CPU(struct kprobe *, kprobe_instance) = NULL;
64static struct {
65 raw_spinlock_t lock ____cacheline_aligned_in_smp;
66} kretprobe_table_locks[KPROBE_TABLE_SIZE];
67
68kprobe_opcode_t * __weak kprobe_lookup_name(const char *name,
69 unsigned int __unused)
70{
71 return ((kprobe_opcode_t *)(kallsyms_lookup_name(name)));
72}
73
74static raw_spinlock_t *kretprobe_table_lock_ptr(unsigned long hash)
75{
76 return &(kretprobe_table_locks[hash].lock);
77}
78
79/* Blacklist -- list of struct kprobe_blacklist_entry */
80static LIST_HEAD(kprobe_blacklist);
81
82#ifdef __ARCH_WANT_KPROBES_INSN_SLOT
83/*
84 * kprobe->ainsn.insn points to the copy of the instruction to be
85 * single-stepped. x86_64, POWER4 and above have no-exec support and
86 * stepping on the instruction on a vmalloced/kmalloced/data page
87 * is a recipe for disaster
88 */
89struct kprobe_insn_page {
90 struct list_head list;
91 kprobe_opcode_t *insns; /* Page of instruction slots */
92 struct kprobe_insn_cache *cache;
93 int nused;
94 int ngarbage;
95 char slot_used[];
96};
97
98#define KPROBE_INSN_PAGE_SIZE(slots) \
99 (offsetof(struct kprobe_insn_page, slot_used) + \
100 (sizeof(char) * (slots)))
101
102static int slots_per_page(struct kprobe_insn_cache *c)
103{
104 return PAGE_SIZE/(c->insn_size * sizeof(kprobe_opcode_t));
105}
106
107enum kprobe_slot_state {
108 SLOT_CLEAN = 0,
109 SLOT_DIRTY = 1,
110 SLOT_USED = 2,
111};
112
113void __weak *alloc_insn_page(void)
114{
115 return module_alloc(PAGE_SIZE);
116}
117
118void __weak free_insn_page(void *page)
119{
120 module_memfree(page);
121}
122
123struct kprobe_insn_cache kprobe_insn_slots = {
124 .mutex = __MUTEX_INITIALIZER(kprobe_insn_slots.mutex),
125 .alloc = alloc_insn_page,
126 .free = free_insn_page,
127 .sym = KPROBE_INSN_PAGE_SYM,
128 .pages = LIST_HEAD_INIT(kprobe_insn_slots.pages),
129 .insn_size = MAX_INSN_SIZE,
130 .nr_garbage = 0,
131};
132static int collect_garbage_slots(struct kprobe_insn_cache *c);
133
134/**
135 * __get_insn_slot() - Find a slot on an executable page for an instruction.
136 * We allocate an executable page if there's no room on existing ones.
137 */
138kprobe_opcode_t *__get_insn_slot(struct kprobe_insn_cache *c)
139{
140 struct kprobe_insn_page *kip;
141 kprobe_opcode_t *slot = NULL;
142
143 /* Since the slot array is not protected by rcu, we need a mutex */
144 mutex_lock(&c->mutex);
145 retry:
146 rcu_read_lock();
147 list_for_each_entry_rcu(kip, &c->pages, list) {
148 if (kip->nused < slots_per_page(c)) {
149 int i;
150 for (i = 0; i < slots_per_page(c); i++) {
151 if (kip->slot_used[i] == SLOT_CLEAN) {
152 kip->slot_used[i] = SLOT_USED;
153 kip->nused++;
154 slot = kip->insns + (i * c->insn_size);
155 rcu_read_unlock();
156 goto out;
157 }
158 }
159 /* kip->nused is broken. Fix it. */
160 kip->nused = slots_per_page(c);
161 WARN_ON(1);
162 }
163 }
164 rcu_read_unlock();
165
166 /* If there are any garbage slots, collect it and try again. */
167 if (c->nr_garbage && collect_garbage_slots(c) == 0)
168 goto retry;
169
170 /* All out of space. Need to allocate a new page. */
171 kip = kmalloc(KPROBE_INSN_PAGE_SIZE(slots_per_page(c)), GFP_KERNEL);
172 if (!kip)
173 goto out;
174
175 /*
176 * Use module_alloc so this page is within +/- 2GB of where the
177 * kernel image and loaded module images reside. This is required
178 * so x86_64 can correctly handle the %rip-relative fixups.
179 */
180 kip->insns = c->alloc();
181 if (!kip->insns) {
182 kfree(kip);
183 goto out;
184 }
185 INIT_LIST_HEAD(&kip->list);
186 memset(kip->slot_used, SLOT_CLEAN, slots_per_page(c));
187 kip->slot_used[0] = SLOT_USED;
188 kip->nused = 1;
189 kip->ngarbage = 0;
190 kip->cache = c;
191 list_add_rcu(&kip->list, &c->pages);
192 slot = kip->insns;
193
194 /* Record the perf ksymbol register event after adding the page */
195 perf_event_ksymbol(PERF_RECORD_KSYMBOL_TYPE_OOL, (unsigned long)kip->insns,
196 PAGE_SIZE, false, c->sym);
197out:
198 mutex_unlock(&c->mutex);
199 return slot;
200}
201
202/* Return 1 if all garbages are collected, otherwise 0. */
203static int collect_one_slot(struct kprobe_insn_page *kip, int idx)
204{
205 kip->slot_used[idx] = SLOT_CLEAN;
206 kip->nused--;
207 if (kip->nused == 0) {
208 /*
209 * Page is no longer in use. Free it unless
210 * it's the last one. We keep the last one
211 * so as not to have to set it up again the
212 * next time somebody inserts a probe.
213 */
214 if (!list_is_singular(&kip->list)) {
215 /*
216 * Record perf ksymbol unregister event before removing
217 * the page.
218 */
219 perf_event_ksymbol(PERF_RECORD_KSYMBOL_TYPE_OOL,
220 (unsigned long)kip->insns, PAGE_SIZE, true,
221 kip->cache->sym);
222 list_del_rcu(&kip->list);
223 synchronize_rcu();
224 kip->cache->free(kip->insns);
225 kfree(kip);
226 }
227 return 1;
228 }
229 return 0;
230}
231
232static int collect_garbage_slots(struct kprobe_insn_cache *c)
233{
234 struct kprobe_insn_page *kip, *next;
235
236 /* Ensure no-one is interrupted on the garbages */
237 synchronize_rcu();
238
239 list_for_each_entry_safe(kip, next, &c->pages, list) {
240 int i;
241 if (kip->ngarbage == 0)
242 continue;
243 kip->ngarbage = 0; /* we will collect all garbages */
244 for (i = 0; i < slots_per_page(c); i++) {
245 if (kip->slot_used[i] == SLOT_DIRTY && collect_one_slot(kip, i))
246 break;
247 }
248 }
249 c->nr_garbage = 0;
250 return 0;
251}
252
253void __free_insn_slot(struct kprobe_insn_cache *c,
254 kprobe_opcode_t *slot, int dirty)
255{
256 struct kprobe_insn_page *kip;
257 long idx;
258
259 mutex_lock(&c->mutex);
260 rcu_read_lock();
261 list_for_each_entry_rcu(kip, &c->pages, list) {
262 idx = ((long)slot - (long)kip->insns) /
263 (c->insn_size * sizeof(kprobe_opcode_t));
264 if (idx >= 0 && idx < slots_per_page(c))
265 goto out;
266 }
267 /* Could not find this slot. */
268 WARN_ON(1);
269 kip = NULL;
270out:
271 rcu_read_unlock();
272 /* Mark and sweep: this may sleep */
273 if (kip) {
274 /* Check double free */
275 WARN_ON(kip->slot_used[idx] != SLOT_USED);
276 if (dirty) {
277 kip->slot_used[idx] = SLOT_DIRTY;
278 kip->ngarbage++;
279 if (++c->nr_garbage > slots_per_page(c))
280 collect_garbage_slots(c);
281 } else {
282 collect_one_slot(kip, idx);
283 }
284 }
285 mutex_unlock(&c->mutex);
286}
287
288/*
289 * Check given address is on the page of kprobe instruction slots.
290 * This will be used for checking whether the address on a stack
291 * is on a text area or not.
292 */
293bool __is_insn_slot_addr(struct kprobe_insn_cache *c, unsigned long addr)
294{
295 struct kprobe_insn_page *kip;
296 bool ret = false;
297
298 rcu_read_lock();
299 list_for_each_entry_rcu(kip, &c->pages, list) {
300 if (addr >= (unsigned long)kip->insns &&
301 addr < (unsigned long)kip->insns + PAGE_SIZE) {
302 ret = true;
303 break;
304 }
305 }
306 rcu_read_unlock();
307
308 return ret;
309}
310
311int kprobe_cache_get_kallsym(struct kprobe_insn_cache *c, unsigned int *symnum,
312 unsigned long *value, char *type, char *sym)
313{
314 struct kprobe_insn_page *kip;
315 int ret = -ERANGE;
316
317 rcu_read_lock();
318 list_for_each_entry_rcu(kip, &c->pages, list) {
319 if ((*symnum)--)
320 continue;
321 strlcpy(sym, c->sym, KSYM_NAME_LEN);
322 *type = 't';
323 *value = (unsigned long)kip->insns;
324 ret = 0;
325 break;
326 }
327 rcu_read_unlock();
328
329 return ret;
330}
331
332#ifdef CONFIG_OPTPROBES
333/* For optimized_kprobe buffer */
334struct kprobe_insn_cache kprobe_optinsn_slots = {
335 .mutex = __MUTEX_INITIALIZER(kprobe_optinsn_slots.mutex),
336 .alloc = alloc_insn_page,
337 .free = free_insn_page,
338 .sym = KPROBE_OPTINSN_PAGE_SYM,
339 .pages = LIST_HEAD_INIT(kprobe_optinsn_slots.pages),
340 /* .insn_size is initialized later */
341 .nr_garbage = 0,
342};
343#endif
344#endif
345
346/* We have preemption disabled.. so it is safe to use __ versions */
347static inline void set_kprobe_instance(struct kprobe *kp)
348{
349 __this_cpu_write(kprobe_instance, kp);
350}
351
352static inline void reset_kprobe_instance(void)
353{
354 __this_cpu_write(kprobe_instance, NULL);
355}
356
357/*
358 * This routine is called either:
359 * - under the kprobe_mutex - during kprobe_[un]register()
360 * OR
361 * - with preemption disabled - from arch/xxx/kernel/kprobes.c
362 */
363struct kprobe *get_kprobe(void *addr)
364{
365 struct hlist_head *head;
366 struct kprobe *p;
367
368 head = &kprobe_table[hash_ptr(addr, KPROBE_HASH_BITS)];
369 hlist_for_each_entry_rcu(p, head, hlist,
370 lockdep_is_held(&kprobe_mutex)) {
371 if (p->addr == addr)
372 return p;
373 }
374
375 return NULL;
376}
377NOKPROBE_SYMBOL(get_kprobe);
378
379static int aggr_pre_handler(struct kprobe *p, struct pt_regs *regs);
380
381/* Return true if the kprobe is an aggregator */
382static inline int kprobe_aggrprobe(struct kprobe *p)
383{
384 return p->pre_handler == aggr_pre_handler;
385}
386
387/* Return true(!0) if the kprobe is unused */
388static inline int kprobe_unused(struct kprobe *p)
389{
390 return kprobe_aggrprobe(p) && kprobe_disabled(p) &&
391 list_empty(&p->list);
392}
393
394/*
395 * Keep all fields in the kprobe consistent
396 */
397static inline void copy_kprobe(struct kprobe *ap, struct kprobe *p)
398{
399 memcpy(&p->opcode, &ap->opcode, sizeof(kprobe_opcode_t));
400 memcpy(&p->ainsn, &ap->ainsn, sizeof(struct arch_specific_insn));
401}
402
403#ifdef CONFIG_OPTPROBES
404/* NOTE: change this value only with kprobe_mutex held */
405static bool kprobes_allow_optimization;
406
407/*
408 * Call all pre_handler on the list, but ignores its return value.
409 * This must be called from arch-dep optimized caller.
410 */
411void opt_pre_handler(struct kprobe *p, struct pt_regs *regs)
412{
413 struct kprobe *kp;
414
415 list_for_each_entry_rcu(kp, &p->list, list) {
416 if (kp->pre_handler && likely(!kprobe_disabled(kp))) {
417 set_kprobe_instance(kp);
418 kp->pre_handler(kp, regs);
419 }
420 reset_kprobe_instance();
421 }
422}
423NOKPROBE_SYMBOL(opt_pre_handler);
424
425/* Free optimized instructions and optimized_kprobe */
426static void free_aggr_kprobe(struct kprobe *p)
427{
428 struct optimized_kprobe *op;
429
430 op = container_of(p, struct optimized_kprobe, kp);
431 arch_remove_optimized_kprobe(op);
432 arch_remove_kprobe(p);
433 kfree(op);
434}
435
436/* Return true(!0) if the kprobe is ready for optimization. */
437static inline int kprobe_optready(struct kprobe *p)
438{
439 struct optimized_kprobe *op;
440
441 if (kprobe_aggrprobe(p)) {
442 op = container_of(p, struct optimized_kprobe, kp);
443 return arch_prepared_optinsn(&op->optinsn);
444 }
445
446 return 0;
447}
448
449/* Return true(!0) if the kprobe is disarmed. Note: p must be on hash list */
450static inline int kprobe_disarmed(struct kprobe *p)
451{
452 struct optimized_kprobe *op;
453
454 /* If kprobe is not aggr/opt probe, just return kprobe is disabled */
455 if (!kprobe_aggrprobe(p))
456 return kprobe_disabled(p);
457
458 op = container_of(p, struct optimized_kprobe, kp);
459
460 return kprobe_disabled(p) && list_empty(&op->list);
461}
462
463/* Return true(!0) if the probe is queued on (un)optimizing lists */
464static int kprobe_queued(struct kprobe *p)
465{
466 struct optimized_kprobe *op;
467
468 if (kprobe_aggrprobe(p)) {
469 op = container_of(p, struct optimized_kprobe, kp);
470 if (!list_empty(&op->list))
471 return 1;
472 }
473 return 0;
474}
475
476/*
477 * Return an optimized kprobe whose optimizing code replaces
478 * instructions including addr (exclude breakpoint).
479 */
480static struct kprobe *get_optimized_kprobe(unsigned long addr)
481{
482 int i;
483 struct kprobe *p = NULL;
484 struct optimized_kprobe *op;
485
486 /* Don't check i == 0, since that is a breakpoint case. */
487 for (i = 1; !p && i < MAX_OPTIMIZED_LENGTH; i++)
488 p = get_kprobe((void *)(addr - i));
489
490 if (p && kprobe_optready(p)) {
491 op = container_of(p, struct optimized_kprobe, kp);
492 if (arch_within_optimized_kprobe(op, addr))
493 return p;
494 }
495
496 return NULL;
497}
498
499/* Optimization staging list, protected by kprobe_mutex */
500static LIST_HEAD(optimizing_list);
501static LIST_HEAD(unoptimizing_list);
502static LIST_HEAD(freeing_list);
503
504static void kprobe_optimizer(struct work_struct *work);
505static DECLARE_DELAYED_WORK(optimizing_work, kprobe_optimizer);
506#define OPTIMIZE_DELAY 5
507
508/*
509 * Optimize (replace a breakpoint with a jump) kprobes listed on
510 * optimizing_list.
511 */
512static void do_optimize_kprobes(void)
513{
514 lockdep_assert_held(&text_mutex);
515 /*
516 * The optimization/unoptimization refers online_cpus via
517 * stop_machine() and cpu-hotplug modifies online_cpus.
518 * And same time, text_mutex will be held in cpu-hotplug and here.
519 * This combination can cause a deadlock (cpu-hotplug try to lock
520 * text_mutex but stop_machine can not be done because online_cpus
521 * has been changed)
522 * To avoid this deadlock, caller must have locked cpu hotplug
523 * for preventing cpu-hotplug outside of text_mutex locking.
524 */
525 lockdep_assert_cpus_held();
526
527 /* Optimization never be done when disarmed */
528 if (kprobes_all_disarmed || !kprobes_allow_optimization ||
529 list_empty(&optimizing_list))
530 return;
531
532 arch_optimize_kprobes(&optimizing_list);
533}
534
535/*
536 * Unoptimize (replace a jump with a breakpoint and remove the breakpoint
537 * if need) kprobes listed on unoptimizing_list.
538 */
539static void do_unoptimize_kprobes(void)
540{
541 struct optimized_kprobe *op, *tmp;
542
543 lockdep_assert_held(&text_mutex);
544 /* See comment in do_optimize_kprobes() */
545 lockdep_assert_cpus_held();
546
547 /* Unoptimization must be done anytime */
548 if (list_empty(&unoptimizing_list))
549 return;
550
551 arch_unoptimize_kprobes(&unoptimizing_list, &freeing_list);
552 /* Loop free_list for disarming */
553 list_for_each_entry_safe(op, tmp, &freeing_list, list) {
554 /* Switching from detour code to origin */
555 op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
556 /* Disarm probes if marked disabled */
557 if (kprobe_disabled(&op->kp))
558 arch_disarm_kprobe(&op->kp);
559 if (kprobe_unused(&op->kp)) {
560 /*
561 * Remove unused probes from hash list. After waiting
562 * for synchronization, these probes are reclaimed.
563 * (reclaiming is done by do_free_cleaned_kprobes.)
564 */
565 hlist_del_rcu(&op->kp.hlist);
566 } else
567 list_del_init(&op->list);
568 }
569}
570
571/* Reclaim all kprobes on the free_list */
572static void do_free_cleaned_kprobes(void)
573{
574 struct optimized_kprobe *op, *tmp;
575
576 list_for_each_entry_safe(op, tmp, &freeing_list, list) {
577 list_del_init(&op->list);
578 if (WARN_ON_ONCE(!kprobe_unused(&op->kp))) {
579 /*
580 * This must not happen, but if there is a kprobe
581 * still in use, keep it on kprobes hash list.
582 */
583 continue;
584 }
585 free_aggr_kprobe(&op->kp);
586 }
587}
588
589/* Start optimizer after OPTIMIZE_DELAY passed */
590static void kick_kprobe_optimizer(void)
591{
592 schedule_delayed_work(&optimizing_work, OPTIMIZE_DELAY);
593}
594
595/* Kprobe jump optimizer */
596static void kprobe_optimizer(struct work_struct *work)
597{
598 mutex_lock(&kprobe_mutex);
599 cpus_read_lock();
600 mutex_lock(&text_mutex);
601
602 /*
603 * Step 1: Unoptimize kprobes and collect cleaned (unused and disarmed)
604 * kprobes before waiting for quiesence period.
605 */
606 do_unoptimize_kprobes();
607
608 /*
609 * Step 2: Wait for quiesence period to ensure all potentially
610 * preempted tasks to have normally scheduled. Because optprobe
611 * may modify multiple instructions, there is a chance that Nth
612 * instruction is preempted. In that case, such tasks can return
613 * to 2nd-Nth byte of jump instruction. This wait is for avoiding it.
614 * Note that on non-preemptive kernel, this is transparently converted
615 * to synchronoze_sched() to wait for all interrupts to have completed.
616 */
617 synchronize_rcu_tasks();
618
619 /* Step 3: Optimize kprobes after quiesence period */
620 do_optimize_kprobes();
621
622 /* Step 4: Free cleaned kprobes after quiesence period */
623 do_free_cleaned_kprobes();
624
625 mutex_unlock(&text_mutex);
626 cpus_read_unlock();
627
628 /* Step 5: Kick optimizer again if needed */
629 if (!list_empty(&optimizing_list) || !list_empty(&unoptimizing_list))
630 kick_kprobe_optimizer();
631
632 mutex_unlock(&kprobe_mutex);
633}
634
635/* Wait for completing optimization and unoptimization */
636void wait_for_kprobe_optimizer(void)
637{
638 mutex_lock(&kprobe_mutex);
639
640 while (!list_empty(&optimizing_list) || !list_empty(&unoptimizing_list)) {
641 mutex_unlock(&kprobe_mutex);
642
643 /* this will also make optimizing_work execute immmediately */
644 flush_delayed_work(&optimizing_work);
645 /* @optimizing_work might not have been queued yet, relax */
646 cpu_relax();
647
648 mutex_lock(&kprobe_mutex);
649 }
650
651 mutex_unlock(&kprobe_mutex);
652}
653
654static bool optprobe_queued_unopt(struct optimized_kprobe *op)
655{
656 struct optimized_kprobe *_op;
657
658 list_for_each_entry(_op, &unoptimizing_list, list) {
659 if (op == _op)
660 return true;
661 }
662
663 return false;
664}
665
666/* Optimize kprobe if p is ready to be optimized */
667static void optimize_kprobe(struct kprobe *p)
668{
669 struct optimized_kprobe *op;
670
671 /* Check if the kprobe is disabled or not ready for optimization. */
672 if (!kprobe_optready(p) || !kprobes_allow_optimization ||
673 (kprobe_disabled(p) || kprobes_all_disarmed))
674 return;
675
676 /* kprobes with post_handler can not be optimized */
677 if (p->post_handler)
678 return;
679
680 op = container_of(p, struct optimized_kprobe, kp);
681
682 /* Check there is no other kprobes at the optimized instructions */
683 if (arch_check_optimized_kprobe(op) < 0)
684 return;
685
686 /* Check if it is already optimized. */
687 if (op->kp.flags & KPROBE_FLAG_OPTIMIZED) {
688 if (optprobe_queued_unopt(op)) {
689 /* This is under unoptimizing. Just dequeue the probe */
690 list_del_init(&op->list);
691 }
692 return;
693 }
694 op->kp.flags |= KPROBE_FLAG_OPTIMIZED;
695
696 /* On unoptimizing/optimizing_list, op must have OPTIMIZED flag */
697 if (WARN_ON_ONCE(!list_empty(&op->list)))
698 return;
699
700 list_add(&op->list, &optimizing_list);
701 kick_kprobe_optimizer();
702}
703
704/* Short cut to direct unoptimizing */
705static void force_unoptimize_kprobe(struct optimized_kprobe *op)
706{
707 lockdep_assert_cpus_held();
708 arch_unoptimize_kprobe(op);
709 op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
710}
711
712/* Unoptimize a kprobe if p is optimized */
713static void unoptimize_kprobe(struct kprobe *p, bool force)
714{
715 struct optimized_kprobe *op;
716
717 if (!kprobe_aggrprobe(p) || kprobe_disarmed(p))
718 return; /* This is not an optprobe nor optimized */
719
720 op = container_of(p, struct optimized_kprobe, kp);
721 if (!kprobe_optimized(p))
722 return;
723
724 if (!list_empty(&op->list)) {
725 if (optprobe_queued_unopt(op)) {
726 /* Queued in unoptimizing queue */
727 if (force) {
728 /*
729 * Forcibly unoptimize the kprobe here, and queue it
730 * in the freeing list for release afterwards.
731 */
732 force_unoptimize_kprobe(op);
733 list_move(&op->list, &freeing_list);
734 }
735 } else {
736 /* Dequeue from the optimizing queue */
737 list_del_init(&op->list);
738 op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
739 }
740 return;
741 }
742
743 /* Optimized kprobe case */
744 if (force) {
745 /* Forcibly update the code: this is a special case */
746 force_unoptimize_kprobe(op);
747 } else {
748 list_add(&op->list, &unoptimizing_list);
749 kick_kprobe_optimizer();
750 }
751}
752
753/* Cancel unoptimizing for reusing */
754static int reuse_unused_kprobe(struct kprobe *ap)
755{
756 struct optimized_kprobe *op;
757
758 /*
759 * Unused kprobe MUST be on the way of delayed unoptimizing (means
760 * there is still a relative jump) and disabled.
761 */
762 op = container_of(ap, struct optimized_kprobe, kp);
763 WARN_ON_ONCE(list_empty(&op->list));
764 /* Enable the probe again */
765 ap->flags &= ~KPROBE_FLAG_DISABLED;
766 /* Optimize it again (remove from op->list) */
767 if (!kprobe_optready(ap))
768 return -EINVAL;
769
770 optimize_kprobe(ap);
771 return 0;
772}
773
774/* Remove optimized instructions */
775static void kill_optimized_kprobe(struct kprobe *p)
776{
777 struct optimized_kprobe *op;
778
779 op = container_of(p, struct optimized_kprobe, kp);
780 if (!list_empty(&op->list))
781 /* Dequeue from the (un)optimization queue */
782 list_del_init(&op->list);
783 op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
784
785 if (kprobe_unused(p)) {
786 /* Enqueue if it is unused */
787 list_add(&op->list, &freeing_list);
788 /*
789 * Remove unused probes from the hash list. After waiting
790 * for synchronization, this probe is reclaimed.
791 * (reclaiming is done by do_free_cleaned_kprobes().)
792 */
793 hlist_del_rcu(&op->kp.hlist);
794 }
795
796 /* Don't touch the code, because it is already freed. */
797 arch_remove_optimized_kprobe(op);
798}
799
800static inline
801void __prepare_optimized_kprobe(struct optimized_kprobe *op, struct kprobe *p)
802{
803 if (!kprobe_ftrace(p))
804 arch_prepare_optimized_kprobe(op, p);
805}
806
807/* Try to prepare optimized instructions */
808static void prepare_optimized_kprobe(struct kprobe *p)
809{
810 struct optimized_kprobe *op;
811
812 op = container_of(p, struct optimized_kprobe, kp);
813 __prepare_optimized_kprobe(op, p);
814}
815
816/* Allocate new optimized_kprobe and try to prepare optimized instructions */
817static struct kprobe *alloc_aggr_kprobe(struct kprobe *p)
818{
819 struct optimized_kprobe *op;
820
821 op = kzalloc(sizeof(struct optimized_kprobe), GFP_KERNEL);
822 if (!op)
823 return NULL;
824
825 INIT_LIST_HEAD(&op->list);
826 op->kp.addr = p->addr;
827 __prepare_optimized_kprobe(op, p);
828
829 return &op->kp;
830}
831
832static void init_aggr_kprobe(struct kprobe *ap, struct kprobe *p);
833
834/*
835 * Prepare an optimized_kprobe and optimize it
836 * NOTE: p must be a normal registered kprobe
837 */
838static void try_to_optimize_kprobe(struct kprobe *p)
839{
840 struct kprobe *ap;
841 struct optimized_kprobe *op;
842
843 /* Impossible to optimize ftrace-based kprobe */
844 if (kprobe_ftrace(p))
845 return;
846
847 /* For preparing optimization, jump_label_text_reserved() is called */
848 cpus_read_lock();
849 jump_label_lock();
850 mutex_lock(&text_mutex);
851
852 ap = alloc_aggr_kprobe(p);
853 if (!ap)
854 goto out;
855
856 op = container_of(ap, struct optimized_kprobe, kp);
857 if (!arch_prepared_optinsn(&op->optinsn)) {
858 /* If failed to setup optimizing, fallback to kprobe */
859 arch_remove_optimized_kprobe(op);
860 kfree(op);
861 goto out;
862 }
863
864 init_aggr_kprobe(ap, p);
865 optimize_kprobe(ap); /* This just kicks optimizer thread */
866
867out:
868 mutex_unlock(&text_mutex);
869 jump_label_unlock();
870 cpus_read_unlock();
871}
872
873#ifdef CONFIG_SYSCTL
874static void optimize_all_kprobes(void)
875{
876 struct hlist_head *head;
877 struct kprobe *p;
878 unsigned int i;
879
880 mutex_lock(&kprobe_mutex);
881 /* If optimization is already allowed, just return */
882 if (kprobes_allow_optimization)
883 goto out;
884
885 cpus_read_lock();
886 kprobes_allow_optimization = true;
887 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
888 head = &kprobe_table[i];
889 hlist_for_each_entry(p, head, hlist)
890 if (!kprobe_disabled(p))
891 optimize_kprobe(p);
892 }
893 cpus_read_unlock();
894 printk(KERN_INFO "Kprobes globally optimized\n");
895out:
896 mutex_unlock(&kprobe_mutex);
897}
898
899static void unoptimize_all_kprobes(void)
900{
901 struct hlist_head *head;
902 struct kprobe *p;
903 unsigned int i;
904
905 mutex_lock(&kprobe_mutex);
906 /* If optimization is already prohibited, just return */
907 if (!kprobes_allow_optimization) {
908 mutex_unlock(&kprobe_mutex);
909 return;
910 }
911
912 cpus_read_lock();
913 kprobes_allow_optimization = false;
914 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
915 head = &kprobe_table[i];
916 hlist_for_each_entry(p, head, hlist) {
917 if (!kprobe_disabled(p))
918 unoptimize_kprobe(p, false);
919 }
920 }
921 cpus_read_unlock();
922 mutex_unlock(&kprobe_mutex);
923
924 /* Wait for unoptimizing completion */
925 wait_for_kprobe_optimizer();
926 printk(KERN_INFO "Kprobes globally unoptimized\n");
927}
928
929static DEFINE_MUTEX(kprobe_sysctl_mutex);
930int sysctl_kprobes_optimization;
931int proc_kprobes_optimization_handler(struct ctl_table *table, int write,
932 void *buffer, size_t *length,
933 loff_t *ppos)
934{
935 int ret;
936
937 mutex_lock(&kprobe_sysctl_mutex);
938 sysctl_kprobes_optimization = kprobes_allow_optimization ? 1 : 0;
939 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
940
941 if (sysctl_kprobes_optimization)
942 optimize_all_kprobes();
943 else
944 unoptimize_all_kprobes();
945 mutex_unlock(&kprobe_sysctl_mutex);
946
947 return ret;
948}
949#endif /* CONFIG_SYSCTL */
950
951/* Put a breakpoint for a probe. Must be called with text_mutex locked */
952static void __arm_kprobe(struct kprobe *p)
953{
954 struct kprobe *_p;
955
956 /* Check collision with other optimized kprobes */
957 _p = get_optimized_kprobe((unsigned long)p->addr);
958 if (unlikely(_p))
959 /* Fallback to unoptimized kprobe */
960 unoptimize_kprobe(_p, true);
961
962 arch_arm_kprobe(p);
963 optimize_kprobe(p); /* Try to optimize (add kprobe to a list) */
964}
965
966/* Remove the breakpoint of a probe. Must be called with text_mutex locked */
967static void __disarm_kprobe(struct kprobe *p, bool reopt)
968{
969 struct kprobe *_p;
970
971 /* Try to unoptimize */
972 unoptimize_kprobe(p, kprobes_all_disarmed);
973
974 if (!kprobe_queued(p)) {
975 arch_disarm_kprobe(p);
976 /* If another kprobe was blocked, optimize it. */
977 _p = get_optimized_kprobe((unsigned long)p->addr);
978 if (unlikely(_p) && reopt)
979 optimize_kprobe(_p);
980 }
981 /* TODO: reoptimize others after unoptimized this probe */
982}
983
984#else /* !CONFIG_OPTPROBES */
985
986#define optimize_kprobe(p) do {} while (0)
987#define unoptimize_kprobe(p, f) do {} while (0)
988#define kill_optimized_kprobe(p) do {} while (0)
989#define prepare_optimized_kprobe(p) do {} while (0)
990#define try_to_optimize_kprobe(p) do {} while (0)
991#define __arm_kprobe(p) arch_arm_kprobe(p)
992#define __disarm_kprobe(p, o) arch_disarm_kprobe(p)
993#define kprobe_disarmed(p) kprobe_disabled(p)
994#define wait_for_kprobe_optimizer() do {} while (0)
995
996static int reuse_unused_kprobe(struct kprobe *ap)
997{
998 /*
999 * If the optimized kprobe is NOT supported, the aggr kprobe is
1000 * released at the same time that the last aggregated kprobe is
1001 * unregistered.
1002 * Thus there should be no chance to reuse unused kprobe.
1003 */
1004 printk(KERN_ERR "Error: There should be no unused kprobe here.\n");
1005 return -EINVAL;
1006}
1007
1008static void free_aggr_kprobe(struct kprobe *p)
1009{
1010 arch_remove_kprobe(p);
1011 kfree(p);
1012}
1013
1014static struct kprobe *alloc_aggr_kprobe(struct kprobe *p)
1015{
1016 return kzalloc(sizeof(struct kprobe), GFP_KERNEL);
1017}
1018#endif /* CONFIG_OPTPROBES */
1019
1020#ifdef CONFIG_KPROBES_ON_FTRACE
1021static struct ftrace_ops kprobe_ftrace_ops __read_mostly = {
1022 .func = kprobe_ftrace_handler,
1023 .flags = FTRACE_OPS_FL_SAVE_REGS,
1024};
1025
1026static struct ftrace_ops kprobe_ipmodify_ops __read_mostly = {
1027 .func = kprobe_ftrace_handler,
1028 .flags = FTRACE_OPS_FL_SAVE_REGS | FTRACE_OPS_FL_IPMODIFY,
1029};
1030
1031static int kprobe_ipmodify_enabled;
1032static int kprobe_ftrace_enabled;
1033
1034/* Must ensure p->addr is really on ftrace */
1035static int prepare_kprobe(struct kprobe *p)
1036{
1037 if (!kprobe_ftrace(p))
1038 return arch_prepare_kprobe(p);
1039
1040 return arch_prepare_kprobe_ftrace(p);
1041}
1042
1043/* Caller must lock kprobe_mutex */
1044static int __arm_kprobe_ftrace(struct kprobe *p, struct ftrace_ops *ops,
1045 int *cnt)
1046{
1047 int ret = 0;
1048
1049 ret = ftrace_set_filter_ip(ops, (unsigned long)p->addr, 0, 0);
1050 if (ret) {
1051 pr_debug("Failed to arm kprobe-ftrace at %pS (%d)\n",
1052 p->addr, ret);
1053 return ret;
1054 }
1055
1056 if (*cnt == 0) {
1057 ret = register_ftrace_function(ops);
1058 if (ret) {
1059 pr_debug("Failed to init kprobe-ftrace (%d)\n", ret);
1060 goto err_ftrace;
1061 }
1062 }
1063
1064 (*cnt)++;
1065 return ret;
1066
1067err_ftrace:
1068 /*
1069 * At this point, sinec ops is not registered, we should be sefe from
1070 * registering empty filter.
1071 */
1072 ftrace_set_filter_ip(ops, (unsigned long)p->addr, 1, 0);
1073 return ret;
1074}
1075
1076static int arm_kprobe_ftrace(struct kprobe *p)
1077{
1078 bool ipmodify = (p->post_handler != NULL);
1079
1080 return __arm_kprobe_ftrace(p,
1081 ipmodify ? &kprobe_ipmodify_ops : &kprobe_ftrace_ops,
1082 ipmodify ? &kprobe_ipmodify_enabled : &kprobe_ftrace_enabled);
1083}
1084
1085/* Caller must lock kprobe_mutex */
1086static int __disarm_kprobe_ftrace(struct kprobe *p, struct ftrace_ops *ops,
1087 int *cnt)
1088{
1089 int ret = 0;
1090
1091 if (*cnt == 1) {
1092 ret = unregister_ftrace_function(ops);
1093 if (WARN(ret < 0, "Failed to unregister kprobe-ftrace (%d)\n", ret))
1094 return ret;
1095 }
1096
1097 (*cnt)--;
1098
1099 ret = ftrace_set_filter_ip(ops, (unsigned long)p->addr, 1, 0);
1100 WARN_ONCE(ret < 0, "Failed to disarm kprobe-ftrace at %pS (%d)\n",
1101 p->addr, ret);
1102 return ret;
1103}
1104
1105static int disarm_kprobe_ftrace(struct kprobe *p)
1106{
1107 bool ipmodify = (p->post_handler != NULL);
1108
1109 return __disarm_kprobe_ftrace(p,
1110 ipmodify ? &kprobe_ipmodify_ops : &kprobe_ftrace_ops,
1111 ipmodify ? &kprobe_ipmodify_enabled : &kprobe_ftrace_enabled);
1112}
1113#else /* !CONFIG_KPROBES_ON_FTRACE */
1114static inline int prepare_kprobe(struct kprobe *p)
1115{
1116 return arch_prepare_kprobe(p);
1117}
1118
1119static inline int arm_kprobe_ftrace(struct kprobe *p)
1120{
1121 return -ENODEV;
1122}
1123
1124static inline int disarm_kprobe_ftrace(struct kprobe *p)
1125{
1126 return -ENODEV;
1127}
1128#endif
1129
1130/* Arm a kprobe with text_mutex */
1131static int arm_kprobe(struct kprobe *kp)
1132{
1133 if (unlikely(kprobe_ftrace(kp)))
1134 return arm_kprobe_ftrace(kp);
1135
1136 cpus_read_lock();
1137 mutex_lock(&text_mutex);
1138 __arm_kprobe(kp);
1139 mutex_unlock(&text_mutex);
1140 cpus_read_unlock();
1141
1142 return 0;
1143}
1144
1145/* Disarm a kprobe with text_mutex */
1146static int disarm_kprobe(struct kprobe *kp, bool reopt)
1147{
1148 if (unlikely(kprobe_ftrace(kp)))
1149 return disarm_kprobe_ftrace(kp);
1150
1151 cpus_read_lock();
1152 mutex_lock(&text_mutex);
1153 __disarm_kprobe(kp, reopt);
1154 mutex_unlock(&text_mutex);
1155 cpus_read_unlock();
1156
1157 return 0;
1158}
1159
1160/*
1161 * Aggregate handlers for multiple kprobes support - these handlers
1162 * take care of invoking the individual kprobe handlers on p->list
1163 */
1164static int aggr_pre_handler(struct kprobe *p, struct pt_regs *regs)
1165{
1166 struct kprobe *kp;
1167
1168 list_for_each_entry_rcu(kp, &p->list, list) {
1169 if (kp->pre_handler && likely(!kprobe_disabled(kp))) {
1170 set_kprobe_instance(kp);
1171 if (kp->pre_handler(kp, regs))
1172 return 1;
1173 }
1174 reset_kprobe_instance();
1175 }
1176 return 0;
1177}
1178NOKPROBE_SYMBOL(aggr_pre_handler);
1179
1180static void aggr_post_handler(struct kprobe *p, struct pt_regs *regs,
1181 unsigned long flags)
1182{
1183 struct kprobe *kp;
1184
1185 list_for_each_entry_rcu(kp, &p->list, list) {
1186 if (kp->post_handler && likely(!kprobe_disabled(kp))) {
1187 set_kprobe_instance(kp);
1188 kp->post_handler(kp, regs, flags);
1189 reset_kprobe_instance();
1190 }
1191 }
1192}
1193NOKPROBE_SYMBOL(aggr_post_handler);
1194
1195static int aggr_fault_handler(struct kprobe *p, struct pt_regs *regs,
1196 int trapnr)
1197{
1198 struct kprobe *cur = __this_cpu_read(kprobe_instance);
1199
1200 /*
1201 * if we faulted "during" the execution of a user specified
1202 * probe handler, invoke just that probe's fault handler
1203 */
1204 if (cur && cur->fault_handler) {
1205 if (cur->fault_handler(cur, regs, trapnr))
1206 return 1;
1207 }
1208 return 0;
1209}
1210NOKPROBE_SYMBOL(aggr_fault_handler);
1211
1212/* Walks the list and increments nmissed count for multiprobe case */
1213void kprobes_inc_nmissed_count(struct kprobe *p)
1214{
1215 struct kprobe *kp;
1216 if (!kprobe_aggrprobe(p)) {
1217 p->nmissed++;
1218 } else {
1219 list_for_each_entry_rcu(kp, &p->list, list)
1220 kp->nmissed++;
1221 }
1222 return;
1223}
1224NOKPROBE_SYMBOL(kprobes_inc_nmissed_count);
1225
1226void recycle_rp_inst(struct kretprobe_instance *ri,
1227 struct hlist_head *head)
1228{
1229 struct kretprobe *rp = ri->rp;
1230
1231 /* remove rp inst off the rprobe_inst_table */
1232 hlist_del(&ri->hlist);
1233 INIT_HLIST_NODE(&ri->hlist);
1234 if (likely(rp)) {
1235 raw_spin_lock(&rp->lock);
1236 hlist_add_head(&ri->hlist, &rp->free_instances);
1237 raw_spin_unlock(&rp->lock);
1238 } else
1239 /* Unregistering */
1240 hlist_add_head(&ri->hlist, head);
1241}
1242NOKPROBE_SYMBOL(recycle_rp_inst);
1243
1244void kretprobe_hash_lock(struct task_struct *tsk,
1245 struct hlist_head **head, unsigned long *flags)
1246__acquires(hlist_lock)
1247{
1248 unsigned long hash = hash_ptr(tsk, KPROBE_HASH_BITS);
1249 raw_spinlock_t *hlist_lock;
1250
1251 *head = &kretprobe_inst_table[hash];
1252 hlist_lock = kretprobe_table_lock_ptr(hash);
1253 raw_spin_lock_irqsave(hlist_lock, *flags);
1254}
1255NOKPROBE_SYMBOL(kretprobe_hash_lock);
1256
1257static void kretprobe_table_lock(unsigned long hash,
1258 unsigned long *flags)
1259__acquires(hlist_lock)
1260{
1261 raw_spinlock_t *hlist_lock = kretprobe_table_lock_ptr(hash);
1262 raw_spin_lock_irqsave(hlist_lock, *flags);
1263}
1264NOKPROBE_SYMBOL(kretprobe_table_lock);
1265
1266void kretprobe_hash_unlock(struct task_struct *tsk,
1267 unsigned long *flags)
1268__releases(hlist_lock)
1269{
1270 unsigned long hash = hash_ptr(tsk, KPROBE_HASH_BITS);
1271 raw_spinlock_t *hlist_lock;
1272
1273 hlist_lock = kretprobe_table_lock_ptr(hash);
1274 raw_spin_unlock_irqrestore(hlist_lock, *flags);
1275}
1276NOKPROBE_SYMBOL(kretprobe_hash_unlock);
1277
1278static void kretprobe_table_unlock(unsigned long hash,
1279 unsigned long *flags)
1280__releases(hlist_lock)
1281{
1282 raw_spinlock_t *hlist_lock = kretprobe_table_lock_ptr(hash);
1283 raw_spin_unlock_irqrestore(hlist_lock, *flags);
1284}
1285NOKPROBE_SYMBOL(kretprobe_table_unlock);
1286
1287struct kprobe kprobe_busy = {
1288 .addr = (void *) get_kprobe,
1289};
1290
1291void kprobe_busy_begin(void)
1292{
1293 struct kprobe_ctlblk *kcb;
1294
1295 preempt_disable();
1296 __this_cpu_write(current_kprobe, &kprobe_busy);
1297 kcb = get_kprobe_ctlblk();
1298 kcb->kprobe_status = KPROBE_HIT_ACTIVE;
1299}
1300
1301void kprobe_busy_end(void)
1302{
1303 __this_cpu_write(current_kprobe, NULL);
1304 preempt_enable();
1305}
1306
1307/*
1308 * This function is called from finish_task_switch when task tk becomes dead,
1309 * so that we can recycle any function-return probe instances associated
1310 * with this task. These left over instances represent probed functions
1311 * that have been called but will never return.
1312 */
1313void kprobe_flush_task(struct task_struct *tk)
1314{
1315 struct kretprobe_instance *ri;
1316 struct hlist_head *head, empty_rp;
1317 struct hlist_node *tmp;
1318 unsigned long hash, flags = 0;
1319
1320 if (unlikely(!kprobes_initialized))
1321 /* Early boot. kretprobe_table_locks not yet initialized. */
1322 return;
1323
1324 kprobe_busy_begin();
1325
1326 INIT_HLIST_HEAD(&empty_rp);
1327 hash = hash_ptr(tk, KPROBE_HASH_BITS);
1328 head = &kretprobe_inst_table[hash];
1329 kretprobe_table_lock(hash, &flags);
1330 hlist_for_each_entry_safe(ri, tmp, head, hlist) {
1331 if (ri->task == tk)
1332 recycle_rp_inst(ri, &empty_rp);
1333 }
1334 kretprobe_table_unlock(hash, &flags);
1335 hlist_for_each_entry_safe(ri, tmp, &empty_rp, hlist) {
1336 hlist_del(&ri->hlist);
1337 kfree(ri);
1338 }
1339
1340 kprobe_busy_end();
1341}
1342NOKPROBE_SYMBOL(kprobe_flush_task);
1343
1344static inline void free_rp_inst(struct kretprobe *rp)
1345{
1346 struct kretprobe_instance *ri;
1347 struct hlist_node *next;
1348
1349 hlist_for_each_entry_safe(ri, next, &rp->free_instances, hlist) {
1350 hlist_del(&ri->hlist);
1351 kfree(ri);
1352 }
1353}
1354
1355static void cleanup_rp_inst(struct kretprobe *rp)
1356{
1357 unsigned long flags, hash;
1358 struct kretprobe_instance *ri;
1359 struct hlist_node *next;
1360 struct hlist_head *head;
1361
1362 /* No race here */
1363 for (hash = 0; hash < KPROBE_TABLE_SIZE; hash++) {
1364 kretprobe_table_lock(hash, &flags);
1365 head = &kretprobe_inst_table[hash];
1366 hlist_for_each_entry_safe(ri, next, head, hlist) {
1367 if (ri->rp == rp)
1368 ri->rp = NULL;
1369 }
1370 kretprobe_table_unlock(hash, &flags);
1371 }
1372 free_rp_inst(rp);
1373}
1374NOKPROBE_SYMBOL(cleanup_rp_inst);
1375
1376/* Add the new probe to ap->list */
1377static int add_new_kprobe(struct kprobe *ap, struct kprobe *p)
1378{
1379 if (p->post_handler)
1380 unoptimize_kprobe(ap, true); /* Fall back to normal kprobe */
1381
1382 list_add_rcu(&p->list, &ap->list);
1383 if (p->post_handler && !ap->post_handler)
1384 ap->post_handler = aggr_post_handler;
1385
1386 return 0;
1387}
1388
1389/*
1390 * Fill in the required fields of the "manager kprobe". Replace the
1391 * earlier kprobe in the hlist with the manager kprobe
1392 */
1393static void init_aggr_kprobe(struct kprobe *ap, struct kprobe *p)
1394{
1395 /* Copy p's insn slot to ap */
1396 copy_kprobe(p, ap);
1397 flush_insn_slot(ap);
1398 ap->addr = p->addr;
1399 ap->flags = p->flags & ~KPROBE_FLAG_OPTIMIZED;
1400 ap->pre_handler = aggr_pre_handler;
1401 ap->fault_handler = aggr_fault_handler;
1402 /* We don't care the kprobe which has gone. */
1403 if (p->post_handler && !kprobe_gone(p))
1404 ap->post_handler = aggr_post_handler;
1405
1406 INIT_LIST_HEAD(&ap->list);
1407 INIT_HLIST_NODE(&ap->hlist);
1408
1409 list_add_rcu(&p->list, &ap->list);
1410 hlist_replace_rcu(&p->hlist, &ap->hlist);
1411}
1412
1413/*
1414 * This is the second or subsequent kprobe at the address - handle
1415 * the intricacies
1416 */
1417static int register_aggr_kprobe(struct kprobe *orig_p, struct kprobe *p)
1418{
1419 int ret = 0;
1420 struct kprobe *ap = orig_p;
1421
1422 cpus_read_lock();
1423
1424 /* For preparing optimization, jump_label_text_reserved() is called */
1425 jump_label_lock();
1426 mutex_lock(&text_mutex);
1427
1428 if (!kprobe_aggrprobe(orig_p)) {
1429 /* If orig_p is not an aggr_kprobe, create new aggr_kprobe. */
1430 ap = alloc_aggr_kprobe(orig_p);
1431 if (!ap) {
1432 ret = -ENOMEM;
1433 goto out;
1434 }
1435 init_aggr_kprobe(ap, orig_p);
1436 } else if (kprobe_unused(ap)) {
1437 /* This probe is going to die. Rescue it */
1438 ret = reuse_unused_kprobe(ap);
1439 if (ret)
1440 goto out;
1441 }
1442
1443 if (kprobe_gone(ap)) {
1444 /*
1445 * Attempting to insert new probe at the same location that
1446 * had a probe in the module vaddr area which already
1447 * freed. So, the instruction slot has already been
1448 * released. We need a new slot for the new probe.
1449 */
1450 ret = arch_prepare_kprobe(ap);
1451 if (ret)
1452 /*
1453 * Even if fail to allocate new slot, don't need to
1454 * free aggr_probe. It will be used next time, or
1455 * freed by unregister_kprobe.
1456 */
1457 goto out;
1458
1459 /* Prepare optimized instructions if possible. */
1460 prepare_optimized_kprobe(ap);
1461
1462 /*
1463 * Clear gone flag to prevent allocating new slot again, and
1464 * set disabled flag because it is not armed yet.
1465 */
1466 ap->flags = (ap->flags & ~KPROBE_FLAG_GONE)
1467 | KPROBE_FLAG_DISABLED;
1468 }
1469
1470 /* Copy ap's insn slot to p */
1471 copy_kprobe(ap, p);
1472 ret = add_new_kprobe(ap, p);
1473
1474out:
1475 mutex_unlock(&text_mutex);
1476 jump_label_unlock();
1477 cpus_read_unlock();
1478
1479 if (ret == 0 && kprobe_disabled(ap) && !kprobe_disabled(p)) {
1480 ap->flags &= ~KPROBE_FLAG_DISABLED;
1481 if (!kprobes_all_disarmed) {
1482 /* Arm the breakpoint again. */
1483 ret = arm_kprobe(ap);
1484 if (ret) {
1485 ap->flags |= KPROBE_FLAG_DISABLED;
1486 list_del_rcu(&p->list);
1487 synchronize_rcu();
1488 }
1489 }
1490 }
1491 return ret;
1492}
1493
1494bool __weak arch_within_kprobe_blacklist(unsigned long addr)
1495{
1496 /* The __kprobes marked functions and entry code must not be probed */
1497 return addr >= (unsigned long)__kprobes_text_start &&
1498 addr < (unsigned long)__kprobes_text_end;
1499}
1500
1501static bool __within_kprobe_blacklist(unsigned long addr)
1502{
1503 struct kprobe_blacklist_entry *ent;
1504
1505 if (arch_within_kprobe_blacklist(addr))
1506 return true;
1507 /*
1508 * If there exists a kprobe_blacklist, verify and
1509 * fail any probe registration in the prohibited area
1510 */
1511 list_for_each_entry(ent, &kprobe_blacklist, list) {
1512 if (addr >= ent->start_addr && addr < ent->end_addr)
1513 return true;
1514 }
1515 return false;
1516}
1517
1518bool within_kprobe_blacklist(unsigned long addr)
1519{
1520 char symname[KSYM_NAME_LEN], *p;
1521
1522 if (__within_kprobe_blacklist(addr))
1523 return true;
1524
1525 /* Check if the address is on a suffixed-symbol */
1526 if (!lookup_symbol_name(addr, symname)) {
1527 p = strchr(symname, '.');
1528 if (!p)
1529 return false;
1530 *p = '\0';
1531 addr = (unsigned long)kprobe_lookup_name(symname, 0);
1532 if (addr)
1533 return __within_kprobe_blacklist(addr);
1534 }
1535 return false;
1536}
1537
1538/*
1539 * If we have a symbol_name argument, look it up and add the offset field
1540 * to it. This way, we can specify a relative address to a symbol.
1541 * This returns encoded errors if it fails to look up symbol or invalid
1542 * combination of parameters.
1543 */
1544static kprobe_opcode_t *_kprobe_addr(kprobe_opcode_t *addr,
1545 const char *symbol_name, unsigned int offset)
1546{
1547 if ((symbol_name && addr) || (!symbol_name && !addr))
1548 goto invalid;
1549
1550 if (symbol_name) {
1551 addr = kprobe_lookup_name(symbol_name, offset);
1552 if (!addr)
1553 return ERR_PTR(-ENOENT);
1554 }
1555
1556 addr = (kprobe_opcode_t *)(((char *)addr) + offset);
1557 if (addr)
1558 return addr;
1559
1560invalid:
1561 return ERR_PTR(-EINVAL);
1562}
1563
1564static kprobe_opcode_t *kprobe_addr(struct kprobe *p)
1565{
1566 return _kprobe_addr(p->addr, p->symbol_name, p->offset);
1567}
1568
1569/* Check passed kprobe is valid and return kprobe in kprobe_table. */
1570static struct kprobe *__get_valid_kprobe(struct kprobe *p)
1571{
1572 struct kprobe *ap, *list_p;
1573
1574 lockdep_assert_held(&kprobe_mutex);
1575
1576 ap = get_kprobe(p->addr);
1577 if (unlikely(!ap))
1578 return NULL;
1579
1580 if (p != ap) {
1581 list_for_each_entry(list_p, &ap->list, list)
1582 if (list_p == p)
1583 /* kprobe p is a valid probe */
1584 goto valid;
1585 return NULL;
1586 }
1587valid:
1588 return ap;
1589}
1590
1591/* Return error if the kprobe is being re-registered */
1592static inline int check_kprobe_rereg(struct kprobe *p)
1593{
1594 int ret = 0;
1595
1596 mutex_lock(&kprobe_mutex);
1597 if (__get_valid_kprobe(p))
1598 ret = -EINVAL;
1599 mutex_unlock(&kprobe_mutex);
1600
1601 return ret;
1602}
1603
1604int __weak arch_check_ftrace_location(struct kprobe *p)
1605{
1606 unsigned long ftrace_addr;
1607
1608 ftrace_addr = ftrace_location((unsigned long)p->addr);
1609 if (ftrace_addr) {
1610#ifdef CONFIG_KPROBES_ON_FTRACE
1611 /* Given address is not on the instruction boundary */
1612 if ((unsigned long)p->addr != ftrace_addr)
1613 return -EILSEQ;
1614 p->flags |= KPROBE_FLAG_FTRACE;
1615#else /* !CONFIG_KPROBES_ON_FTRACE */
1616 return -EINVAL;
1617#endif
1618 }
1619 return 0;
1620}
1621
1622static int check_kprobe_address_safe(struct kprobe *p,
1623 struct module **probed_mod)
1624{
1625 int ret;
1626
1627 ret = arch_check_ftrace_location(p);
1628 if (ret)
1629 return ret;
1630 jump_label_lock();
1631 preempt_disable();
1632
1633 /* Ensure it is not in reserved area nor out of text */
1634 if (!kernel_text_address((unsigned long) p->addr) ||
1635 within_kprobe_blacklist((unsigned long) p->addr) ||
1636 jump_label_text_reserved(p->addr, p->addr) ||
1637 find_bug((unsigned long)p->addr)) {
1638 ret = -EINVAL;
1639 goto out;
1640 }
1641
1642 /* Check if are we probing a module */
1643 *probed_mod = __module_text_address((unsigned long) p->addr);
1644 if (*probed_mod) {
1645 /*
1646 * We must hold a refcount of the probed module while updating
1647 * its code to prohibit unexpected unloading.
1648 */
1649 if (unlikely(!try_module_get(*probed_mod))) {
1650 ret = -ENOENT;
1651 goto out;
1652 }
1653
1654 /*
1655 * If the module freed .init.text, we couldn't insert
1656 * kprobes in there.
1657 */
1658 if (within_module_init((unsigned long)p->addr, *probed_mod) &&
1659 (*probed_mod)->state != MODULE_STATE_COMING) {
1660 module_put(*probed_mod);
1661 *probed_mod = NULL;
1662 ret = -ENOENT;
1663 }
1664 }
1665out:
1666 preempt_enable();
1667 jump_label_unlock();
1668
1669 return ret;
1670}
1671
1672int register_kprobe(struct kprobe *p)
1673{
1674 int ret;
1675 struct kprobe *old_p;
1676 struct module *probed_mod;
1677 kprobe_opcode_t *addr;
1678
1679 /* Adjust probe address from symbol */
1680 addr = kprobe_addr(p);
1681 if (IS_ERR(addr))
1682 return PTR_ERR(addr);
1683 p->addr = addr;
1684
1685 ret = check_kprobe_rereg(p);
1686 if (ret)
1687 return ret;
1688
1689 /* User can pass only KPROBE_FLAG_DISABLED to register_kprobe */
1690 p->flags &= KPROBE_FLAG_DISABLED;
1691 p->nmissed = 0;
1692 INIT_LIST_HEAD(&p->list);
1693
1694 ret = check_kprobe_address_safe(p, &probed_mod);
1695 if (ret)
1696 return ret;
1697
1698 mutex_lock(&kprobe_mutex);
1699
1700 old_p = get_kprobe(p->addr);
1701 if (old_p) {
1702 /* Since this may unoptimize old_p, locking text_mutex. */
1703 ret = register_aggr_kprobe(old_p, p);
1704 goto out;
1705 }
1706
1707 cpus_read_lock();
1708 /* Prevent text modification */
1709 mutex_lock(&text_mutex);
1710 ret = prepare_kprobe(p);
1711 mutex_unlock(&text_mutex);
1712 cpus_read_unlock();
1713 if (ret)
1714 goto out;
1715
1716 INIT_HLIST_NODE(&p->hlist);
1717 hlist_add_head_rcu(&p->hlist,
1718 &kprobe_table[hash_ptr(p->addr, KPROBE_HASH_BITS)]);
1719
1720 if (!kprobes_all_disarmed && !kprobe_disabled(p)) {
1721 ret = arm_kprobe(p);
1722 if (ret) {
1723 hlist_del_rcu(&p->hlist);
1724 synchronize_rcu();
1725 goto out;
1726 }
1727 }
1728
1729 /* Try to optimize kprobe */
1730 try_to_optimize_kprobe(p);
1731out:
1732 mutex_unlock(&kprobe_mutex);
1733
1734 if (probed_mod)
1735 module_put(probed_mod);
1736
1737 return ret;
1738}
1739EXPORT_SYMBOL_GPL(register_kprobe);
1740
1741/* Check if all probes on the aggrprobe are disabled */
1742static int aggr_kprobe_disabled(struct kprobe *ap)
1743{
1744 struct kprobe *kp;
1745
1746 lockdep_assert_held(&kprobe_mutex);
1747
1748 list_for_each_entry(kp, &ap->list, list)
1749 if (!kprobe_disabled(kp))
1750 /*
1751 * There is an active probe on the list.
1752 * We can't disable this ap.
1753 */
1754 return 0;
1755
1756 return 1;
1757}
1758
1759/* Disable one kprobe: Make sure called under kprobe_mutex is locked */
1760static struct kprobe *__disable_kprobe(struct kprobe *p)
1761{
1762 struct kprobe *orig_p;
1763 int ret;
1764
1765 /* Get an original kprobe for return */
1766 orig_p = __get_valid_kprobe(p);
1767 if (unlikely(orig_p == NULL))
1768 return ERR_PTR(-EINVAL);
1769
1770 if (!kprobe_disabled(p)) {
1771 /* Disable probe if it is a child probe */
1772 if (p != orig_p)
1773 p->flags |= KPROBE_FLAG_DISABLED;
1774
1775 /* Try to disarm and disable this/parent probe */
1776 if (p == orig_p || aggr_kprobe_disabled(orig_p)) {
1777 /*
1778 * If kprobes_all_disarmed is set, orig_p
1779 * should have already been disarmed, so
1780 * skip unneed disarming process.
1781 */
1782 if (!kprobes_all_disarmed) {
1783 ret = disarm_kprobe(orig_p, true);
1784 if (ret) {
1785 p->flags &= ~KPROBE_FLAG_DISABLED;
1786 return ERR_PTR(ret);
1787 }
1788 }
1789 orig_p->flags |= KPROBE_FLAG_DISABLED;
1790 }
1791 }
1792
1793 return orig_p;
1794}
1795
1796/*
1797 * Unregister a kprobe without a scheduler synchronization.
1798 */
1799static int __unregister_kprobe_top(struct kprobe *p)
1800{
1801 struct kprobe *ap, *list_p;
1802
1803 /* Disable kprobe. This will disarm it if needed. */
1804 ap = __disable_kprobe(p);
1805 if (IS_ERR(ap))
1806 return PTR_ERR(ap);
1807
1808 if (ap == p)
1809 /*
1810 * This probe is an independent(and non-optimized) kprobe
1811 * (not an aggrprobe). Remove from the hash list.
1812 */
1813 goto disarmed;
1814
1815 /* Following process expects this probe is an aggrprobe */
1816 WARN_ON(!kprobe_aggrprobe(ap));
1817
1818 if (list_is_singular(&ap->list) && kprobe_disarmed(ap))
1819 /*
1820 * !disarmed could be happen if the probe is under delayed
1821 * unoptimizing.
1822 */
1823 goto disarmed;
1824 else {
1825 /* If disabling probe has special handlers, update aggrprobe */
1826 if (p->post_handler && !kprobe_gone(p)) {
1827 list_for_each_entry(list_p, &ap->list, list) {
1828 if ((list_p != p) && (list_p->post_handler))
1829 goto noclean;
1830 }
1831 ap->post_handler = NULL;
1832 }
1833noclean:
1834 /*
1835 * Remove from the aggrprobe: this path will do nothing in
1836 * __unregister_kprobe_bottom().
1837 */
1838 list_del_rcu(&p->list);
1839 if (!kprobe_disabled(ap) && !kprobes_all_disarmed)
1840 /*
1841 * Try to optimize this probe again, because post
1842 * handler may have been changed.
1843 */
1844 optimize_kprobe(ap);
1845 }
1846 return 0;
1847
1848disarmed:
1849 hlist_del_rcu(&ap->hlist);
1850 return 0;
1851}
1852
1853static void __unregister_kprobe_bottom(struct kprobe *p)
1854{
1855 struct kprobe *ap;
1856
1857 if (list_empty(&p->list))
1858 /* This is an independent kprobe */
1859 arch_remove_kprobe(p);
1860 else if (list_is_singular(&p->list)) {
1861 /* This is the last child of an aggrprobe */
1862 ap = list_entry(p->list.next, struct kprobe, list);
1863 list_del(&p->list);
1864 free_aggr_kprobe(ap);
1865 }
1866 /* Otherwise, do nothing. */
1867}
1868
1869int register_kprobes(struct kprobe **kps, int num)
1870{
1871 int i, ret = 0;
1872
1873 if (num <= 0)
1874 return -EINVAL;
1875 for (i = 0; i < num; i++) {
1876 ret = register_kprobe(kps[i]);
1877 if (ret < 0) {
1878 if (i > 0)
1879 unregister_kprobes(kps, i);
1880 break;
1881 }
1882 }
1883 return ret;
1884}
1885EXPORT_SYMBOL_GPL(register_kprobes);
1886
1887void unregister_kprobe(struct kprobe *p)
1888{
1889 unregister_kprobes(&p, 1);
1890}
1891EXPORT_SYMBOL_GPL(unregister_kprobe);
1892
1893void unregister_kprobes(struct kprobe **kps, int num)
1894{
1895 int i;
1896
1897 if (num <= 0)
1898 return;
1899 mutex_lock(&kprobe_mutex);
1900 for (i = 0; i < num; i++)
1901 if (__unregister_kprobe_top(kps[i]) < 0)
1902 kps[i]->addr = NULL;
1903 mutex_unlock(&kprobe_mutex);
1904
1905 synchronize_rcu();
1906 for (i = 0; i < num; i++)
1907 if (kps[i]->addr)
1908 __unregister_kprobe_bottom(kps[i]);
1909}
1910EXPORT_SYMBOL_GPL(unregister_kprobes);
1911
1912int __weak kprobe_exceptions_notify(struct notifier_block *self,
1913 unsigned long val, void *data)
1914{
1915 return NOTIFY_DONE;
1916}
1917NOKPROBE_SYMBOL(kprobe_exceptions_notify);
1918
1919static struct notifier_block kprobe_exceptions_nb = {
1920 .notifier_call = kprobe_exceptions_notify,
1921 .priority = 0x7fffffff /* we need to be notified first */
1922};
1923
1924unsigned long __weak arch_deref_entry_point(void *entry)
1925{
1926 return (unsigned long)entry;
1927}
1928
1929#ifdef CONFIG_KRETPROBES
1930/*
1931 * This kprobe pre_handler is registered with every kretprobe. When probe
1932 * hits it will set up the return probe.
1933 */
1934static int pre_handler_kretprobe(struct kprobe *p, struct pt_regs *regs)
1935{
1936 struct kretprobe *rp = container_of(p, struct kretprobe, kp);
1937 unsigned long hash, flags = 0;
1938 struct kretprobe_instance *ri;
1939
1940 /*
1941 * To avoid deadlocks, prohibit return probing in NMI contexts,
1942 * just skip the probe and increase the (inexact) 'nmissed'
1943 * statistical counter, so that the user is informed that
1944 * something happened:
1945 */
1946 if (unlikely(in_nmi())) {
1947 rp->nmissed++;
1948 return 0;
1949 }
1950
1951 /* TODO: consider to only swap the RA after the last pre_handler fired */
1952 hash = hash_ptr(current, KPROBE_HASH_BITS);
1953 raw_spin_lock_irqsave(&rp->lock, flags);
1954 if (!hlist_empty(&rp->free_instances)) {
1955 ri = hlist_entry(rp->free_instances.first,
1956 struct kretprobe_instance, hlist);
1957 hlist_del(&ri->hlist);
1958 raw_spin_unlock_irqrestore(&rp->lock, flags);
1959
1960 ri->rp = rp;
1961 ri->task = current;
1962
1963 if (rp->entry_handler && rp->entry_handler(ri, regs)) {
1964 raw_spin_lock_irqsave(&rp->lock, flags);
1965 hlist_add_head(&ri->hlist, &rp->free_instances);
1966 raw_spin_unlock_irqrestore(&rp->lock, flags);
1967 return 0;
1968 }
1969
1970 arch_prepare_kretprobe(ri, regs);
1971
1972 /* XXX(hch): why is there no hlist_move_head? */
1973 INIT_HLIST_NODE(&ri->hlist);
1974 kretprobe_table_lock(hash, &flags);
1975 hlist_add_head(&ri->hlist, &kretprobe_inst_table[hash]);
1976 kretprobe_table_unlock(hash, &flags);
1977 } else {
1978 rp->nmissed++;
1979 raw_spin_unlock_irqrestore(&rp->lock, flags);
1980 }
1981 return 0;
1982}
1983NOKPROBE_SYMBOL(pre_handler_kretprobe);
1984
1985bool __weak arch_kprobe_on_func_entry(unsigned long offset)
1986{
1987 return !offset;
1988}
1989
1990bool kprobe_on_func_entry(kprobe_opcode_t *addr, const char *sym, unsigned long offset)
1991{
1992 kprobe_opcode_t *kp_addr = _kprobe_addr(addr, sym, offset);
1993
1994 if (IS_ERR(kp_addr))
1995 return false;
1996
1997 if (!kallsyms_lookup_size_offset((unsigned long)kp_addr, NULL, &offset) ||
1998 !arch_kprobe_on_func_entry(offset))
1999 return false;
2000
2001 return true;
2002}
2003
2004int register_kretprobe(struct kretprobe *rp)
2005{
2006 int ret = 0;
2007 struct kretprobe_instance *inst;
2008 int i;
2009 void *addr;
2010
2011 if (!kprobe_on_func_entry(rp->kp.addr, rp->kp.symbol_name, rp->kp.offset))
2012 return -EINVAL;
2013
2014 if (kretprobe_blacklist_size) {
2015 addr = kprobe_addr(&rp->kp);
2016 if (IS_ERR(addr))
2017 return PTR_ERR(addr);
2018
2019 for (i = 0; kretprobe_blacklist[i].name != NULL; i++) {
2020 if (kretprobe_blacklist[i].addr == addr)
2021 return -EINVAL;
2022 }
2023 }
2024
2025 rp->kp.pre_handler = pre_handler_kretprobe;
2026 rp->kp.post_handler = NULL;
2027 rp->kp.fault_handler = NULL;
2028
2029 /* Pre-allocate memory for max kretprobe instances */
2030 if (rp->maxactive <= 0) {
2031#ifdef CONFIG_PREEMPTION
2032 rp->maxactive = max_t(unsigned int, 10, 2*num_possible_cpus());
2033#else
2034 rp->maxactive = num_possible_cpus();
2035#endif
2036 }
2037 raw_spin_lock_init(&rp->lock);
2038 INIT_HLIST_HEAD(&rp->free_instances);
2039 for (i = 0; i < rp->maxactive; i++) {
2040 inst = kmalloc(sizeof(struct kretprobe_instance) +
2041 rp->data_size, GFP_KERNEL);
2042 if (inst == NULL) {
2043 free_rp_inst(rp);
2044 return -ENOMEM;
2045 }
2046 INIT_HLIST_NODE(&inst->hlist);
2047 hlist_add_head(&inst->hlist, &rp->free_instances);
2048 }
2049
2050 rp->nmissed = 0;
2051 /* Establish function entry probe point */
2052 ret = register_kprobe(&rp->kp);
2053 if (ret != 0)
2054 free_rp_inst(rp);
2055 return ret;
2056}
2057EXPORT_SYMBOL_GPL(register_kretprobe);
2058
2059int register_kretprobes(struct kretprobe **rps, int num)
2060{
2061 int ret = 0, i;
2062
2063 if (num <= 0)
2064 return -EINVAL;
2065 for (i = 0; i < num; i++) {
2066 ret = register_kretprobe(rps[i]);
2067 if (ret < 0) {
2068 if (i > 0)
2069 unregister_kretprobes(rps, i);
2070 break;
2071 }
2072 }
2073 return ret;
2074}
2075EXPORT_SYMBOL_GPL(register_kretprobes);
2076
2077void unregister_kretprobe(struct kretprobe *rp)
2078{
2079 unregister_kretprobes(&rp, 1);
2080}
2081EXPORT_SYMBOL_GPL(unregister_kretprobe);
2082
2083void unregister_kretprobes(struct kretprobe **rps, int num)
2084{
2085 int i;
2086
2087 if (num <= 0)
2088 return;
2089 mutex_lock(&kprobe_mutex);
2090 for (i = 0; i < num; i++)
2091 if (__unregister_kprobe_top(&rps[i]->kp) < 0)
2092 rps[i]->kp.addr = NULL;
2093 mutex_unlock(&kprobe_mutex);
2094
2095 synchronize_rcu();
2096 for (i = 0; i < num; i++) {
2097 if (rps[i]->kp.addr) {
2098 __unregister_kprobe_bottom(&rps[i]->kp);
2099 cleanup_rp_inst(rps[i]);
2100 }
2101 }
2102}
2103EXPORT_SYMBOL_GPL(unregister_kretprobes);
2104
2105#else /* CONFIG_KRETPROBES */
2106int register_kretprobe(struct kretprobe *rp)
2107{
2108 return -ENOSYS;
2109}
2110EXPORT_SYMBOL_GPL(register_kretprobe);
2111
2112int register_kretprobes(struct kretprobe **rps, int num)
2113{
2114 return -ENOSYS;
2115}
2116EXPORT_SYMBOL_GPL(register_kretprobes);
2117
2118void unregister_kretprobe(struct kretprobe *rp)
2119{
2120}
2121EXPORT_SYMBOL_GPL(unregister_kretprobe);
2122
2123void unregister_kretprobes(struct kretprobe **rps, int num)
2124{
2125}
2126EXPORT_SYMBOL_GPL(unregister_kretprobes);
2127
2128static int pre_handler_kretprobe(struct kprobe *p, struct pt_regs *regs)
2129{
2130 return 0;
2131}
2132NOKPROBE_SYMBOL(pre_handler_kretprobe);
2133
2134#endif /* CONFIG_KRETPROBES */
2135
2136/* Set the kprobe gone and remove its instruction buffer. */
2137static void kill_kprobe(struct kprobe *p)
2138{
2139 struct kprobe *kp;
2140
2141 lockdep_assert_held(&kprobe_mutex);
2142
2143 if (WARN_ON_ONCE(kprobe_gone(p)))
2144 return;
2145
2146 p->flags |= KPROBE_FLAG_GONE;
2147 if (kprobe_aggrprobe(p)) {
2148 /*
2149 * If this is an aggr_kprobe, we have to list all the
2150 * chained probes and mark them GONE.
2151 */
2152 list_for_each_entry(kp, &p->list, list)
2153 kp->flags |= KPROBE_FLAG_GONE;
2154 p->post_handler = NULL;
2155 kill_optimized_kprobe(p);
2156 }
2157 /*
2158 * Here, we can remove insn_slot safely, because no thread calls
2159 * the original probed function (which will be freed soon) any more.
2160 */
2161 arch_remove_kprobe(p);
2162
2163 /*
2164 * The module is going away. We should disarm the kprobe which
2165 * is using ftrace, because ftrace framework is still available at
2166 * MODULE_STATE_GOING notification.
2167 */
2168 if (kprobe_ftrace(p) && !kprobe_disabled(p) && !kprobes_all_disarmed)
2169 disarm_kprobe_ftrace(p);
2170}
2171
2172/* Disable one kprobe */
2173int disable_kprobe(struct kprobe *kp)
2174{
2175 int ret = 0;
2176 struct kprobe *p;
2177
2178 mutex_lock(&kprobe_mutex);
2179
2180 /* Disable this kprobe */
2181 p = __disable_kprobe(kp);
2182 if (IS_ERR(p))
2183 ret = PTR_ERR(p);
2184
2185 mutex_unlock(&kprobe_mutex);
2186 return ret;
2187}
2188EXPORT_SYMBOL_GPL(disable_kprobe);
2189
2190/* Enable one kprobe */
2191int enable_kprobe(struct kprobe *kp)
2192{
2193 int ret = 0;
2194 struct kprobe *p;
2195
2196 mutex_lock(&kprobe_mutex);
2197
2198 /* Check whether specified probe is valid. */
2199 p = __get_valid_kprobe(kp);
2200 if (unlikely(p == NULL)) {
2201 ret = -EINVAL;
2202 goto out;
2203 }
2204
2205 if (kprobe_gone(kp)) {
2206 /* This kprobe has gone, we couldn't enable it. */
2207 ret = -EINVAL;
2208 goto out;
2209 }
2210
2211 if (p != kp)
2212 kp->flags &= ~KPROBE_FLAG_DISABLED;
2213
2214 if (!kprobes_all_disarmed && kprobe_disabled(p)) {
2215 p->flags &= ~KPROBE_FLAG_DISABLED;
2216 ret = arm_kprobe(p);
2217 if (ret)
2218 p->flags |= KPROBE_FLAG_DISABLED;
2219 }
2220out:
2221 mutex_unlock(&kprobe_mutex);
2222 return ret;
2223}
2224EXPORT_SYMBOL_GPL(enable_kprobe);
2225
2226/* Caller must NOT call this in usual path. This is only for critical case */
2227void dump_kprobe(struct kprobe *kp)
2228{
2229 pr_err("Dumping kprobe:\n");
2230 pr_err("Name: %s\nOffset: %x\nAddress: %pS\n",
2231 kp->symbol_name, kp->offset, kp->addr);
2232}
2233NOKPROBE_SYMBOL(dump_kprobe);
2234
2235int kprobe_add_ksym_blacklist(unsigned long entry)
2236{
2237 struct kprobe_blacklist_entry *ent;
2238 unsigned long offset = 0, size = 0;
2239
2240 if (!kernel_text_address(entry) ||
2241 !kallsyms_lookup_size_offset(entry, &size, &offset))
2242 return -EINVAL;
2243
2244 ent = kmalloc(sizeof(*ent), GFP_KERNEL);
2245 if (!ent)
2246 return -ENOMEM;
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);
2251
2252 return (int)size;
2253}
2254
2255/* Add all symbols in given area into kprobe blacklist */
2256int kprobe_add_area_blacklist(unsigned long start, unsigned long end)
2257{
2258 unsigned long entry;
2259 int ret = 0;
2260
2261 for (entry = start; entry < end; entry += ret) {
2262 ret = kprobe_add_ksym_blacklist(entry);
2263 if (ret < 0)
2264 return ret;
2265 if (ret == 0) /* In case of alias symbol */
2266 ret = 1;
2267 }
2268 return 0;
2269}
2270
2271/* Remove all symbols in given area from kprobe blacklist */
2272static void kprobe_remove_area_blacklist(unsigned long start, unsigned long end)
2273{
2274 struct kprobe_blacklist_entry *ent, *n;
2275
2276 list_for_each_entry_safe(ent, n, &kprobe_blacklist, list) {
2277 if (ent->start_addr < start || ent->start_addr >= end)
2278 continue;
2279 list_del(&ent->list);
2280 kfree(ent);
2281 }
2282}
2283
2284static void kprobe_remove_ksym_blacklist(unsigned long entry)
2285{
2286 kprobe_remove_area_blacklist(entry, entry + 1);
2287}
2288
2289int __weak arch_kprobe_get_kallsym(unsigned int *symnum, unsigned long *value,
2290 char *type, char *sym)
2291{
2292 return -ERANGE;
2293}
2294
2295int kprobe_get_kallsym(unsigned int symnum, unsigned long *value, char *type,
2296 char *sym)
2297{
2298#ifdef __ARCH_WANT_KPROBES_INSN_SLOT
2299 if (!kprobe_cache_get_kallsym(&kprobe_insn_slots, &symnum, value, type, sym))
2300 return 0;
2301#ifdef CONFIG_OPTPROBES
2302 if (!kprobe_cache_get_kallsym(&kprobe_optinsn_slots, &symnum, value, type, sym))
2303 return 0;
2304#endif
2305#endif
2306 if (!arch_kprobe_get_kallsym(&symnum, value, type, sym))
2307 return 0;
2308 return -ERANGE;
2309}
2310
2311int __init __weak arch_populate_kprobe_blacklist(void)
2312{
2313 return 0;
2314}
2315
2316/*
2317 * Lookup and populate the kprobe_blacklist.
2318 *
2319 * Unlike the kretprobe blacklist, we'll need to determine
2320 * the range of addresses that belong to the said functions,
2321 * since a kprobe need not necessarily be at the beginning
2322 * of a function.
2323 */
2324static int __init populate_kprobe_blacklist(unsigned long *start,
2325 unsigned long *end)
2326{
2327 unsigned long entry;
2328 unsigned long *iter;
2329 int ret;
2330
2331 for (iter = start; iter < end; iter++) {
2332 entry = arch_deref_entry_point((void *)*iter);
2333 ret = kprobe_add_ksym_blacklist(entry);
2334 if (ret == -EINVAL)
2335 continue;
2336 if (ret < 0)
2337 return ret;
2338 }
2339
2340 /* Symbols in __kprobes_text are blacklisted */
2341 ret = kprobe_add_area_blacklist((unsigned long)__kprobes_text_start,
2342 (unsigned long)__kprobes_text_end);
2343 if (ret)
2344 return ret;
2345
2346 /* Symbols in noinstr section are blacklisted */
2347 ret = kprobe_add_area_blacklist((unsigned long)__noinstr_text_start,
2348 (unsigned long)__noinstr_text_end);
2349
2350 return ret ? : arch_populate_kprobe_blacklist();
2351}
2352
2353static void add_module_kprobe_blacklist(struct module *mod)
2354{
2355 unsigned long start, end;
2356 int i;
2357
2358 if (mod->kprobe_blacklist) {
2359 for (i = 0; i < mod->num_kprobe_blacklist; i++)
2360 kprobe_add_ksym_blacklist(mod->kprobe_blacklist[i]);
2361 }
2362
2363 start = (unsigned long)mod->kprobes_text_start;
2364 if (start) {
2365 end = start + mod->kprobes_text_size;
2366 kprobe_add_area_blacklist(start, end);
2367 }
2368
2369 start = (unsigned long)mod->noinstr_text_start;
2370 if (start) {
2371 end = start + mod->noinstr_text_size;
2372 kprobe_add_area_blacklist(start, end);
2373 }
2374}
2375
2376static void remove_module_kprobe_blacklist(struct module *mod)
2377{
2378 unsigned long start, end;
2379 int i;
2380
2381 if (mod->kprobe_blacklist) {
2382 for (i = 0; i < mod->num_kprobe_blacklist; i++)
2383 kprobe_remove_ksym_blacklist(mod->kprobe_blacklist[i]);
2384 }
2385
2386 start = (unsigned long)mod->kprobes_text_start;
2387 if (start) {
2388 end = start + mod->kprobes_text_size;
2389 kprobe_remove_area_blacklist(start, end);
2390 }
2391
2392 start = (unsigned long)mod->noinstr_text_start;
2393 if (start) {
2394 end = start + mod->noinstr_text_size;
2395 kprobe_remove_area_blacklist(start, end);
2396 }
2397}
2398
2399/* Module notifier call back, checking kprobes on the module */
2400static int kprobes_module_callback(struct notifier_block *nb,
2401 unsigned long val, void *data)
2402{
2403 struct module *mod = data;
2404 struct hlist_head *head;
2405 struct kprobe *p;
2406 unsigned int i;
2407 int checkcore = (val == MODULE_STATE_GOING);
2408
2409 if (val == MODULE_STATE_COMING) {
2410 mutex_lock(&kprobe_mutex);
2411 add_module_kprobe_blacklist(mod);
2412 mutex_unlock(&kprobe_mutex);
2413 }
2414 if (val != MODULE_STATE_GOING && val != MODULE_STATE_LIVE)
2415 return NOTIFY_DONE;
2416
2417 /*
2418 * When MODULE_STATE_GOING was notified, both of module .text and
2419 * .init.text sections would be freed. When MODULE_STATE_LIVE was
2420 * notified, only .init.text section would be freed. We need to
2421 * disable kprobes which have been inserted in the sections.
2422 */
2423 mutex_lock(&kprobe_mutex);
2424 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
2425 head = &kprobe_table[i];
2426 hlist_for_each_entry(p, head, hlist) {
2427 if (kprobe_gone(p))
2428 continue;
2429
2430 if (within_module_init((unsigned long)p->addr, mod) ||
2431 (checkcore &&
2432 within_module_core((unsigned long)p->addr, mod))) {
2433 /*
2434 * The vaddr this probe is installed will soon
2435 * be vfreed buy not synced to disk. Hence,
2436 * disarming the breakpoint isn't needed.
2437 *
2438 * Note, this will also move any optimized probes
2439 * that are pending to be removed from their
2440 * corresponding lists to the freeing_list and
2441 * will not be touched by the delayed
2442 * kprobe_optimizer work handler.
2443 */
2444 kill_kprobe(p);
2445 }
2446 }
2447 }
2448 if (val == MODULE_STATE_GOING)
2449 remove_module_kprobe_blacklist(mod);
2450 mutex_unlock(&kprobe_mutex);
2451 return NOTIFY_DONE;
2452}
2453
2454static struct notifier_block kprobe_module_nb = {
2455 .notifier_call = kprobes_module_callback,
2456 .priority = 0
2457};
2458
2459/* Markers of _kprobe_blacklist section */
2460extern unsigned long __start_kprobe_blacklist[];
2461extern unsigned long __stop_kprobe_blacklist[];
2462
2463void kprobe_free_init_mem(void)
2464{
2465 void *start = (void *)(&__init_begin);
2466 void *end = (void *)(&__init_end);
2467 struct hlist_head *head;
2468 struct kprobe *p;
2469 int i;
2470
2471 mutex_lock(&kprobe_mutex);
2472
2473 /* Kill all kprobes on initmem */
2474 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
2475 head = &kprobe_table[i];
2476 hlist_for_each_entry(p, head, hlist) {
2477 if (start <= (void *)p->addr && (void *)p->addr < end)
2478 kill_kprobe(p);
2479 }
2480 }
2481
2482 mutex_unlock(&kprobe_mutex);
2483}
2484
2485static int __init init_kprobes(void)
2486{
2487 int i, err = 0;
2488
2489 /* FIXME allocate the probe table, currently defined statically */
2490 /* initialize all list heads */
2491 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
2492 INIT_HLIST_HEAD(&kprobe_table[i]);
2493 INIT_HLIST_HEAD(&kretprobe_inst_table[i]);
2494 raw_spin_lock_init(&(kretprobe_table_locks[i].lock));
2495 }
2496
2497 err = populate_kprobe_blacklist(__start_kprobe_blacklist,
2498 __stop_kprobe_blacklist);
2499 if (err) {
2500 pr_err("kprobes: failed to populate blacklist: %d\n", err);
2501 pr_err("Please take care of using kprobes.\n");
2502 }
2503
2504 if (kretprobe_blacklist_size) {
2505 /* lookup the function address from its name */
2506 for (i = 0; kretprobe_blacklist[i].name != NULL; i++) {
2507 kretprobe_blacklist[i].addr =
2508 kprobe_lookup_name(kretprobe_blacklist[i].name, 0);
2509 if (!kretprobe_blacklist[i].addr)
2510 printk("kretprobe: lookup failed: %s\n",
2511 kretprobe_blacklist[i].name);
2512 }
2513 }
2514
2515#if defined(CONFIG_OPTPROBES)
2516#if defined(__ARCH_WANT_KPROBES_INSN_SLOT)
2517 /* Init kprobe_optinsn_slots */
2518 kprobe_optinsn_slots.insn_size = MAX_OPTINSN_SIZE;
2519#endif
2520 /* By default, kprobes can be optimized */
2521 kprobes_allow_optimization = true;
2522#endif
2523
2524 /* By default, kprobes are armed */
2525 kprobes_all_disarmed = false;
2526
2527 err = arch_init_kprobes();
2528 if (!err)
2529 err = register_die_notifier(&kprobe_exceptions_nb);
2530 if (!err)
2531 err = register_module_notifier(&kprobe_module_nb);
2532
2533 kprobes_initialized = (err == 0);
2534
2535 if (!err)
2536 init_test_probes();
2537 return err;
2538}
2539subsys_initcall(init_kprobes);
2540
2541#ifdef CONFIG_DEBUG_FS
2542static void report_probe(struct seq_file *pi, struct kprobe *p,
2543 const char *sym, int offset, char *modname, struct kprobe *pp)
2544{
2545 char *kprobe_type;
2546 void *addr = p->addr;
2547
2548 if (p->pre_handler == pre_handler_kretprobe)
2549 kprobe_type = "r";
2550 else
2551 kprobe_type = "k";
2552
2553 if (!kallsyms_show_value(pi->file->f_cred))
2554 addr = NULL;
2555
2556 if (sym)
2557 seq_printf(pi, "%px %s %s+0x%x %s ",
2558 addr, kprobe_type, sym, offset,
2559 (modname ? modname : " "));
2560 else /* try to use %pS */
2561 seq_printf(pi, "%px %s %pS ",
2562 addr, kprobe_type, p->addr);
2563
2564 if (!pp)
2565 pp = p;
2566 seq_printf(pi, "%s%s%s%s\n",
2567 (kprobe_gone(p) ? "[GONE]" : ""),
2568 ((kprobe_disabled(p) && !kprobe_gone(p)) ? "[DISABLED]" : ""),
2569 (kprobe_optimized(pp) ? "[OPTIMIZED]" : ""),
2570 (kprobe_ftrace(pp) ? "[FTRACE]" : ""));
2571}
2572
2573static void *kprobe_seq_start(struct seq_file *f, loff_t *pos)
2574{
2575 return (*pos < KPROBE_TABLE_SIZE) ? pos : NULL;
2576}
2577
2578static void *kprobe_seq_next(struct seq_file *f, void *v, loff_t *pos)
2579{
2580 (*pos)++;
2581 if (*pos >= KPROBE_TABLE_SIZE)
2582 return NULL;
2583 return pos;
2584}
2585
2586static void kprobe_seq_stop(struct seq_file *f, void *v)
2587{
2588 /* Nothing to do */
2589}
2590
2591static int show_kprobe_addr(struct seq_file *pi, void *v)
2592{
2593 struct hlist_head *head;
2594 struct kprobe *p, *kp;
2595 const char *sym = NULL;
2596 unsigned int i = *(loff_t *) v;
2597 unsigned long offset = 0;
2598 char *modname, namebuf[KSYM_NAME_LEN];
2599
2600 head = &kprobe_table[i];
2601 preempt_disable();
2602 hlist_for_each_entry_rcu(p, head, hlist) {
2603 sym = kallsyms_lookup((unsigned long)p->addr, NULL,
2604 &offset, &modname, namebuf);
2605 if (kprobe_aggrprobe(p)) {
2606 list_for_each_entry_rcu(kp, &p->list, list)
2607 report_probe(pi, kp, sym, offset, modname, p);
2608 } else
2609 report_probe(pi, p, sym, offset, modname, NULL);
2610 }
2611 preempt_enable();
2612 return 0;
2613}
2614
2615static const struct seq_operations kprobes_sops = {
2616 .start = kprobe_seq_start,
2617 .next = kprobe_seq_next,
2618 .stop = kprobe_seq_stop,
2619 .show = show_kprobe_addr
2620};
2621
2622DEFINE_SEQ_ATTRIBUTE(kprobes);
2623
2624/* kprobes/blacklist -- shows which functions can not be probed */
2625static void *kprobe_blacklist_seq_start(struct seq_file *m, loff_t *pos)
2626{
2627 mutex_lock(&kprobe_mutex);
2628 return seq_list_start(&kprobe_blacklist, *pos);
2629}
2630
2631static void *kprobe_blacklist_seq_next(struct seq_file *m, void *v, loff_t *pos)
2632{
2633 return seq_list_next(v, &kprobe_blacklist, pos);
2634}
2635
2636static int kprobe_blacklist_seq_show(struct seq_file *m, void *v)
2637{
2638 struct kprobe_blacklist_entry *ent =
2639 list_entry(v, struct kprobe_blacklist_entry, list);
2640
2641 /*
2642 * If /proc/kallsyms is not showing kernel address, we won't
2643 * show them here either.
2644 */
2645 if (!kallsyms_show_value(m->file->f_cred))
2646 seq_printf(m, "0x%px-0x%px\t%ps\n", NULL, NULL,
2647 (void *)ent->start_addr);
2648 else
2649 seq_printf(m, "0x%px-0x%px\t%ps\n", (void *)ent->start_addr,
2650 (void *)ent->end_addr, (void *)ent->start_addr);
2651 return 0;
2652}
2653
2654static void kprobe_blacklist_seq_stop(struct seq_file *f, void *v)
2655{
2656 mutex_unlock(&kprobe_mutex);
2657}
2658
2659static const struct seq_operations kprobe_blacklist_sops = {
2660 .start = kprobe_blacklist_seq_start,
2661 .next = kprobe_blacklist_seq_next,
2662 .stop = kprobe_blacklist_seq_stop,
2663 .show = kprobe_blacklist_seq_show,
2664};
2665DEFINE_SEQ_ATTRIBUTE(kprobe_blacklist);
2666
2667static int arm_all_kprobes(void)
2668{
2669 struct hlist_head *head;
2670 struct kprobe *p;
2671 unsigned int i, total = 0, errors = 0;
2672 int err, ret = 0;
2673
2674 mutex_lock(&kprobe_mutex);
2675
2676 /* If kprobes are armed, just return */
2677 if (!kprobes_all_disarmed)
2678 goto already_enabled;
2679
2680 /*
2681 * optimize_kprobe() called by arm_kprobe() checks
2682 * kprobes_all_disarmed, so set kprobes_all_disarmed before
2683 * arm_kprobe.
2684 */
2685 kprobes_all_disarmed = false;
2686 /* Arming kprobes doesn't optimize kprobe itself */
2687 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
2688 head = &kprobe_table[i];
2689 /* Arm all kprobes on a best-effort basis */
2690 hlist_for_each_entry(p, head, hlist) {
2691 if (!kprobe_disabled(p)) {
2692 err = arm_kprobe(p);
2693 if (err) {
2694 errors++;
2695 ret = err;
2696 }
2697 total++;
2698 }
2699 }
2700 }
2701
2702 if (errors)
2703 pr_warn("Kprobes globally enabled, but failed to arm %d out of %d probes\n",
2704 errors, total);
2705 else
2706 pr_info("Kprobes globally enabled\n");
2707
2708already_enabled:
2709 mutex_unlock(&kprobe_mutex);
2710 return ret;
2711}
2712
2713static int disarm_all_kprobes(void)
2714{
2715 struct hlist_head *head;
2716 struct kprobe *p;
2717 unsigned int i, total = 0, errors = 0;
2718 int err, ret = 0;
2719
2720 mutex_lock(&kprobe_mutex);
2721
2722 /* If kprobes are already disarmed, just return */
2723 if (kprobes_all_disarmed) {
2724 mutex_unlock(&kprobe_mutex);
2725 return 0;
2726 }
2727
2728 kprobes_all_disarmed = true;
2729
2730 for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
2731 head = &kprobe_table[i];
2732 /* Disarm all kprobes on a best-effort basis */
2733 hlist_for_each_entry(p, head, hlist) {
2734 if (!arch_trampoline_kprobe(p) && !kprobe_disabled(p)) {
2735 err = disarm_kprobe(p, false);
2736 if (err) {
2737 errors++;
2738 ret = err;
2739 }
2740 total++;
2741 }
2742 }
2743 }
2744
2745 if (errors)
2746 pr_warn("Kprobes globally disabled, but failed to disarm %d out of %d probes\n",
2747 errors, total);
2748 else
2749 pr_info("Kprobes globally disabled\n");
2750
2751 mutex_unlock(&kprobe_mutex);
2752
2753 /* Wait for disarming all kprobes by optimizer */
2754 wait_for_kprobe_optimizer();
2755
2756 return ret;
2757}
2758
2759/*
2760 * XXX: The debugfs bool file interface doesn't allow for callbacks
2761 * when the bool state is switched. We can reuse that facility when
2762 * available
2763 */
2764static ssize_t read_enabled_file_bool(struct file *file,
2765 char __user *user_buf, size_t count, loff_t *ppos)
2766{
2767 char buf[3];
2768
2769 if (!kprobes_all_disarmed)
2770 buf[0] = '1';
2771 else
2772 buf[0] = '0';
2773 buf[1] = '\n';
2774 buf[2] = 0x00;
2775 return simple_read_from_buffer(user_buf, count, ppos, buf, 2);
2776}
2777
2778static ssize_t write_enabled_file_bool(struct file *file,
2779 const char __user *user_buf, size_t count, loff_t *ppos)
2780{
2781 char buf[32];
2782 size_t buf_size;
2783 int ret = 0;
2784
2785 buf_size = min(count, (sizeof(buf)-1));
2786 if (copy_from_user(buf, user_buf, buf_size))
2787 return -EFAULT;
2788
2789 buf[buf_size] = '\0';
2790 switch (buf[0]) {
2791 case 'y':
2792 case 'Y':
2793 case '1':
2794 ret = arm_all_kprobes();
2795 break;
2796 case 'n':
2797 case 'N':
2798 case '0':
2799 ret = disarm_all_kprobes();
2800 break;
2801 default:
2802 return -EINVAL;
2803 }
2804
2805 if (ret)
2806 return ret;
2807
2808 return count;
2809}
2810
2811static const struct file_operations fops_kp = {
2812 .read = read_enabled_file_bool,
2813 .write = write_enabled_file_bool,
2814 .llseek = default_llseek,
2815};
2816
2817static int __init debugfs_kprobe_init(void)
2818{
2819 struct dentry *dir;
2820 unsigned int value = 1;
2821
2822 dir = debugfs_create_dir("kprobes", NULL);
2823
2824 debugfs_create_file("list", 0400, dir, NULL, &kprobes_fops);
2825
2826 debugfs_create_file("enabled", 0600, dir, &value, &fops_kp);
2827
2828 debugfs_create_file("blacklist", 0400, dir, NULL,
2829 &kprobe_blacklist_fops);
2830
2831 return 0;
2832}
2833
2834late_initcall(debugfs_kprobe_init);
2835#endif /* CONFIG_DEBUG_FS */