2 * Kernel Probes Jump Optimization (Optprobes)
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
18 * Copyright (C) IBM Corporation, 2002, 2004
19 * Copyright (C) Hitachi Ltd., 2012
21 #include <linux/kprobes.h>
22 #include <linux/ptrace.h>
23 #include <linux/string.h>
24 #include <linux/slab.h>
25 #include <linux/hardirq.h>
26 #include <linux/preempt.h>
27 #include <linux/extable.h>
28 #include <linux/kdebug.h>
29 #include <linux/kallsyms.h>
30 #include <linux/ftrace.h>
31 #include <linux/frame.h>
33 #include <asm/text-patching.h>
34 #include <asm/cacheflush.h>
36 #include <asm/pgtable.h>
37 #include <linux/uaccess.h>
38 #include <asm/alternative.h>
40 #include <asm/debugreg.h>
41 #include <asm/set_memory.h>
42 #include <asm/sections.h>
46 unsigned long __recover_optprobed_insn(kprobe_opcode_t *buf, unsigned long addr)
48 struct optimized_kprobe *op;
53 for (i = 0; i < RELATIVEJUMP_SIZE; i++) {
54 kp = get_kprobe((void *)addr - i);
55 /* This function only handles jump-optimized kprobe */
56 if (kp && kprobe_optimized(kp)) {
57 op = container_of(kp, struct optimized_kprobe, kp);
58 /* If op->list is not empty, op is under optimizing */
59 if (list_empty(&op->list))
67 * If the kprobe can be optimized, original bytes which can be
68 * overwritten by jump destination address. In this case, original
69 * bytes must be recovered from op->optinsn.copied_insn buffer.
71 if (probe_kernel_read(buf, (void *)addr,
72 MAX_INSN_SIZE * sizeof(kprobe_opcode_t)))
75 if (addr == (unsigned long)kp->addr) {
77 memcpy(buf + 1, op->optinsn.copied_insn, RELATIVE_ADDR_SIZE);
79 offs = addr - (unsigned long)kp->addr - 1;
80 memcpy(buf, op->optinsn.copied_insn + offs, RELATIVE_ADDR_SIZE - offs);
83 return (unsigned long)buf;
86 /* Insert a move instruction which sets a pointer to eax/rdi (1st arg). */
87 static void synthesize_set_arg1(kprobe_opcode_t *addr, unsigned long val)
95 *(unsigned long *)addr = val;
99 "optprobe_template_func:\n"
100 ".global optprobe_template_entry\n"
101 "optprobe_template_entry:\n"
103 /* We don't bother saving the ss register */
108 ".global optprobe_template_val\n"
109 "optprobe_template_val:\n"
112 ".global optprobe_template_call\n"
113 "optprobe_template_call:\n"
115 /* Move flags to rsp */
116 " movq 144(%rsp), %rdx\n"
117 " movq %rdx, 152(%rsp)\n"
119 /* Skip flags entry */
122 #else /* CONFIG_X86_32 */
126 ".global optprobe_template_val\n"
127 "optprobe_template_val:\n"
129 ".global optprobe_template_call\n"
130 "optprobe_template_call:\n"
133 " addl $4, %esp\n" /* skip cs */
136 ".global optprobe_template_end\n"
137 "optprobe_template_end:\n"
138 ".type optprobe_template_func, @function\n"
139 ".size optprobe_template_func, .-optprobe_template_func\n");
141 void optprobe_template_func(void);
142 STACK_FRAME_NON_STANDARD(optprobe_template_func);
144 #define TMPL_MOVE_IDX \
145 ((long)optprobe_template_val - (long)optprobe_template_entry)
146 #define TMPL_CALL_IDX \
147 ((long)optprobe_template_call - (long)optprobe_template_entry)
148 #define TMPL_END_IDX \
149 ((long)optprobe_template_end - (long)optprobe_template_entry)
151 #define INT3_SIZE sizeof(kprobe_opcode_t)
153 /* Optimized kprobe call back function: called from optinsn */
155 optimized_callback(struct optimized_kprobe *op, struct pt_regs *regs)
157 /* This is possible if op is under delayed unoptimizing */
158 if (kprobe_disabled(&op->kp))
162 if (kprobe_running()) {
163 kprobes_inc_nmissed_count(&op->kp);
165 struct kprobe_ctlblk *kcb = get_kprobe_ctlblk();
166 /* Save skipped registers */
168 regs->cs = __KERNEL_CS;
170 regs->cs = __KERNEL_CS | get_kernel_rpl();
173 regs->ip = (unsigned long)op->kp.addr + INT3_SIZE;
174 regs->orig_ax = ~0UL;
176 __this_cpu_write(current_kprobe, &op->kp);
177 kcb->kprobe_status = KPROBE_HIT_ACTIVE;
178 opt_pre_handler(&op->kp, regs);
179 __this_cpu_write(current_kprobe, NULL);
181 preempt_enable_no_resched();
183 NOKPROBE_SYMBOL(optimized_callback);
185 static int copy_optimized_instructions(u8 *dest, u8 *src, u8 *real)
190 while (len < RELATIVEJUMP_SIZE) {
191 ret = __copy_instruction(dest + len, src + len, real, &insn);
192 if (!ret || !can_boost(&insn, src + len))
196 /* Check whether the address range is reserved */
197 if (ftrace_text_reserved(src, src + len - 1) ||
198 alternatives_text_reserved(src, src + len - 1) ||
199 jump_label_text_reserved(src, src + len - 1))
205 /* Check whether insn is indirect jump */
206 static int insn_is_indirect_jump(struct insn *insn)
208 return ((insn->opcode.bytes[0] == 0xff &&
209 (X86_MODRM_REG(insn->modrm.value) & 6) == 4) || /* Jump */
210 insn->opcode.bytes[0] == 0xea); /* Segment based jump */
213 /* Check whether insn jumps into specified address range */
214 static int insn_jump_into_range(struct insn *insn, unsigned long start, int len)
216 unsigned long target = 0;
218 switch (insn->opcode.bytes[0]) {
219 case 0xe0: /* loopne */
220 case 0xe1: /* loope */
221 case 0xe2: /* loop */
222 case 0xe3: /* jcxz */
223 case 0xe9: /* near relative jump */
224 case 0xeb: /* short relative jump */
227 if ((insn->opcode.bytes[1] & 0xf0) == 0x80) /* jcc near */
231 if ((insn->opcode.bytes[0] & 0xf0) == 0x70) /* jcc short */
235 target = (unsigned long)insn->next_byte + insn->immediate.value;
237 return (start <= target && target <= start + len);
240 /* Decode whole function to ensure any instructions don't jump into target */
241 static int can_optimize(unsigned long paddr)
243 unsigned long addr, size = 0, offset = 0;
245 kprobe_opcode_t buf[MAX_INSN_SIZE];
247 /* Lookup symbol including addr */
248 if (!kallsyms_lookup_size_offset(paddr, &size, &offset))
252 * Do not optimize in the entry code due to the unstable
253 * stack handling and registers setup.
255 if (((paddr >= (unsigned long)__entry_text_start) &&
256 (paddr < (unsigned long)__entry_text_end)) ||
257 ((paddr >= (unsigned long)__irqentry_text_start) &&
258 (paddr < (unsigned long)__irqentry_text_end)))
261 /* Check there is enough space for a relative jump. */
262 if (size - offset < RELATIVEJUMP_SIZE)
265 /* Decode instructions */
266 addr = paddr - offset;
267 while (addr < paddr - offset + size) { /* Decode until function end */
268 unsigned long recovered_insn;
269 if (search_exception_tables(addr))
271 * Since some fixup code will jumps into this function,
272 * we can't optimize kprobe in this function.
275 recovered_insn = recover_probed_instruction(buf, addr);
278 kernel_insn_init(&insn, (void *)recovered_insn, MAX_INSN_SIZE);
279 insn_get_length(&insn);
280 /* Another subsystem puts a breakpoint */
281 if (insn.opcode.bytes[0] == BREAKPOINT_INSTRUCTION)
283 /* Recover address */
284 insn.kaddr = (void *)addr;
285 insn.next_byte = (void *)(addr + insn.length);
286 /* Check any instructions don't jump into target */
287 if (insn_is_indirect_jump(&insn) ||
288 insn_jump_into_range(&insn, paddr + INT3_SIZE,
297 /* Check optimized_kprobe can actually be optimized. */
298 int arch_check_optimized_kprobe(struct optimized_kprobe *op)
303 for (i = 1; i < op->optinsn.size; i++) {
304 p = get_kprobe(op->kp.addr + i);
305 if (p && !kprobe_disabled(p))
312 /* Check the addr is within the optimized instructions. */
313 int arch_within_optimized_kprobe(struct optimized_kprobe *op,
316 return ((unsigned long)op->kp.addr <= addr &&
317 (unsigned long)op->kp.addr + op->optinsn.size > addr);
320 /* Free optimized instruction slot */
322 void __arch_remove_optimized_kprobe(struct optimized_kprobe *op, int dirty)
324 if (op->optinsn.insn) {
325 free_optinsn_slot(op->optinsn.insn, dirty);
326 op->optinsn.insn = NULL;
327 op->optinsn.size = 0;
331 void arch_remove_optimized_kprobe(struct optimized_kprobe *op)
333 __arch_remove_optimized_kprobe(op, 1);
337 * Copy replacing target instructions
338 * Target instructions MUST be relocatable (checked inside)
339 * This is called when new aggr(opt)probe is allocated or reused.
341 int arch_prepare_optimized_kprobe(struct optimized_kprobe *op,
342 struct kprobe *__unused)
344 u8 *buf = NULL, *slot;
348 if (!can_optimize((unsigned long)op->kp.addr))
351 buf = kzalloc(MAX_OPTINSN_SIZE, GFP_KERNEL);
355 op->optinsn.insn = slot = get_optinsn_slot();
362 * Verify if the address gap is in 2GB range, because this uses
365 rel = (long)slot - (long)op->kp.addr + RELATIVEJUMP_SIZE;
366 if (abs(rel) > 0x7fffffff) {
371 /* Copy arch-dep-instance from template */
372 memcpy(buf, optprobe_template_entry, TMPL_END_IDX);
374 /* Copy instructions into the out-of-line buffer */
375 ret = copy_optimized_instructions(buf + TMPL_END_IDX, op->kp.addr,
376 slot + TMPL_END_IDX);
379 op->optinsn.size = ret;
380 len = TMPL_END_IDX + op->optinsn.size;
382 /* Set probe information */
383 synthesize_set_arg1(buf + TMPL_MOVE_IDX, (unsigned long)op);
385 /* Set probe function call */
386 synthesize_relcall(buf + TMPL_CALL_IDX,
387 slot + TMPL_CALL_IDX, optimized_callback);
389 /* Set returning jmp instruction at the tail of out-of-line buffer */
390 synthesize_reljump(buf + len, slot + len,
391 (u8 *)op->kp.addr + op->optinsn.size);
392 len += RELATIVEJUMP_SIZE;
394 /* We have to use text_poke for instuction buffer because it is RO */
395 text_poke(slot, buf, len);
402 __arch_remove_optimized_kprobe(op, 0);
407 * Replace breakpoints (int3) with relative jumps.
408 * Caller must call with locking kprobe_mutex and text_mutex.
410 void arch_optimize_kprobes(struct list_head *oplist)
412 struct optimized_kprobe *op, *tmp;
413 u8 insn_buf[RELATIVEJUMP_SIZE];
415 list_for_each_entry_safe(op, tmp, oplist, list) {
416 s32 rel = (s32)((long)op->optinsn.insn -
417 ((long)op->kp.addr + RELATIVEJUMP_SIZE));
419 WARN_ON(kprobe_disabled(&op->kp));
421 /* Backup instructions which will be replaced by jump address */
422 memcpy(op->optinsn.copied_insn, op->kp.addr + INT3_SIZE,
425 insn_buf[0] = RELATIVEJUMP_OPCODE;
426 *(s32 *)(&insn_buf[1]) = rel;
428 text_poke_bp(op->kp.addr, insn_buf, RELATIVEJUMP_SIZE,
431 list_del_init(&op->list);
435 /* Replace a relative jump with a breakpoint (int3). */
436 void arch_unoptimize_kprobe(struct optimized_kprobe *op)
438 u8 insn_buf[RELATIVEJUMP_SIZE];
440 /* Set int3 to first byte for kprobes */
441 insn_buf[0] = BREAKPOINT_INSTRUCTION;
442 memcpy(insn_buf + 1, op->optinsn.copied_insn, RELATIVE_ADDR_SIZE);
443 text_poke_bp(op->kp.addr, insn_buf, RELATIVEJUMP_SIZE,
448 * Recover original instructions and breakpoints from relative jumps.
449 * Caller must call with locking kprobe_mutex.
451 extern void arch_unoptimize_kprobes(struct list_head *oplist,
452 struct list_head *done_list)
454 struct optimized_kprobe *op, *tmp;
456 list_for_each_entry_safe(op, tmp, oplist, list) {
457 arch_unoptimize_kprobe(op);
458 list_move(&op->list, done_list);
462 int setup_detour_execution(struct kprobe *p, struct pt_regs *regs, int reenter)
464 struct optimized_kprobe *op;
466 if (p->flags & KPROBE_FLAG_OPTIMIZED) {
467 /* This kprobe is really able to run optimized path. */
468 op = container_of(p, struct optimized_kprobe, kp);
469 /* Detour through copied instructions */
470 regs->ip = (unsigned long)op->optinsn.insn + TMPL_END_IDX;
472 reset_current_kprobe();
473 preempt_enable_no_resched();
478 NOKPROBE_SYMBOL(setup_detour_execution);