Commit | Line | Data |
---|---|---|
2b144498 | 1 | /* |
7b2d81d4 | 2 | * User-space Probes (UProbes) |
2b144498 SD |
3 | * |
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. | |
8 | * | |
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. | |
13 | * | |
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. | |
17 | * | |
35aa621b | 18 | * Copyright (C) IBM Corporation, 2008-2012 |
2b144498 SD |
19 | * Authors: |
20 | * Srikar Dronamraju | |
21 | * Jim Keniston | |
90eec103 | 22 | * Copyright (C) 2011-2012 Red Hat, Inc., Peter Zijlstra |
2b144498 SD |
23 | */ |
24 | ||
25 | #include <linux/kernel.h> | |
26 | #include <linux/highmem.h> | |
27 | #include <linux/pagemap.h> /* read_mapping_page */ | |
28 | #include <linux/slab.h> | |
29 | #include <linux/sched.h> | |
e8440c14 | 30 | #include <linux/export.h> |
2b144498 SD |
31 | #include <linux/rmap.h> /* anon_vma_prepare */ |
32 | #include <linux/mmu_notifier.h> /* set_pte_at_notify */ | |
33 | #include <linux/swap.h> /* try_to_free_swap */ | |
0326f5a9 SD |
34 | #include <linux/ptrace.h> /* user_enable_single_step */ |
35 | #include <linux/kdebug.h> /* notifier mechanism */ | |
194f8dcb | 36 | #include "../../mm/internal.h" /* munlock_vma_page */ |
32cdba1e | 37 | #include <linux/percpu-rwsem.h> |
aa59c53f | 38 | #include <linux/task_work.h> |
40814f68 | 39 | #include <linux/shmem_fs.h> |
7b2d81d4 | 40 | |
2b144498 SD |
41 | #include <linux/uprobes.h> |
42 | ||
d4b3b638 SD |
43 | #define UINSNS_PER_PAGE (PAGE_SIZE/UPROBE_XOL_SLOT_BYTES) |
44 | #define MAX_UPROBE_XOL_SLOTS UINSNS_PER_PAGE | |
45 | ||
2b144498 | 46 | static struct rb_root uprobes_tree = RB_ROOT; |
441f1eb7 ON |
47 | /* |
48 | * allows us to skip the uprobe_mmap if there are no uprobe events active | |
49 | * at this time. Probably a fine grained per inode count is better? | |
50 | */ | |
51 | #define no_uprobe_events() RB_EMPTY_ROOT(&uprobes_tree) | |
7b2d81d4 | 52 | |
2b144498 SD |
53 | static DEFINE_SPINLOCK(uprobes_treelock); /* serialize rbtree access */ |
54 | ||
55 | #define UPROBES_HASH_SZ 13 | |
2b144498 SD |
56 | /* serialize uprobe->pending_list */ |
57 | static struct mutex uprobes_mmap_mutex[UPROBES_HASH_SZ]; | |
7b2d81d4 | 58 | #define uprobes_mmap_hash(v) (&uprobes_mmap_mutex[((unsigned long)(v)) % UPROBES_HASH_SZ]) |
2b144498 | 59 | |
32cdba1e ON |
60 | static struct percpu_rw_semaphore dup_mmap_sem; |
61 | ||
cb9a19fe | 62 | /* Have a copy of original instruction */ |
71434f2f | 63 | #define UPROBE_COPY_INSN 0 |
cb9a19fe | 64 | |
3ff54efd SD |
65 | struct uprobe { |
66 | struct rb_node rb_node; /* node in the rb tree */ | |
67 | atomic_t ref; | |
e591c8d7 | 68 | struct rw_semaphore register_rwsem; |
3ff54efd SD |
69 | struct rw_semaphore consumer_rwsem; |
70 | struct list_head pending_list; | |
71 | struct uprobe_consumer *consumers; | |
72 | struct inode *inode; /* Also hold a ref to inode */ | |
73 | loff_t offset; | |
71434f2f | 74 | unsigned long flags; |
ad439356 ON |
75 | |
76 | /* | |
77 | * The generic code assumes that it has two members of unknown type | |
78 | * owned by the arch-specific code: | |
79 | * | |
80 | * insn - copy_insn() saves the original instruction here for | |
81 | * arch_uprobe_analyze_insn(). | |
82 | * | |
83 | * ixol - potentially modified instruction to execute out of | |
84 | * line, copied to xol_area by xol_get_insn_slot(). | |
85 | */ | |
3ff54efd SD |
86 | struct arch_uprobe arch; |
87 | }; | |
88 | ||
c912dae6 | 89 | /* |
ad439356 ON |
90 | * Execute out of line area: anonymous executable mapping installed |
91 | * by the probed task to execute the copy of the original instruction | |
92 | * mangled by set_swbp(). | |
93 | * | |
c912dae6 ON |
94 | * On a breakpoint hit, thread contests for a slot. It frees the |
95 | * slot after singlestep. Currently a fixed number of slots are | |
96 | * allocated. | |
97 | */ | |
98 | struct xol_area { | |
704bde3c ON |
99 | wait_queue_head_t wq; /* if all slots are busy */ |
100 | atomic_t slot_count; /* number of in-use slots */ | |
101 | unsigned long *bitmap; /* 0 = free slot */ | |
c912dae6 | 102 | |
704bde3c ON |
103 | struct vm_special_mapping xol_mapping; |
104 | struct page *pages[2]; | |
c912dae6 ON |
105 | /* |
106 | * We keep the vma's vm_start rather than a pointer to the vma | |
107 | * itself. The probed process or a naughty kernel module could make | |
108 | * the vma go away, and we must handle that reasonably gracefully. | |
109 | */ | |
704bde3c | 110 | unsigned long vaddr; /* Page(s) of instruction slots */ |
c912dae6 ON |
111 | }; |
112 | ||
2b144498 SD |
113 | /* |
114 | * valid_vma: Verify if the specified vma is an executable vma | |
115 | * Relax restrictions while unregistering: vm_flags might have | |
116 | * changed after breakpoint was inserted. | |
117 | * - is_register: indicates if we are in register context. | |
118 | * - Return 1 if the specified virtual address is in an | |
119 | * executable vma. | |
120 | */ | |
121 | static bool valid_vma(struct vm_area_struct *vma, bool is_register) | |
122 | { | |
13f59c5e | 123 | vm_flags_t flags = VM_HUGETLB | VM_MAYEXEC | VM_MAYSHARE; |
2b144498 | 124 | |
e40cfce6 ON |
125 | if (is_register) |
126 | flags |= VM_WRITE; | |
2b144498 | 127 | |
e40cfce6 | 128 | return vma->vm_file && (vma->vm_flags & flags) == VM_MAYEXEC; |
2b144498 SD |
129 | } |
130 | ||
57683f72 | 131 | static unsigned long offset_to_vaddr(struct vm_area_struct *vma, loff_t offset) |
2b144498 | 132 | { |
57683f72 | 133 | return vma->vm_start + offset - ((loff_t)vma->vm_pgoff << PAGE_SHIFT); |
2b144498 SD |
134 | } |
135 | ||
cb113b47 ON |
136 | static loff_t vaddr_to_offset(struct vm_area_struct *vma, unsigned long vaddr) |
137 | { | |
138 | return ((loff_t)vma->vm_pgoff << PAGE_SHIFT) + (vaddr - vma->vm_start); | |
139 | } | |
140 | ||
2b144498 SD |
141 | /** |
142 | * __replace_page - replace page in vma by new page. | |
143 | * based on replace_page in mm/ksm.c | |
144 | * | |
145 | * @vma: vma that holds the pte pointing to page | |
c517ee74 | 146 | * @addr: address the old @page is mapped at |
2b144498 SD |
147 | * @page: the cowed page we are replacing by kpage |
148 | * @kpage: the modified page we replace page by | |
149 | * | |
150 | * Returns 0 on success, -EFAULT on failure. | |
151 | */ | |
c517ee74 ON |
152 | static int __replace_page(struct vm_area_struct *vma, unsigned long addr, |
153 | struct page *page, struct page *kpage) | |
2b144498 SD |
154 | { |
155 | struct mm_struct *mm = vma->vm_mm; | |
5323ce71 ON |
156 | spinlock_t *ptl; |
157 | pte_t *ptep; | |
9f92448c | 158 | int err; |
6bdb913f HE |
159 | /* For mmu_notifiers */ |
160 | const unsigned long mmun_start = addr; | |
161 | const unsigned long mmun_end = addr + PAGE_SIZE; | |
00501b53 JW |
162 | struct mem_cgroup *memcg; |
163 | ||
f627c2f5 KS |
164 | err = mem_cgroup_try_charge(kpage, vma->vm_mm, GFP_KERNEL, &memcg, |
165 | false); | |
00501b53 JW |
166 | if (err) |
167 | return err; | |
2b144498 | 168 | |
194f8dcb | 169 | /* For try_to_free_swap() and munlock_vma_page() below */ |
9f92448c ON |
170 | lock_page(page); |
171 | ||
6bdb913f | 172 | mmu_notifier_invalidate_range_start(mm, mmun_start, mmun_end); |
9f92448c | 173 | err = -EAGAIN; |
5323ce71 | 174 | ptep = page_check_address(page, mm, addr, &ptl, 0); |
6c4687cc ON |
175 | if (!ptep) { |
176 | mem_cgroup_cancel_charge(kpage, memcg, false); | |
9f92448c | 177 | goto unlock; |
6c4687cc | 178 | } |
2b144498 SD |
179 | |
180 | get_page(kpage); | |
d281ee61 | 181 | page_add_new_anon_rmap(kpage, vma, addr, false); |
f627c2f5 | 182 | mem_cgroup_commit_charge(kpage, memcg, false, false); |
00501b53 | 183 | lru_cache_add_active_or_unevictable(kpage, vma); |
2b144498 | 184 | |
7396fa81 | 185 | if (!PageAnon(page)) { |
eca56ff9 | 186 | dec_mm_counter(mm, mm_counter_file(page)); |
7396fa81 SD |
187 | inc_mm_counter(mm, MM_ANONPAGES); |
188 | } | |
189 | ||
2b144498 | 190 | flush_cache_page(vma, addr, pte_pfn(*ptep)); |
34ee645e | 191 | ptep_clear_flush_notify(vma, addr, ptep); |
2b144498 SD |
192 | set_pte_at_notify(mm, addr, ptep, mk_pte(kpage, vma->vm_page_prot)); |
193 | ||
d281ee61 | 194 | page_remove_rmap(page, false); |
2b144498 SD |
195 | if (!page_mapped(page)) |
196 | try_to_free_swap(page); | |
2b144498 | 197 | pte_unmap_unlock(ptep, ptl); |
2b144498 | 198 | |
194f8dcb ON |
199 | if (vma->vm_flags & VM_LOCKED) |
200 | munlock_vma_page(page); | |
201 | put_page(page); | |
202 | ||
9f92448c ON |
203 | err = 0; |
204 | unlock: | |
6bdb913f | 205 | mmu_notifier_invalidate_range_end(mm, mmun_start, mmun_end); |
9f92448c ON |
206 | unlock_page(page); |
207 | return err; | |
2b144498 SD |
208 | } |
209 | ||
210 | /** | |
5cb4ac3a | 211 | * is_swbp_insn - check if instruction is breakpoint instruction. |
2b144498 | 212 | * @insn: instruction to be checked. |
5cb4ac3a | 213 | * Default implementation of is_swbp_insn |
2b144498 SD |
214 | * Returns true if @insn is a breakpoint instruction. |
215 | */ | |
5cb4ac3a | 216 | bool __weak is_swbp_insn(uprobe_opcode_t *insn) |
2b144498 | 217 | { |
5cb4ac3a | 218 | return *insn == UPROBE_SWBP_INSN; |
2b144498 SD |
219 | } |
220 | ||
0908ad6e AM |
221 | /** |
222 | * is_trap_insn - check if instruction is breakpoint instruction. | |
223 | * @insn: instruction to be checked. | |
224 | * Default implementation of is_trap_insn | |
225 | * Returns true if @insn is a breakpoint instruction. | |
226 | * | |
227 | * This function is needed for the case where an architecture has multiple | |
228 | * trap instructions (like powerpc). | |
229 | */ | |
230 | bool __weak is_trap_insn(uprobe_opcode_t *insn) | |
231 | { | |
232 | return is_swbp_insn(insn); | |
233 | } | |
234 | ||
ab0d805c | 235 | static void copy_from_page(struct page *page, unsigned long vaddr, void *dst, int len) |
cceb55aa ON |
236 | { |
237 | void *kaddr = kmap_atomic(page); | |
ab0d805c | 238 | memcpy(dst, kaddr + (vaddr & ~PAGE_MASK), len); |
cceb55aa ON |
239 | kunmap_atomic(kaddr); |
240 | } | |
241 | ||
5669ccee ON |
242 | static void copy_to_page(struct page *page, unsigned long vaddr, const void *src, int len) |
243 | { | |
244 | void *kaddr = kmap_atomic(page); | |
245 | memcpy(kaddr + (vaddr & ~PAGE_MASK), src, len); | |
246 | kunmap_atomic(kaddr); | |
247 | } | |
248 | ||
ed6f6a50 ON |
249 | static int verify_opcode(struct page *page, unsigned long vaddr, uprobe_opcode_t *new_opcode) |
250 | { | |
251 | uprobe_opcode_t old_opcode; | |
252 | bool is_swbp; | |
253 | ||
0908ad6e AM |
254 | /* |
255 | * Note: We only check if the old_opcode is UPROBE_SWBP_INSN here. | |
256 | * We do not check if it is any other 'trap variant' which could | |
257 | * be conditional trap instruction such as the one powerpc supports. | |
258 | * | |
259 | * The logic is that we do not care if the underlying instruction | |
260 | * is a trap variant; uprobes always wins over any other (gdb) | |
261 | * breakpoint. | |
262 | */ | |
ab0d805c | 263 | copy_from_page(page, vaddr, &old_opcode, UPROBE_SWBP_INSN_SIZE); |
ed6f6a50 ON |
264 | is_swbp = is_swbp_insn(&old_opcode); |
265 | ||
266 | if (is_swbp_insn(new_opcode)) { | |
267 | if (is_swbp) /* register: already installed? */ | |
268 | return 0; | |
269 | } else { | |
270 | if (!is_swbp) /* unregister: was it changed by us? */ | |
076a365b | 271 | return 0; |
ed6f6a50 ON |
272 | } |
273 | ||
274 | return 1; | |
275 | } | |
276 | ||
2b144498 SD |
277 | /* |
278 | * NOTE: | |
279 | * Expect the breakpoint instruction to be the smallest size instruction for | |
280 | * the architecture. If an arch has variable length instruction and the | |
281 | * breakpoint instruction is not of the smallest length instruction | |
0908ad6e | 282 | * supported by that architecture then we need to modify is_trap_at_addr and |
f72d41fa ON |
283 | * uprobe_write_opcode accordingly. This would never be a problem for archs |
284 | * that have fixed length instructions. | |
29dedee0 | 285 | * |
f72d41fa | 286 | * uprobe_write_opcode - write the opcode at a given virtual address. |
2b144498 | 287 | * @mm: the probed process address space. |
2b144498 SD |
288 | * @vaddr: the virtual address to store the opcode. |
289 | * @opcode: opcode to be written at @vaddr. | |
290 | * | |
29dedee0 | 291 | * Called with mm->mmap_sem held for write. |
2b144498 SD |
292 | * Return 0 (success) or a negative errno. |
293 | */ | |
f72d41fa | 294 | int uprobe_write_opcode(struct mm_struct *mm, unsigned long vaddr, |
cceb55aa | 295 | uprobe_opcode_t opcode) |
2b144498 SD |
296 | { |
297 | struct page *old_page, *new_page; | |
2b144498 | 298 | struct vm_area_struct *vma; |
2b144498 | 299 | int ret; |
f403072c | 300 | |
5323ce71 | 301 | retry: |
2b144498 | 302 | /* Read the page with vaddr into memory */ |
1e987790 | 303 | ret = get_user_pages_remote(NULL, mm, vaddr, 1, 0, 1, &old_page, &vma); |
2b144498 SD |
304 | if (ret <= 0) |
305 | return ret; | |
7b2d81d4 | 306 | |
ed6f6a50 ON |
307 | ret = verify_opcode(old_page, vaddr, &opcode); |
308 | if (ret <= 0) | |
309 | goto put_old; | |
310 | ||
29dedee0 ON |
311 | ret = anon_vma_prepare(vma); |
312 | if (ret) | |
313 | goto put_old; | |
314 | ||
2b144498 SD |
315 | ret = -ENOMEM; |
316 | new_page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma, vaddr); | |
317 | if (!new_page) | |
9f92448c | 318 | goto put_old; |
2b144498 | 319 | |
29dedee0 | 320 | __SetPageUptodate(new_page); |
3f47107c ON |
321 | copy_highpage(new_page, old_page); |
322 | copy_to_page(new_page, vaddr, &opcode, UPROBE_SWBP_INSN_SIZE); | |
2b144498 | 323 | |
c517ee74 | 324 | ret = __replace_page(vma, vaddr, old_page, new_page); |
09cbfeaf | 325 | put_page(new_page); |
9f92448c | 326 | put_old: |
7b2d81d4 IM |
327 | put_page(old_page); |
328 | ||
5323ce71 ON |
329 | if (unlikely(ret == -EAGAIN)) |
330 | goto retry; | |
2b144498 SD |
331 | return ret; |
332 | } | |
333 | ||
2b144498 | 334 | /** |
5cb4ac3a | 335 | * set_swbp - store breakpoint at a given address. |
e3343e6a | 336 | * @auprobe: arch specific probepoint information. |
2b144498 | 337 | * @mm: the probed process address space. |
2b144498 SD |
338 | * @vaddr: the virtual address to insert the opcode. |
339 | * | |
340 | * For mm @mm, store the breakpoint instruction at @vaddr. | |
341 | * Return 0 (success) or a negative errno. | |
342 | */ | |
5cb4ac3a | 343 | int __weak set_swbp(struct arch_uprobe *auprobe, struct mm_struct *mm, unsigned long vaddr) |
2b144498 | 344 | { |
f72d41fa | 345 | return uprobe_write_opcode(mm, vaddr, UPROBE_SWBP_INSN); |
2b144498 SD |
346 | } |
347 | ||
348 | /** | |
349 | * set_orig_insn - Restore the original instruction. | |
350 | * @mm: the probed process address space. | |
e3343e6a | 351 | * @auprobe: arch specific probepoint information. |
2b144498 | 352 | * @vaddr: the virtual address to insert the opcode. |
2b144498 SD |
353 | * |
354 | * For mm @mm, restore the original opcode (opcode) at @vaddr. | |
355 | * Return 0 (success) or a negative errno. | |
356 | */ | |
7b2d81d4 | 357 | int __weak |
ded86e7c | 358 | set_orig_insn(struct arch_uprobe *auprobe, struct mm_struct *mm, unsigned long vaddr) |
2b144498 | 359 | { |
803200e2 | 360 | return uprobe_write_opcode(mm, vaddr, *(uprobe_opcode_t *)&auprobe->insn); |
2b144498 SD |
361 | } |
362 | ||
f231722a ON |
363 | static struct uprobe *get_uprobe(struct uprobe *uprobe) |
364 | { | |
365 | atomic_inc(&uprobe->ref); | |
366 | return uprobe; | |
367 | } | |
368 | ||
369 | static void put_uprobe(struct uprobe *uprobe) | |
370 | { | |
371 | if (atomic_dec_and_test(&uprobe->ref)) | |
372 | kfree(uprobe); | |
373 | } | |
374 | ||
2b144498 SD |
375 | static int match_uprobe(struct uprobe *l, struct uprobe *r) |
376 | { | |
377 | if (l->inode < r->inode) | |
378 | return -1; | |
7b2d81d4 | 379 | |
2b144498 SD |
380 | if (l->inode > r->inode) |
381 | return 1; | |
2b144498 | 382 | |
7b2d81d4 IM |
383 | if (l->offset < r->offset) |
384 | return -1; | |
385 | ||
386 | if (l->offset > r->offset) | |
387 | return 1; | |
2b144498 SD |
388 | |
389 | return 0; | |
390 | } | |
391 | ||
392 | static struct uprobe *__find_uprobe(struct inode *inode, loff_t offset) | |
393 | { | |
394 | struct uprobe u = { .inode = inode, .offset = offset }; | |
395 | struct rb_node *n = uprobes_tree.rb_node; | |
396 | struct uprobe *uprobe; | |
397 | int match; | |
398 | ||
399 | while (n) { | |
400 | uprobe = rb_entry(n, struct uprobe, rb_node); | |
401 | match = match_uprobe(&u, uprobe); | |
f231722a ON |
402 | if (!match) |
403 | return get_uprobe(uprobe); | |
7b2d81d4 | 404 | |
2b144498 SD |
405 | if (match < 0) |
406 | n = n->rb_left; | |
407 | else | |
408 | n = n->rb_right; | |
409 | } | |
410 | return NULL; | |
411 | } | |
412 | ||
413 | /* | |
414 | * Find a uprobe corresponding to a given inode:offset | |
415 | * Acquires uprobes_treelock | |
416 | */ | |
417 | static struct uprobe *find_uprobe(struct inode *inode, loff_t offset) | |
418 | { | |
419 | struct uprobe *uprobe; | |
2b144498 | 420 | |
6f47caa0 | 421 | spin_lock(&uprobes_treelock); |
2b144498 | 422 | uprobe = __find_uprobe(inode, offset); |
6f47caa0 | 423 | spin_unlock(&uprobes_treelock); |
7b2d81d4 | 424 | |
2b144498 SD |
425 | return uprobe; |
426 | } | |
427 | ||
428 | static struct uprobe *__insert_uprobe(struct uprobe *uprobe) | |
429 | { | |
430 | struct rb_node **p = &uprobes_tree.rb_node; | |
431 | struct rb_node *parent = NULL; | |
432 | struct uprobe *u; | |
433 | int match; | |
434 | ||
435 | while (*p) { | |
436 | parent = *p; | |
437 | u = rb_entry(parent, struct uprobe, rb_node); | |
438 | match = match_uprobe(uprobe, u); | |
f231722a ON |
439 | if (!match) |
440 | return get_uprobe(u); | |
2b144498 SD |
441 | |
442 | if (match < 0) | |
443 | p = &parent->rb_left; | |
444 | else | |
445 | p = &parent->rb_right; | |
446 | ||
447 | } | |
7b2d81d4 | 448 | |
2b144498 SD |
449 | u = NULL; |
450 | rb_link_node(&uprobe->rb_node, parent, p); | |
451 | rb_insert_color(&uprobe->rb_node, &uprobes_tree); | |
452 | /* get access + creation ref */ | |
453 | atomic_set(&uprobe->ref, 2); | |
7b2d81d4 | 454 | |
2b144498 SD |
455 | return u; |
456 | } | |
457 | ||
458 | /* | |
7b2d81d4 | 459 | * Acquire uprobes_treelock. |
2b144498 SD |
460 | * Matching uprobe already exists in rbtree; |
461 | * increment (access refcount) and return the matching uprobe. | |
462 | * | |
463 | * No matching uprobe; insert the uprobe in rb_tree; | |
464 | * get a double refcount (access + creation) and return NULL. | |
465 | */ | |
466 | static struct uprobe *insert_uprobe(struct uprobe *uprobe) | |
467 | { | |
2b144498 SD |
468 | struct uprobe *u; |
469 | ||
6f47caa0 | 470 | spin_lock(&uprobes_treelock); |
2b144498 | 471 | u = __insert_uprobe(uprobe); |
6f47caa0 | 472 | spin_unlock(&uprobes_treelock); |
7b2d81d4 | 473 | |
2b144498 SD |
474 | return u; |
475 | } | |
476 | ||
2b144498 SD |
477 | static struct uprobe *alloc_uprobe(struct inode *inode, loff_t offset) |
478 | { | |
479 | struct uprobe *uprobe, *cur_uprobe; | |
480 | ||
481 | uprobe = kzalloc(sizeof(struct uprobe), GFP_KERNEL); | |
482 | if (!uprobe) | |
483 | return NULL; | |
484 | ||
485 | uprobe->inode = igrab(inode); | |
486 | uprobe->offset = offset; | |
e591c8d7 | 487 | init_rwsem(&uprobe->register_rwsem); |
2b144498 | 488 | init_rwsem(&uprobe->consumer_rwsem); |
2b144498 SD |
489 | |
490 | /* add to uprobes_tree, sorted on inode:offset */ | |
491 | cur_uprobe = insert_uprobe(uprobe); | |
2b144498 SD |
492 | /* a uprobe exists for this inode:offset combination */ |
493 | if (cur_uprobe) { | |
494 | kfree(uprobe); | |
495 | uprobe = cur_uprobe; | |
496 | iput(inode); | |
7b2d81d4 IM |
497 | } |
498 | ||
2b144498 SD |
499 | return uprobe; |
500 | } | |
501 | ||
9a98e03c | 502 | static void consumer_add(struct uprobe *uprobe, struct uprobe_consumer *uc) |
2b144498 SD |
503 | { |
504 | down_write(&uprobe->consumer_rwsem); | |
e3343e6a SD |
505 | uc->next = uprobe->consumers; |
506 | uprobe->consumers = uc; | |
2b144498 | 507 | up_write(&uprobe->consumer_rwsem); |
2b144498 SD |
508 | } |
509 | ||
510 | /* | |
e3343e6a SD |
511 | * For uprobe @uprobe, delete the consumer @uc. |
512 | * Return true if the @uc is deleted successfully | |
2b144498 SD |
513 | * or return false. |
514 | */ | |
e3343e6a | 515 | static bool consumer_del(struct uprobe *uprobe, struct uprobe_consumer *uc) |
2b144498 SD |
516 | { |
517 | struct uprobe_consumer **con; | |
518 | bool ret = false; | |
519 | ||
520 | down_write(&uprobe->consumer_rwsem); | |
521 | for (con = &uprobe->consumers; *con; con = &(*con)->next) { | |
e3343e6a SD |
522 | if (*con == uc) { |
523 | *con = uc->next; | |
2b144498 SD |
524 | ret = true; |
525 | break; | |
526 | } | |
527 | } | |
528 | up_write(&uprobe->consumer_rwsem); | |
7b2d81d4 | 529 | |
2b144498 SD |
530 | return ret; |
531 | } | |
532 | ||
2ded0980 ON |
533 | static int __copy_insn(struct address_space *mapping, struct file *filp, |
534 | void *insn, int nbytes, loff_t offset) | |
2b144498 | 535 | { |
2b144498 | 536 | struct page *page; |
2b144498 | 537 | /* |
40814f68 ON |
538 | * Ensure that the page that has the original instruction is populated |
539 | * and in page-cache. If ->readpage == NULL it must be shmem_mapping(), | |
540 | * see uprobe_register(). | |
2b144498 | 541 | */ |
40814f68 | 542 | if (mapping->a_ops->readpage) |
09cbfeaf | 543 | page = read_mapping_page(mapping, offset >> PAGE_SHIFT, filp); |
40814f68 | 544 | else |
09cbfeaf | 545 | page = shmem_read_mapping_page(mapping, offset >> PAGE_SHIFT); |
2b144498 SD |
546 | if (IS_ERR(page)) |
547 | return PTR_ERR(page); | |
548 | ||
2edb7b55 | 549 | copy_from_page(page, offset, insn, nbytes); |
09cbfeaf | 550 | put_page(page); |
7b2d81d4 | 551 | |
2b144498 SD |
552 | return 0; |
553 | } | |
554 | ||
d436615e | 555 | static int copy_insn(struct uprobe *uprobe, struct file *filp) |
2b144498 | 556 | { |
2ded0980 ON |
557 | struct address_space *mapping = uprobe->inode->i_mapping; |
558 | loff_t offs = uprobe->offset; | |
803200e2 ON |
559 | void *insn = &uprobe->arch.insn; |
560 | int size = sizeof(uprobe->arch.insn); | |
2ded0980 ON |
561 | int len, err = -EIO; |
562 | ||
563 | /* Copy only available bytes, -EIO if nothing was read */ | |
564 | do { | |
565 | if (offs >= i_size_read(uprobe->inode)) | |
566 | break; | |
567 | ||
568 | len = min_t(int, size, PAGE_SIZE - (offs & ~PAGE_MASK)); | |
569 | err = __copy_insn(mapping, filp, insn, len, offs); | |
fc36f595 | 570 | if (err) |
2ded0980 ON |
571 | break; |
572 | ||
573 | insn += len; | |
574 | offs += len; | |
575 | size -= len; | |
576 | } while (size); | |
577 | ||
578 | return err; | |
2b144498 SD |
579 | } |
580 | ||
cb9a19fe ON |
581 | static int prepare_uprobe(struct uprobe *uprobe, struct file *file, |
582 | struct mm_struct *mm, unsigned long vaddr) | |
583 | { | |
584 | int ret = 0; | |
585 | ||
71434f2f | 586 | if (test_bit(UPROBE_COPY_INSN, &uprobe->flags)) |
cb9a19fe ON |
587 | return ret; |
588 | ||
d4d3ccc6 ON |
589 | /* TODO: move this into _register, until then we abuse this sem. */ |
590 | down_write(&uprobe->consumer_rwsem); | |
71434f2f | 591 | if (test_bit(UPROBE_COPY_INSN, &uprobe->flags)) |
4710f05f ON |
592 | goto out; |
593 | ||
cb9a19fe ON |
594 | ret = copy_insn(uprobe, file); |
595 | if (ret) | |
596 | goto out; | |
597 | ||
598 | ret = -ENOTSUPP; | |
803200e2 | 599 | if (is_trap_insn((uprobe_opcode_t *)&uprobe->arch.insn)) |
cb9a19fe ON |
600 | goto out; |
601 | ||
602 | ret = arch_uprobe_analyze_insn(&uprobe->arch, mm, vaddr); | |
603 | if (ret) | |
604 | goto out; | |
605 | ||
f72d41fa | 606 | /* uprobe_write_opcode() assumes we don't cross page boundary */ |
cb9a19fe ON |
607 | BUG_ON((uprobe->offset & ~PAGE_MASK) + |
608 | UPROBE_SWBP_INSN_SIZE > PAGE_SIZE); | |
609 | ||
610 | smp_wmb(); /* pairs with rmb() in find_active_uprobe() */ | |
71434f2f | 611 | set_bit(UPROBE_COPY_INSN, &uprobe->flags); |
cb9a19fe ON |
612 | |
613 | out: | |
d4d3ccc6 | 614 | up_write(&uprobe->consumer_rwsem); |
4710f05f | 615 | |
cb9a19fe ON |
616 | return ret; |
617 | } | |
618 | ||
8a7f2fa0 ON |
619 | static inline bool consumer_filter(struct uprobe_consumer *uc, |
620 | enum uprobe_filter_ctx ctx, struct mm_struct *mm) | |
806a98bd | 621 | { |
8a7f2fa0 | 622 | return !uc->filter || uc->filter(uc, ctx, mm); |
806a98bd ON |
623 | } |
624 | ||
8a7f2fa0 ON |
625 | static bool filter_chain(struct uprobe *uprobe, |
626 | enum uprobe_filter_ctx ctx, struct mm_struct *mm) | |
63633cbf | 627 | { |
1ff6fee5 ON |
628 | struct uprobe_consumer *uc; |
629 | bool ret = false; | |
630 | ||
631 | down_read(&uprobe->consumer_rwsem); | |
632 | for (uc = uprobe->consumers; uc; uc = uc->next) { | |
8a7f2fa0 | 633 | ret = consumer_filter(uc, ctx, mm); |
1ff6fee5 ON |
634 | if (ret) |
635 | break; | |
636 | } | |
637 | up_read(&uprobe->consumer_rwsem); | |
638 | ||
639 | return ret; | |
63633cbf ON |
640 | } |
641 | ||
e3343e6a SD |
642 | static int |
643 | install_breakpoint(struct uprobe *uprobe, struct mm_struct *mm, | |
816c03fb | 644 | struct vm_area_struct *vma, unsigned long vaddr) |
2b144498 | 645 | { |
f8ac4ec9 | 646 | bool first_uprobe; |
2b144498 SD |
647 | int ret; |
648 | ||
cb9a19fe ON |
649 | ret = prepare_uprobe(uprobe, vma->vm_file, mm, vaddr); |
650 | if (ret) | |
651 | return ret; | |
682968e0 | 652 | |
f8ac4ec9 ON |
653 | /* |
654 | * set MMF_HAS_UPROBES in advance for uprobe_pre_sstep_notifier(), | |
655 | * the task can hit this breakpoint right after __replace_page(). | |
656 | */ | |
657 | first_uprobe = !test_bit(MMF_HAS_UPROBES, &mm->flags); | |
658 | if (first_uprobe) | |
659 | set_bit(MMF_HAS_UPROBES, &mm->flags); | |
660 | ||
816c03fb | 661 | ret = set_swbp(&uprobe->arch, mm, vaddr); |
9f68f672 ON |
662 | if (!ret) |
663 | clear_bit(MMF_RECALC_UPROBES, &mm->flags); | |
664 | else if (first_uprobe) | |
f8ac4ec9 | 665 | clear_bit(MMF_HAS_UPROBES, &mm->flags); |
2b144498 SD |
666 | |
667 | return ret; | |
668 | } | |
669 | ||
076a365b | 670 | static int |
816c03fb | 671 | remove_breakpoint(struct uprobe *uprobe, struct mm_struct *mm, unsigned long vaddr) |
2b144498 | 672 | { |
9f68f672 | 673 | set_bit(MMF_RECALC_UPROBES, &mm->flags); |
076a365b | 674 | return set_orig_insn(&uprobe->arch, mm, vaddr); |
2b144498 SD |
675 | } |
676 | ||
06b7bcd8 ON |
677 | static inline bool uprobe_is_active(struct uprobe *uprobe) |
678 | { | |
679 | return !RB_EMPTY_NODE(&uprobe->rb_node); | |
680 | } | |
0326f5a9 | 681 | /* |
778b032d ON |
682 | * There could be threads that have already hit the breakpoint. They |
683 | * will recheck the current insn and restart if find_uprobe() fails. | |
684 | * See find_active_uprobe(). | |
0326f5a9 | 685 | */ |
2b144498 SD |
686 | static void delete_uprobe(struct uprobe *uprobe) |
687 | { | |
06b7bcd8 ON |
688 | if (WARN_ON(!uprobe_is_active(uprobe))) |
689 | return; | |
690 | ||
6f47caa0 | 691 | spin_lock(&uprobes_treelock); |
2b144498 | 692 | rb_erase(&uprobe->rb_node, &uprobes_tree); |
6f47caa0 | 693 | spin_unlock(&uprobes_treelock); |
06b7bcd8 | 694 | RB_CLEAR_NODE(&uprobe->rb_node); /* for uprobe_is_active() */ |
2b144498 SD |
695 | iput(uprobe->inode); |
696 | put_uprobe(uprobe); | |
2b144498 SD |
697 | } |
698 | ||
26872090 ON |
699 | struct map_info { |
700 | struct map_info *next; | |
701 | struct mm_struct *mm; | |
816c03fb | 702 | unsigned long vaddr; |
26872090 ON |
703 | }; |
704 | ||
705 | static inline struct map_info *free_map_info(struct map_info *info) | |
2b144498 | 706 | { |
26872090 ON |
707 | struct map_info *next = info->next; |
708 | kfree(info); | |
709 | return next; | |
710 | } | |
711 | ||
712 | static struct map_info * | |
713 | build_map_info(struct address_space *mapping, loff_t offset, bool is_register) | |
714 | { | |
715 | unsigned long pgoff = offset >> PAGE_SHIFT; | |
2b144498 | 716 | struct vm_area_struct *vma; |
26872090 ON |
717 | struct map_info *curr = NULL; |
718 | struct map_info *prev = NULL; | |
719 | struct map_info *info; | |
720 | int more = 0; | |
2b144498 | 721 | |
26872090 | 722 | again: |
4a23717a | 723 | i_mmap_lock_read(mapping); |
6b2dbba8 | 724 | vma_interval_tree_foreach(vma, &mapping->i_mmap, pgoff, pgoff) { |
2b144498 SD |
725 | if (!valid_vma(vma, is_register)) |
726 | continue; | |
727 | ||
7a5bfb66 ON |
728 | if (!prev && !more) { |
729 | /* | |
c8c06efa | 730 | * Needs GFP_NOWAIT to avoid i_mmap_rwsem recursion through |
7a5bfb66 ON |
731 | * reclaim. This is optimistic, no harm done if it fails. |
732 | */ | |
733 | prev = kmalloc(sizeof(struct map_info), | |
734 | GFP_NOWAIT | __GFP_NOMEMALLOC | __GFP_NOWARN); | |
735 | if (prev) | |
736 | prev->next = NULL; | |
737 | } | |
26872090 ON |
738 | if (!prev) { |
739 | more++; | |
740 | continue; | |
2b144498 | 741 | } |
2b144498 | 742 | |
26872090 ON |
743 | if (!atomic_inc_not_zero(&vma->vm_mm->mm_users)) |
744 | continue; | |
7b2d81d4 | 745 | |
26872090 ON |
746 | info = prev; |
747 | prev = prev->next; | |
748 | info->next = curr; | |
749 | curr = info; | |
2b144498 | 750 | |
26872090 | 751 | info->mm = vma->vm_mm; |
57683f72 | 752 | info->vaddr = offset_to_vaddr(vma, offset); |
26872090 | 753 | } |
4a23717a | 754 | i_mmap_unlock_read(mapping); |
2b144498 | 755 | |
26872090 ON |
756 | if (!more) |
757 | goto out; | |
758 | ||
759 | prev = curr; | |
760 | while (curr) { | |
761 | mmput(curr->mm); | |
762 | curr = curr->next; | |
763 | } | |
7b2d81d4 | 764 | |
26872090 ON |
765 | do { |
766 | info = kmalloc(sizeof(struct map_info), GFP_KERNEL); | |
767 | if (!info) { | |
768 | curr = ERR_PTR(-ENOMEM); | |
769 | goto out; | |
770 | } | |
771 | info->next = prev; | |
772 | prev = info; | |
773 | } while (--more); | |
774 | ||
775 | goto again; | |
776 | out: | |
777 | while (prev) | |
778 | prev = free_map_info(prev); | |
779 | return curr; | |
2b144498 SD |
780 | } |
781 | ||
bdf8647c ON |
782 | static int |
783 | register_for_each_vma(struct uprobe *uprobe, struct uprobe_consumer *new) | |
2b144498 | 784 | { |
bdf8647c | 785 | bool is_register = !!new; |
26872090 ON |
786 | struct map_info *info; |
787 | int err = 0; | |
2b144498 | 788 | |
32cdba1e | 789 | percpu_down_write(&dup_mmap_sem); |
26872090 ON |
790 | info = build_map_info(uprobe->inode->i_mapping, |
791 | uprobe->offset, is_register); | |
32cdba1e ON |
792 | if (IS_ERR(info)) { |
793 | err = PTR_ERR(info); | |
794 | goto out; | |
795 | } | |
7b2d81d4 | 796 | |
26872090 ON |
797 | while (info) { |
798 | struct mm_struct *mm = info->mm; | |
799 | struct vm_area_struct *vma; | |
7b2d81d4 | 800 | |
076a365b | 801 | if (err && is_register) |
26872090 | 802 | goto free; |
7b2d81d4 | 803 | |
77fc4af1 | 804 | down_write(&mm->mmap_sem); |
f4d6dfe5 ON |
805 | vma = find_vma(mm, info->vaddr); |
806 | if (!vma || !valid_vma(vma, is_register) || | |
f281769e | 807 | file_inode(vma->vm_file) != uprobe->inode) |
26872090 ON |
808 | goto unlock; |
809 | ||
f4d6dfe5 ON |
810 | if (vma->vm_start > info->vaddr || |
811 | vaddr_to_offset(vma, info->vaddr) != uprobe->offset) | |
26872090 | 812 | goto unlock; |
2b144498 | 813 | |
806a98bd ON |
814 | if (is_register) { |
815 | /* consult only the "caller", new consumer. */ | |
bdf8647c | 816 | if (consumer_filter(new, |
8a7f2fa0 | 817 | UPROBE_FILTER_REGISTER, mm)) |
806a98bd ON |
818 | err = install_breakpoint(uprobe, mm, vma, info->vaddr); |
819 | } else if (test_bit(MMF_HAS_UPROBES, &mm->flags)) { | |
8a7f2fa0 ON |
820 | if (!filter_chain(uprobe, |
821 | UPROBE_FILTER_UNREGISTER, mm)) | |
806a98bd ON |
822 | err |= remove_breakpoint(uprobe, mm, info->vaddr); |
823 | } | |
78f74116 | 824 | |
26872090 ON |
825 | unlock: |
826 | up_write(&mm->mmap_sem); | |
827 | free: | |
828 | mmput(mm); | |
829 | info = free_map_info(info); | |
2b144498 | 830 | } |
32cdba1e ON |
831 | out: |
832 | percpu_up_write(&dup_mmap_sem); | |
26872090 | 833 | return err; |
2b144498 SD |
834 | } |
835 | ||
9a98e03c | 836 | static int __uprobe_register(struct uprobe *uprobe, struct uprobe_consumer *uc) |
2b144498 | 837 | { |
9a98e03c | 838 | consumer_add(uprobe, uc); |
bdf8647c | 839 | return register_for_each_vma(uprobe, uc); |
2b144498 SD |
840 | } |
841 | ||
04aab9b2 | 842 | static void __uprobe_unregister(struct uprobe *uprobe, struct uprobe_consumer *uc) |
2b144498 | 843 | { |
04aab9b2 ON |
844 | int err; |
845 | ||
06d07139 | 846 | if (WARN_ON(!consumer_del(uprobe, uc))) |
04aab9b2 | 847 | return; |
2b144498 | 848 | |
bdf8647c | 849 | err = register_for_each_vma(uprobe, NULL); |
bb929284 ON |
850 | /* TODO : cant unregister? schedule a worker thread */ |
851 | if (!uprobe->consumers && !err) | |
852 | delete_uprobe(uprobe); | |
2b144498 SD |
853 | } |
854 | ||
855 | /* | |
7b2d81d4 | 856 | * uprobe_register - register a probe |
2b144498 SD |
857 | * @inode: the file in which the probe has to be placed. |
858 | * @offset: offset from the start of the file. | |
e3343e6a | 859 | * @uc: information on howto handle the probe.. |
2b144498 | 860 | * |
7b2d81d4 | 861 | * Apart from the access refcount, uprobe_register() takes a creation |
2b144498 SD |
862 | * refcount (thro alloc_uprobe) if and only if this @uprobe is getting |
863 | * inserted into the rbtree (i.e first consumer for a @inode:@offset | |
7b2d81d4 | 864 | * tuple). Creation refcount stops uprobe_unregister from freeing the |
2b144498 | 865 | * @uprobe even before the register operation is complete. Creation |
e3343e6a | 866 | * refcount is released when the last @uc for the @uprobe |
2b144498 SD |
867 | * unregisters. |
868 | * | |
869 | * Return errno if it cannot successully install probes | |
870 | * else return 0 (success) | |
871 | */ | |
e3343e6a | 872 | int uprobe_register(struct inode *inode, loff_t offset, struct uprobe_consumer *uc) |
2b144498 SD |
873 | { |
874 | struct uprobe *uprobe; | |
7b2d81d4 | 875 | int ret; |
2b144498 | 876 | |
ea024870 AA |
877 | /* Uprobe must have at least one set consumer */ |
878 | if (!uc->handler && !uc->ret_handler) | |
879 | return -EINVAL; | |
880 | ||
40814f68 ON |
881 | /* copy_insn() uses read_mapping_page() or shmem_read_mapping_page() */ |
882 | if (!inode->i_mapping->a_ops->readpage && !shmem_mapping(inode->i_mapping)) | |
41ccba02 | 883 | return -EIO; |
f0744af7 | 884 | /* Racy, just to catch the obvious mistakes */ |
2b144498 | 885 | if (offset > i_size_read(inode)) |
7b2d81d4 | 886 | return -EINVAL; |
2b144498 | 887 | |
66d06dff | 888 | retry: |
2b144498 | 889 | uprobe = alloc_uprobe(inode, offset); |
66d06dff ON |
890 | if (!uprobe) |
891 | return -ENOMEM; | |
892 | /* | |
893 | * We can race with uprobe_unregister()->delete_uprobe(). | |
894 | * Check uprobe_is_active() and retry if it is false. | |
895 | */ | |
896 | down_write(&uprobe->register_rwsem); | |
897 | ret = -EAGAIN; | |
898 | if (likely(uprobe_is_active(uprobe))) { | |
9a98e03c ON |
899 | ret = __uprobe_register(uprobe, uc); |
900 | if (ret) | |
04aab9b2 | 901 | __uprobe_unregister(uprobe, uc); |
2b144498 | 902 | } |
66d06dff ON |
903 | up_write(&uprobe->register_rwsem); |
904 | put_uprobe(uprobe); | |
2b144498 | 905 | |
66d06dff ON |
906 | if (unlikely(ret == -EAGAIN)) |
907 | goto retry; | |
2b144498 SD |
908 | return ret; |
909 | } | |
e8440c14 | 910 | EXPORT_SYMBOL_GPL(uprobe_register); |
2b144498 | 911 | |
bdf8647c ON |
912 | /* |
913 | * uprobe_apply - unregister a already registered probe. | |
914 | * @inode: the file in which the probe has to be removed. | |
915 | * @offset: offset from the start of the file. | |
916 | * @uc: consumer which wants to add more or remove some breakpoints | |
917 | * @add: add or remove the breakpoints | |
918 | */ | |
919 | int uprobe_apply(struct inode *inode, loff_t offset, | |
920 | struct uprobe_consumer *uc, bool add) | |
921 | { | |
922 | struct uprobe *uprobe; | |
923 | struct uprobe_consumer *con; | |
924 | int ret = -ENOENT; | |
925 | ||
926 | uprobe = find_uprobe(inode, offset); | |
06d07139 | 927 | if (WARN_ON(!uprobe)) |
bdf8647c ON |
928 | return ret; |
929 | ||
930 | down_write(&uprobe->register_rwsem); | |
931 | for (con = uprobe->consumers; con && con != uc ; con = con->next) | |
932 | ; | |
933 | if (con) | |
934 | ret = register_for_each_vma(uprobe, add ? uc : NULL); | |
935 | up_write(&uprobe->register_rwsem); | |
936 | put_uprobe(uprobe); | |
937 | ||
938 | return ret; | |
939 | } | |
940 | ||
2b144498 | 941 | /* |
7b2d81d4 | 942 | * uprobe_unregister - unregister a already registered probe. |
2b144498 SD |
943 | * @inode: the file in which the probe has to be removed. |
944 | * @offset: offset from the start of the file. | |
e3343e6a | 945 | * @uc: identify which probe if multiple probes are colocated. |
2b144498 | 946 | */ |
e3343e6a | 947 | void uprobe_unregister(struct inode *inode, loff_t offset, struct uprobe_consumer *uc) |
2b144498 | 948 | { |
7b2d81d4 | 949 | struct uprobe *uprobe; |
2b144498 | 950 | |
2b144498 | 951 | uprobe = find_uprobe(inode, offset); |
06d07139 | 952 | if (WARN_ON(!uprobe)) |
2b144498 SD |
953 | return; |
954 | ||
e591c8d7 | 955 | down_write(&uprobe->register_rwsem); |
04aab9b2 | 956 | __uprobe_unregister(uprobe, uc); |
e591c8d7 | 957 | up_write(&uprobe->register_rwsem); |
c91368c4 | 958 | put_uprobe(uprobe); |
2b144498 | 959 | } |
e8440c14 | 960 | EXPORT_SYMBOL_GPL(uprobe_unregister); |
2b144498 | 961 | |
da1816b1 ON |
962 | static int unapply_uprobe(struct uprobe *uprobe, struct mm_struct *mm) |
963 | { | |
964 | struct vm_area_struct *vma; | |
965 | int err = 0; | |
966 | ||
967 | down_read(&mm->mmap_sem); | |
968 | for (vma = mm->mmap; vma; vma = vma->vm_next) { | |
969 | unsigned long vaddr; | |
970 | loff_t offset; | |
971 | ||
972 | if (!valid_vma(vma, false) || | |
f281769e | 973 | file_inode(vma->vm_file) != uprobe->inode) |
da1816b1 ON |
974 | continue; |
975 | ||
976 | offset = (loff_t)vma->vm_pgoff << PAGE_SHIFT; | |
977 | if (uprobe->offset < offset || | |
978 | uprobe->offset >= offset + vma->vm_end - vma->vm_start) | |
979 | continue; | |
980 | ||
981 | vaddr = offset_to_vaddr(vma, uprobe->offset); | |
982 | err |= remove_breakpoint(uprobe, mm, vaddr); | |
983 | } | |
984 | up_read(&mm->mmap_sem); | |
985 | ||
986 | return err; | |
987 | } | |
988 | ||
891c3970 ON |
989 | static struct rb_node * |
990 | find_node_in_range(struct inode *inode, loff_t min, loff_t max) | |
2b144498 | 991 | { |
2b144498 | 992 | struct rb_node *n = uprobes_tree.rb_node; |
2b144498 SD |
993 | |
994 | while (n) { | |
891c3970 | 995 | struct uprobe *u = rb_entry(n, struct uprobe, rb_node); |
2b144498 | 996 | |
891c3970 | 997 | if (inode < u->inode) { |
2b144498 | 998 | n = n->rb_left; |
891c3970 | 999 | } else if (inode > u->inode) { |
2b144498 | 1000 | n = n->rb_right; |
891c3970 ON |
1001 | } else { |
1002 | if (max < u->offset) | |
1003 | n = n->rb_left; | |
1004 | else if (min > u->offset) | |
1005 | n = n->rb_right; | |
1006 | else | |
1007 | break; | |
1008 | } | |
2b144498 | 1009 | } |
7b2d81d4 | 1010 | |
891c3970 | 1011 | return n; |
2b144498 SD |
1012 | } |
1013 | ||
1014 | /* | |
891c3970 | 1015 | * For a given range in vma, build a list of probes that need to be inserted. |
2b144498 | 1016 | */ |
891c3970 ON |
1017 | static void build_probe_list(struct inode *inode, |
1018 | struct vm_area_struct *vma, | |
1019 | unsigned long start, unsigned long end, | |
1020 | struct list_head *head) | |
2b144498 | 1021 | { |
891c3970 | 1022 | loff_t min, max; |
891c3970 ON |
1023 | struct rb_node *n, *t; |
1024 | struct uprobe *u; | |
7b2d81d4 | 1025 | |
891c3970 | 1026 | INIT_LIST_HEAD(head); |
cb113b47 | 1027 | min = vaddr_to_offset(vma, start); |
891c3970 | 1028 | max = min + (end - start) - 1; |
2b144498 | 1029 | |
6f47caa0 | 1030 | spin_lock(&uprobes_treelock); |
891c3970 ON |
1031 | n = find_node_in_range(inode, min, max); |
1032 | if (n) { | |
1033 | for (t = n; t; t = rb_prev(t)) { | |
1034 | u = rb_entry(t, struct uprobe, rb_node); | |
1035 | if (u->inode != inode || u->offset < min) | |
1036 | break; | |
1037 | list_add(&u->pending_list, head); | |
f231722a | 1038 | get_uprobe(u); |
891c3970 ON |
1039 | } |
1040 | for (t = n; (t = rb_next(t)); ) { | |
1041 | u = rb_entry(t, struct uprobe, rb_node); | |
1042 | if (u->inode != inode || u->offset > max) | |
1043 | break; | |
1044 | list_add(&u->pending_list, head); | |
f231722a | 1045 | get_uprobe(u); |
891c3970 | 1046 | } |
2b144498 | 1047 | } |
6f47caa0 | 1048 | spin_unlock(&uprobes_treelock); |
2b144498 SD |
1049 | } |
1050 | ||
1051 | /* | |
5e5be71a | 1052 | * Called from mmap_region/vma_adjust with mm->mmap_sem acquired. |
2b144498 | 1053 | * |
5e5be71a ON |
1054 | * Currently we ignore all errors and always return 0, the callers |
1055 | * can't handle the failure anyway. | |
2b144498 | 1056 | */ |
7b2d81d4 | 1057 | int uprobe_mmap(struct vm_area_struct *vma) |
2b144498 SD |
1058 | { |
1059 | struct list_head tmp_list; | |
665605a2 | 1060 | struct uprobe *uprobe, *u; |
2b144498 | 1061 | struct inode *inode; |
2b144498 | 1062 | |
441f1eb7 | 1063 | if (no_uprobe_events() || !valid_vma(vma, true)) |
7b2d81d4 | 1064 | return 0; |
2b144498 | 1065 | |
f281769e | 1066 | inode = file_inode(vma->vm_file); |
2b144498 | 1067 | if (!inode) |
7b2d81d4 | 1068 | return 0; |
2b144498 | 1069 | |
2b144498 | 1070 | mutex_lock(uprobes_mmap_hash(inode)); |
891c3970 | 1071 | build_probe_list(inode, vma, vma->vm_start, vma->vm_end, &tmp_list); |
806a98bd ON |
1072 | /* |
1073 | * We can race with uprobe_unregister(), this uprobe can be already | |
1074 | * removed. But in this case filter_chain() must return false, all | |
1075 | * consumers have gone away. | |
1076 | */ | |
665605a2 | 1077 | list_for_each_entry_safe(uprobe, u, &tmp_list, pending_list) { |
806a98bd | 1078 | if (!fatal_signal_pending(current) && |
8a7f2fa0 | 1079 | filter_chain(uprobe, UPROBE_FILTER_MMAP, vma->vm_mm)) { |
57683f72 | 1080 | unsigned long vaddr = offset_to_vaddr(vma, uprobe->offset); |
5e5be71a | 1081 | install_breakpoint(uprobe, vma->vm_mm, vma, vaddr); |
2b144498 SD |
1082 | } |
1083 | put_uprobe(uprobe); | |
1084 | } | |
2b144498 SD |
1085 | mutex_unlock(uprobes_mmap_hash(inode)); |
1086 | ||
5e5be71a | 1087 | return 0; |
2b144498 SD |
1088 | } |
1089 | ||
9f68f672 ON |
1090 | static bool |
1091 | vma_has_uprobes(struct vm_area_struct *vma, unsigned long start, unsigned long end) | |
1092 | { | |
1093 | loff_t min, max; | |
1094 | struct inode *inode; | |
1095 | struct rb_node *n; | |
1096 | ||
f281769e | 1097 | inode = file_inode(vma->vm_file); |
9f68f672 ON |
1098 | |
1099 | min = vaddr_to_offset(vma, start); | |
1100 | max = min + (end - start) - 1; | |
1101 | ||
1102 | spin_lock(&uprobes_treelock); | |
1103 | n = find_node_in_range(inode, min, max); | |
1104 | spin_unlock(&uprobes_treelock); | |
1105 | ||
1106 | return !!n; | |
1107 | } | |
1108 | ||
682968e0 SD |
1109 | /* |
1110 | * Called in context of a munmap of a vma. | |
1111 | */ | |
cbc91f71 | 1112 | void uprobe_munmap(struct vm_area_struct *vma, unsigned long start, unsigned long end) |
682968e0 | 1113 | { |
441f1eb7 | 1114 | if (no_uprobe_events() || !valid_vma(vma, false)) |
682968e0 SD |
1115 | return; |
1116 | ||
2fd611a9 ON |
1117 | if (!atomic_read(&vma->vm_mm->mm_users)) /* called by mmput() ? */ |
1118 | return; | |
1119 | ||
9f68f672 ON |
1120 | if (!test_bit(MMF_HAS_UPROBES, &vma->vm_mm->flags) || |
1121 | test_bit(MMF_RECALC_UPROBES, &vma->vm_mm->flags)) | |
f8ac4ec9 ON |
1122 | return; |
1123 | ||
9f68f672 ON |
1124 | if (vma_has_uprobes(vma, start, end)) |
1125 | set_bit(MMF_RECALC_UPROBES, &vma->vm_mm->flags); | |
682968e0 SD |
1126 | } |
1127 | ||
d4b3b638 | 1128 | /* Slot allocation for XOL */ |
6441ec8b | 1129 | static int xol_add_vma(struct mm_struct *mm, struct xol_area *area) |
d4b3b638 | 1130 | { |
704bde3c ON |
1131 | struct vm_area_struct *vma; |
1132 | int ret; | |
d4b3b638 | 1133 | |
598fdc1d MH |
1134 | if (down_write_killable(&mm->mmap_sem)) |
1135 | return -EINTR; | |
1136 | ||
704bde3c ON |
1137 | if (mm->uprobes_state.xol_area) { |
1138 | ret = -EALREADY; | |
d4b3b638 | 1139 | goto fail; |
704bde3c | 1140 | } |
d4b3b638 | 1141 | |
af0d95af ON |
1142 | if (!area->vaddr) { |
1143 | /* Try to map as high as possible, this is only a hint. */ | |
1144 | area->vaddr = get_unmapped_area(NULL, TASK_SIZE - PAGE_SIZE, | |
1145 | PAGE_SIZE, 0, 0); | |
1146 | if (area->vaddr & ~PAGE_MASK) { | |
1147 | ret = area->vaddr; | |
1148 | goto fail; | |
1149 | } | |
d4b3b638 SD |
1150 | } |
1151 | ||
704bde3c ON |
1152 | vma = _install_special_mapping(mm, area->vaddr, PAGE_SIZE, |
1153 | VM_EXEC|VM_MAYEXEC|VM_DONTCOPY|VM_IO, | |
1154 | &area->xol_mapping); | |
1155 | if (IS_ERR(vma)) { | |
1156 | ret = PTR_ERR(vma); | |
d4b3b638 | 1157 | goto fail; |
704bde3c | 1158 | } |
d4b3b638 | 1159 | |
704bde3c | 1160 | ret = 0; |
d4b3b638 SD |
1161 | smp_wmb(); /* pairs with get_xol_area() */ |
1162 | mm->uprobes_state.xol_area = area; | |
c8a82538 | 1163 | fail: |
d4b3b638 | 1164 | up_write(&mm->mmap_sem); |
d4b3b638 SD |
1165 | |
1166 | return ret; | |
1167 | } | |
1168 | ||
af0d95af | 1169 | static struct xol_area *__create_xol_area(unsigned long vaddr) |
d4b3b638 | 1170 | { |
9b545df8 | 1171 | struct mm_struct *mm = current->mm; |
e78aebfd | 1172 | uprobe_opcode_t insn = UPROBE_SWBP_INSN; |
6441ec8b | 1173 | struct xol_area *area; |
9b545df8 | 1174 | |
af0d95af | 1175 | area = kmalloc(sizeof(*area), GFP_KERNEL); |
d4b3b638 | 1176 | if (unlikely(!area)) |
c8a82538 | 1177 | goto out; |
d4b3b638 SD |
1178 | |
1179 | area->bitmap = kzalloc(BITS_TO_LONGS(UINSNS_PER_PAGE) * sizeof(long), GFP_KERNEL); | |
d4b3b638 | 1180 | if (!area->bitmap) |
c8a82538 ON |
1181 | goto free_area; |
1182 | ||
704bde3c | 1183 | area->xol_mapping.name = "[uprobes]"; |
869ae761 | 1184 | area->xol_mapping.fault = NULL; |
704bde3c | 1185 | area->xol_mapping.pages = area->pages; |
f58bea2f ON |
1186 | area->pages[0] = alloc_page(GFP_HIGHUSER); |
1187 | if (!area->pages[0]) | |
c8a82538 | 1188 | goto free_bitmap; |
f58bea2f | 1189 | area->pages[1] = NULL; |
d4b3b638 | 1190 | |
af0d95af | 1191 | area->vaddr = vaddr; |
6441ec8b ON |
1192 | init_waitqueue_head(&area->wq); |
1193 | /* Reserve the 1st slot for get_trampoline_vaddr() */ | |
e78aebfd | 1194 | set_bit(0, area->bitmap); |
e78aebfd | 1195 | atomic_set(&area->slot_count, 1); |
f58bea2f | 1196 | copy_to_page(area->pages[0], 0, &insn, UPROBE_SWBP_INSN_SIZE); |
e78aebfd | 1197 | |
6441ec8b | 1198 | if (!xol_add_vma(mm, area)) |
d4b3b638 SD |
1199 | return area; |
1200 | ||
f58bea2f | 1201 | __free_page(area->pages[0]); |
c8a82538 | 1202 | free_bitmap: |
d4b3b638 | 1203 | kfree(area->bitmap); |
c8a82538 | 1204 | free_area: |
d4b3b638 | 1205 | kfree(area); |
c8a82538 | 1206 | out: |
6441ec8b ON |
1207 | return NULL; |
1208 | } | |
1209 | ||
1210 | /* | |
1211 | * get_xol_area - Allocate process's xol_area if necessary. | |
1212 | * This area will be used for storing instructions for execution out of line. | |
1213 | * | |
1214 | * Returns the allocated area or NULL. | |
1215 | */ | |
1216 | static struct xol_area *get_xol_area(void) | |
1217 | { | |
1218 | struct mm_struct *mm = current->mm; | |
1219 | struct xol_area *area; | |
1220 | ||
1221 | if (!mm->uprobes_state.xol_area) | |
af0d95af | 1222 | __create_xol_area(0); |
6441ec8b | 1223 | |
9b545df8 | 1224 | area = mm->uprobes_state.xol_area; |
6441ec8b | 1225 | smp_read_barrier_depends(); /* pairs with wmb in xol_add_vma() */ |
9b545df8 | 1226 | return area; |
d4b3b638 SD |
1227 | } |
1228 | ||
1229 | /* | |
1230 | * uprobe_clear_state - Free the area allocated for slots. | |
1231 | */ | |
1232 | void uprobe_clear_state(struct mm_struct *mm) | |
1233 | { | |
1234 | struct xol_area *area = mm->uprobes_state.xol_area; | |
1235 | ||
1236 | if (!area) | |
1237 | return; | |
1238 | ||
f58bea2f | 1239 | put_page(area->pages[0]); |
d4b3b638 SD |
1240 | kfree(area->bitmap); |
1241 | kfree(area); | |
1242 | } | |
1243 | ||
32cdba1e ON |
1244 | void uprobe_start_dup_mmap(void) |
1245 | { | |
1246 | percpu_down_read(&dup_mmap_sem); | |
1247 | } | |
1248 | ||
1249 | void uprobe_end_dup_mmap(void) | |
1250 | { | |
1251 | percpu_up_read(&dup_mmap_sem); | |
1252 | } | |
1253 | ||
f8ac4ec9 ON |
1254 | void uprobe_dup_mmap(struct mm_struct *oldmm, struct mm_struct *newmm) |
1255 | { | |
61559a81 ON |
1256 | newmm->uprobes_state.xol_area = NULL; |
1257 | ||
9f68f672 | 1258 | if (test_bit(MMF_HAS_UPROBES, &oldmm->flags)) { |
f8ac4ec9 | 1259 | set_bit(MMF_HAS_UPROBES, &newmm->flags); |
9f68f672 ON |
1260 | /* unconditionally, dup_mmap() skips VM_DONTCOPY vmas */ |
1261 | set_bit(MMF_RECALC_UPROBES, &newmm->flags); | |
1262 | } | |
f8ac4ec9 ON |
1263 | } |
1264 | ||
d4b3b638 SD |
1265 | /* |
1266 | * - search for a free slot. | |
1267 | */ | |
1268 | static unsigned long xol_take_insn_slot(struct xol_area *area) | |
1269 | { | |
1270 | unsigned long slot_addr; | |
1271 | int slot_nr; | |
1272 | ||
1273 | do { | |
1274 | slot_nr = find_first_zero_bit(area->bitmap, UINSNS_PER_PAGE); | |
1275 | if (slot_nr < UINSNS_PER_PAGE) { | |
1276 | if (!test_and_set_bit(slot_nr, area->bitmap)) | |
1277 | break; | |
1278 | ||
1279 | slot_nr = UINSNS_PER_PAGE; | |
1280 | continue; | |
1281 | } | |
1282 | wait_event(area->wq, (atomic_read(&area->slot_count) < UINSNS_PER_PAGE)); | |
1283 | } while (slot_nr >= UINSNS_PER_PAGE); | |
1284 | ||
1285 | slot_addr = area->vaddr + (slot_nr * UPROBE_XOL_SLOT_BYTES); | |
1286 | atomic_inc(&area->slot_count); | |
1287 | ||
1288 | return slot_addr; | |
1289 | } | |
1290 | ||
1291 | /* | |
a6cb3f6d | 1292 | * xol_get_insn_slot - allocate a slot for xol. |
d4b3b638 SD |
1293 | * Returns the allocated slot address or 0. |
1294 | */ | |
a6cb3f6d | 1295 | static unsigned long xol_get_insn_slot(struct uprobe *uprobe) |
d4b3b638 SD |
1296 | { |
1297 | struct xol_area *area; | |
a6cb3f6d | 1298 | unsigned long xol_vaddr; |
d4b3b638 | 1299 | |
9b545df8 ON |
1300 | area = get_xol_area(); |
1301 | if (!area) | |
1302 | return 0; | |
d4b3b638 | 1303 | |
a6cb3f6d ON |
1304 | xol_vaddr = xol_take_insn_slot(area); |
1305 | if (unlikely(!xol_vaddr)) | |
d4b3b638 SD |
1306 | return 0; |
1307 | ||
f58bea2f | 1308 | arch_uprobe_copy_ixol(area->pages[0], xol_vaddr, |
72e6ae28 | 1309 | &uprobe->arch.ixol, sizeof(uprobe->arch.ixol)); |
d4b3b638 | 1310 | |
a6cb3f6d | 1311 | return xol_vaddr; |
d4b3b638 SD |
1312 | } |
1313 | ||
1314 | /* | |
1315 | * xol_free_insn_slot - If slot was earlier allocated by | |
1316 | * @xol_get_insn_slot(), make the slot available for | |
1317 | * subsequent requests. | |
1318 | */ | |
1319 | static void xol_free_insn_slot(struct task_struct *tsk) | |
1320 | { | |
1321 | struct xol_area *area; | |
1322 | unsigned long vma_end; | |
1323 | unsigned long slot_addr; | |
1324 | ||
1325 | if (!tsk->mm || !tsk->mm->uprobes_state.xol_area || !tsk->utask) | |
1326 | return; | |
1327 | ||
1328 | slot_addr = tsk->utask->xol_vaddr; | |
af4355e9 | 1329 | if (unlikely(!slot_addr)) |
d4b3b638 SD |
1330 | return; |
1331 | ||
1332 | area = tsk->mm->uprobes_state.xol_area; | |
1333 | vma_end = area->vaddr + PAGE_SIZE; | |
1334 | if (area->vaddr <= slot_addr && slot_addr < vma_end) { | |
1335 | unsigned long offset; | |
1336 | int slot_nr; | |
1337 | ||
1338 | offset = slot_addr - area->vaddr; | |
1339 | slot_nr = offset / UPROBE_XOL_SLOT_BYTES; | |
1340 | if (slot_nr >= UINSNS_PER_PAGE) | |
1341 | return; | |
1342 | ||
1343 | clear_bit(slot_nr, area->bitmap); | |
1344 | atomic_dec(&area->slot_count); | |
2a742ced | 1345 | smp_mb__after_atomic(); /* pairs with prepare_to_wait() */ |
d4b3b638 SD |
1346 | if (waitqueue_active(&area->wq)) |
1347 | wake_up(&area->wq); | |
1348 | ||
1349 | tsk->utask->xol_vaddr = 0; | |
1350 | } | |
1351 | } | |
1352 | ||
72e6ae28 VK |
1353 | void __weak arch_uprobe_copy_ixol(struct page *page, unsigned long vaddr, |
1354 | void *src, unsigned long len) | |
1355 | { | |
1356 | /* Initialize the slot */ | |
1357 | copy_to_page(page, vaddr, src, len); | |
1358 | ||
1359 | /* | |
1360 | * We probably need flush_icache_user_range() but it needs vma. | |
1361 | * This should work on most of architectures by default. If | |
1362 | * architecture needs to do something different it can define | |
1363 | * its own version of the function. | |
1364 | */ | |
1365 | flush_dcache_page(page); | |
1366 | } | |
1367 | ||
0326f5a9 SD |
1368 | /** |
1369 | * uprobe_get_swbp_addr - compute address of swbp given post-swbp regs | |
1370 | * @regs: Reflects the saved state of the task after it has hit a breakpoint | |
1371 | * instruction. | |
1372 | * Return the address of the breakpoint instruction. | |
1373 | */ | |
1374 | unsigned long __weak uprobe_get_swbp_addr(struct pt_regs *regs) | |
1375 | { | |
1376 | return instruction_pointer(regs) - UPROBE_SWBP_INSN_SIZE; | |
1377 | } | |
1378 | ||
b02ef20a ON |
1379 | unsigned long uprobe_get_trap_addr(struct pt_regs *regs) |
1380 | { | |
1381 | struct uprobe_task *utask = current->utask; | |
1382 | ||
1383 | if (unlikely(utask && utask->active_uprobe)) | |
1384 | return utask->vaddr; | |
1385 | ||
1386 | return instruction_pointer(regs); | |
1387 | } | |
1388 | ||
2bb5e840 ON |
1389 | static struct return_instance *free_ret_instance(struct return_instance *ri) |
1390 | { | |
1391 | struct return_instance *next = ri->next; | |
1392 | put_uprobe(ri->uprobe); | |
1393 | kfree(ri); | |
1394 | return next; | |
1395 | } | |
1396 | ||
0326f5a9 SD |
1397 | /* |
1398 | * Called with no locks held. | |
1399 | * Called in context of a exiting or a exec-ing thread. | |
1400 | */ | |
1401 | void uprobe_free_utask(struct task_struct *t) | |
1402 | { | |
1403 | struct uprobe_task *utask = t->utask; | |
2bb5e840 | 1404 | struct return_instance *ri; |
0326f5a9 | 1405 | |
0326f5a9 SD |
1406 | if (!utask) |
1407 | return; | |
1408 | ||
1409 | if (utask->active_uprobe) | |
1410 | put_uprobe(utask->active_uprobe); | |
1411 | ||
0dfd0eb8 | 1412 | ri = utask->return_instances; |
2bb5e840 ON |
1413 | while (ri) |
1414 | ri = free_ret_instance(ri); | |
0dfd0eb8 | 1415 | |
d4b3b638 | 1416 | xol_free_insn_slot(t); |
0326f5a9 SD |
1417 | kfree(utask); |
1418 | t->utask = NULL; | |
1419 | } | |
1420 | ||
0326f5a9 | 1421 | /* |
5a2df662 ON |
1422 | * Allocate a uprobe_task object for the task if if necessary. |
1423 | * Called when the thread hits a breakpoint. | |
0326f5a9 SD |
1424 | * |
1425 | * Returns: | |
1426 | * - pointer to new uprobe_task on success | |
1427 | * - NULL otherwise | |
1428 | */ | |
5a2df662 | 1429 | static struct uprobe_task *get_utask(void) |
0326f5a9 | 1430 | { |
5a2df662 ON |
1431 | if (!current->utask) |
1432 | current->utask = kzalloc(sizeof(struct uprobe_task), GFP_KERNEL); | |
1433 | return current->utask; | |
0326f5a9 SD |
1434 | } |
1435 | ||
248d3a7b ON |
1436 | static int dup_utask(struct task_struct *t, struct uprobe_task *o_utask) |
1437 | { | |
1438 | struct uprobe_task *n_utask; | |
1439 | struct return_instance **p, *o, *n; | |
1440 | ||
1441 | n_utask = kzalloc(sizeof(struct uprobe_task), GFP_KERNEL); | |
1442 | if (!n_utask) | |
1443 | return -ENOMEM; | |
1444 | t->utask = n_utask; | |
1445 | ||
1446 | p = &n_utask->return_instances; | |
1447 | for (o = o_utask->return_instances; o; o = o->next) { | |
1448 | n = kmalloc(sizeof(struct return_instance), GFP_KERNEL); | |
1449 | if (!n) | |
1450 | return -ENOMEM; | |
1451 | ||
1452 | *n = *o; | |
f231722a | 1453 | get_uprobe(n->uprobe); |
248d3a7b ON |
1454 | n->next = NULL; |
1455 | ||
1456 | *p = n; | |
1457 | p = &n->next; | |
1458 | n_utask->depth++; | |
1459 | } | |
1460 | ||
1461 | return 0; | |
1462 | } | |
1463 | ||
1464 | static void uprobe_warn(struct task_struct *t, const char *msg) | |
1465 | { | |
1466 | pr_warn("uprobe: %s:%d failed to %s\n", | |
1467 | current->comm, current->pid, msg); | |
1468 | } | |
1469 | ||
aa59c53f ON |
1470 | static void dup_xol_work(struct callback_head *work) |
1471 | { | |
aa59c53f ON |
1472 | if (current->flags & PF_EXITING) |
1473 | return; | |
1474 | ||
598fdc1d MH |
1475 | if (!__create_xol_area(current->utask->dup_xol_addr) && |
1476 | !fatal_signal_pending(current)) | |
aa59c53f ON |
1477 | uprobe_warn(current, "dup xol area"); |
1478 | } | |
1479 | ||
b68e0749 ON |
1480 | /* |
1481 | * Called in context of a new clone/fork from copy_process. | |
1482 | */ | |
3ab67966 | 1483 | void uprobe_copy_process(struct task_struct *t, unsigned long flags) |
b68e0749 | 1484 | { |
248d3a7b ON |
1485 | struct uprobe_task *utask = current->utask; |
1486 | struct mm_struct *mm = current->mm; | |
aa59c53f | 1487 | struct xol_area *area; |
248d3a7b | 1488 | |
b68e0749 | 1489 | t->utask = NULL; |
248d3a7b | 1490 | |
3ab67966 ON |
1491 | if (!utask || !utask->return_instances) |
1492 | return; | |
1493 | ||
1494 | if (mm == t->mm && !(flags & CLONE_VFORK)) | |
248d3a7b ON |
1495 | return; |
1496 | ||
1497 | if (dup_utask(t, utask)) | |
1498 | return uprobe_warn(t, "dup ret instances"); | |
aa59c53f ON |
1499 | |
1500 | /* The task can fork() after dup_xol_work() fails */ | |
1501 | area = mm->uprobes_state.xol_area; | |
1502 | if (!area) | |
1503 | return uprobe_warn(t, "dup xol area"); | |
1504 | ||
3ab67966 ON |
1505 | if (mm == t->mm) |
1506 | return; | |
1507 | ||
32473431 ON |
1508 | t->utask->dup_xol_addr = area->vaddr; |
1509 | init_task_work(&t->utask->dup_xol_work, dup_xol_work); | |
1510 | task_work_add(t, &t->utask->dup_xol_work, true); | |
b68e0749 ON |
1511 | } |
1512 | ||
e78aebfd AA |
1513 | /* |
1514 | * Current area->vaddr notion assume the trampoline address is always | |
1515 | * equal area->vaddr. | |
1516 | * | |
1517 | * Returns -1 in case the xol_area is not allocated. | |
1518 | */ | |
1519 | static unsigned long get_trampoline_vaddr(void) | |
1520 | { | |
1521 | struct xol_area *area; | |
1522 | unsigned long trampoline_vaddr = -1; | |
1523 | ||
1524 | area = current->mm->uprobes_state.xol_area; | |
1525 | smp_read_barrier_depends(); | |
1526 | if (area) | |
1527 | trampoline_vaddr = area->vaddr; | |
1528 | ||
1529 | return trampoline_vaddr; | |
1530 | } | |
1531 | ||
db087ef6 ON |
1532 | static void cleanup_return_instances(struct uprobe_task *utask, bool chained, |
1533 | struct pt_regs *regs) | |
a5b7e1a8 ON |
1534 | { |
1535 | struct return_instance *ri = utask->return_instances; | |
db087ef6 | 1536 | enum rp_check ctx = chained ? RP_CHECK_CHAIN_CALL : RP_CHECK_CALL; |
86dcb702 ON |
1537 | |
1538 | while (ri && !arch_uretprobe_is_alive(ri, ctx, regs)) { | |
a5b7e1a8 ON |
1539 | ri = free_ret_instance(ri); |
1540 | utask->depth--; | |
1541 | } | |
1542 | utask->return_instances = ri; | |
1543 | } | |
1544 | ||
0dfd0eb8 AA |
1545 | static void prepare_uretprobe(struct uprobe *uprobe, struct pt_regs *regs) |
1546 | { | |
1547 | struct return_instance *ri; | |
1548 | struct uprobe_task *utask; | |
1549 | unsigned long orig_ret_vaddr, trampoline_vaddr; | |
db087ef6 | 1550 | bool chained; |
0dfd0eb8 AA |
1551 | |
1552 | if (!get_xol_area()) | |
1553 | return; | |
1554 | ||
1555 | utask = get_utask(); | |
1556 | if (!utask) | |
1557 | return; | |
1558 | ||
ded49c55 AA |
1559 | if (utask->depth >= MAX_URETPROBE_DEPTH) { |
1560 | printk_ratelimited(KERN_INFO "uprobe: omit uretprobe due to" | |
1561 | " nestedness limit pid/tgid=%d/%d\n", | |
1562 | current->pid, current->tgid); | |
1563 | return; | |
1564 | } | |
1565 | ||
6c58d0e4 | 1566 | ri = kmalloc(sizeof(struct return_instance), GFP_KERNEL); |
0dfd0eb8 | 1567 | if (!ri) |
6c58d0e4 | 1568 | return; |
0dfd0eb8 AA |
1569 | |
1570 | trampoline_vaddr = get_trampoline_vaddr(); | |
1571 | orig_ret_vaddr = arch_uretprobe_hijack_return_addr(trampoline_vaddr, regs); | |
1572 | if (orig_ret_vaddr == -1) | |
1573 | goto fail; | |
1574 | ||
a5b7e1a8 | 1575 | /* drop the entries invalidated by longjmp() */ |
db087ef6 ON |
1576 | chained = (orig_ret_vaddr == trampoline_vaddr); |
1577 | cleanup_return_instances(utask, chained, regs); | |
a5b7e1a8 | 1578 | |
0dfd0eb8 AA |
1579 | /* |
1580 | * We don't want to keep trampoline address in stack, rather keep the | |
1581 | * original return address of first caller thru all the consequent | |
1582 | * instances. This also makes breakpoint unwrapping easier. | |
1583 | */ | |
db087ef6 | 1584 | if (chained) { |
0dfd0eb8 AA |
1585 | if (!utask->return_instances) { |
1586 | /* | |
1587 | * This situation is not possible. Likely we have an | |
1588 | * attack from user-space. | |
1589 | */ | |
6c58d0e4 | 1590 | uprobe_warn(current, "handle tail call"); |
0dfd0eb8 AA |
1591 | goto fail; |
1592 | } | |
0dfd0eb8 AA |
1593 | orig_ret_vaddr = utask->return_instances->orig_ret_vaddr; |
1594 | } | |
1595 | ||
f231722a | 1596 | ri->uprobe = get_uprobe(uprobe); |
0dfd0eb8 | 1597 | ri->func = instruction_pointer(regs); |
7b868e48 | 1598 | ri->stack = user_stack_pointer(regs); |
0dfd0eb8 AA |
1599 | ri->orig_ret_vaddr = orig_ret_vaddr; |
1600 | ri->chained = chained; | |
1601 | ||
ded49c55 | 1602 | utask->depth++; |
0dfd0eb8 AA |
1603 | ri->next = utask->return_instances; |
1604 | utask->return_instances = ri; | |
1605 | ||
1606 | return; | |
0dfd0eb8 AA |
1607 | fail: |
1608 | kfree(ri); | |
1609 | } | |
1610 | ||
0326f5a9 SD |
1611 | /* Prepare to single-step probed instruction out of line. */ |
1612 | static int | |
a6cb3f6d | 1613 | pre_ssout(struct uprobe *uprobe, struct pt_regs *regs, unsigned long bp_vaddr) |
0326f5a9 | 1614 | { |
a6cb3f6d ON |
1615 | struct uprobe_task *utask; |
1616 | unsigned long xol_vaddr; | |
aba51024 | 1617 | int err; |
a6cb3f6d | 1618 | |
608e7427 ON |
1619 | utask = get_utask(); |
1620 | if (!utask) | |
1621 | return -ENOMEM; | |
a6cb3f6d ON |
1622 | |
1623 | xol_vaddr = xol_get_insn_slot(uprobe); | |
1624 | if (!xol_vaddr) | |
1625 | return -ENOMEM; | |
1626 | ||
1627 | utask->xol_vaddr = xol_vaddr; | |
1628 | utask->vaddr = bp_vaddr; | |
d4b3b638 | 1629 | |
aba51024 ON |
1630 | err = arch_uprobe_pre_xol(&uprobe->arch, regs); |
1631 | if (unlikely(err)) { | |
1632 | xol_free_insn_slot(current); | |
1633 | return err; | |
1634 | } | |
1635 | ||
608e7427 ON |
1636 | utask->active_uprobe = uprobe; |
1637 | utask->state = UTASK_SSTEP; | |
aba51024 | 1638 | return 0; |
0326f5a9 SD |
1639 | } |
1640 | ||
1641 | /* | |
1642 | * If we are singlestepping, then ensure this thread is not connected to | |
1643 | * non-fatal signals until completion of singlestep. When xol insn itself | |
1644 | * triggers the signal, restart the original insn even if the task is | |
1645 | * already SIGKILL'ed (since coredump should report the correct ip). This | |
1646 | * is even more important if the task has a handler for SIGSEGV/etc, The | |
1647 | * _same_ instruction should be repeated again after return from the signal | |
1648 | * handler, and SSTEP can never finish in this case. | |
1649 | */ | |
1650 | bool uprobe_deny_signal(void) | |
1651 | { | |
1652 | struct task_struct *t = current; | |
1653 | struct uprobe_task *utask = t->utask; | |
1654 | ||
1655 | if (likely(!utask || !utask->active_uprobe)) | |
1656 | return false; | |
1657 | ||
1658 | WARN_ON_ONCE(utask->state != UTASK_SSTEP); | |
1659 | ||
1660 | if (signal_pending(t)) { | |
1661 | spin_lock_irq(&t->sighand->siglock); | |
1662 | clear_tsk_thread_flag(t, TIF_SIGPENDING); | |
1663 | spin_unlock_irq(&t->sighand->siglock); | |
1664 | ||
1665 | if (__fatal_signal_pending(t) || arch_uprobe_xol_was_trapped(t)) { | |
1666 | utask->state = UTASK_SSTEP_TRAPPED; | |
1667 | set_tsk_thread_flag(t, TIF_UPROBE); | |
0326f5a9 SD |
1668 | } |
1669 | } | |
1670 | ||
1671 | return true; | |
1672 | } | |
1673 | ||
499a4f3e ON |
1674 | static void mmf_recalc_uprobes(struct mm_struct *mm) |
1675 | { | |
1676 | struct vm_area_struct *vma; | |
1677 | ||
1678 | for (vma = mm->mmap; vma; vma = vma->vm_next) { | |
1679 | if (!valid_vma(vma, false)) | |
1680 | continue; | |
1681 | /* | |
1682 | * This is not strictly accurate, we can race with | |
1683 | * uprobe_unregister() and see the already removed | |
1684 | * uprobe if delete_uprobe() was not yet called. | |
63633cbf | 1685 | * Or this uprobe can be filtered out. |
499a4f3e ON |
1686 | */ |
1687 | if (vma_has_uprobes(vma, vma->vm_start, vma->vm_end)) | |
1688 | return; | |
1689 | } | |
1690 | ||
1691 | clear_bit(MMF_HAS_UPROBES, &mm->flags); | |
1692 | } | |
1693 | ||
0908ad6e | 1694 | static int is_trap_at_addr(struct mm_struct *mm, unsigned long vaddr) |
ec75fba9 ON |
1695 | { |
1696 | struct page *page; | |
1697 | uprobe_opcode_t opcode; | |
1698 | int result; | |
1699 | ||
1700 | pagefault_disable(); | |
bd28b145 | 1701 | result = __get_user(opcode, (uprobe_opcode_t __user *)vaddr); |
ec75fba9 ON |
1702 | pagefault_enable(); |
1703 | ||
1704 | if (likely(result == 0)) | |
1705 | goto out; | |
1706 | ||
1e987790 DH |
1707 | /* |
1708 | * The NULL 'tsk' here ensures that any faults that occur here | |
1709 | * will not be accounted to the task. 'mm' *is* current->mm, | |
1710 | * but we treat this as a 'remote' access since it is | |
1711 | * essentially a kernel access to the memory. | |
1712 | */ | |
1713 | result = get_user_pages_remote(NULL, mm, vaddr, 1, 0, 1, &page, NULL); | |
ec75fba9 ON |
1714 | if (result < 0) |
1715 | return result; | |
1716 | ||
ab0d805c | 1717 | copy_from_page(page, vaddr, &opcode, UPROBE_SWBP_INSN_SIZE); |
ec75fba9 ON |
1718 | put_page(page); |
1719 | out: | |
0908ad6e AM |
1720 | /* This needs to return true for any variant of the trap insn */ |
1721 | return is_trap_insn(&opcode); | |
ec75fba9 ON |
1722 | } |
1723 | ||
d790d346 | 1724 | static struct uprobe *find_active_uprobe(unsigned long bp_vaddr, int *is_swbp) |
0326f5a9 | 1725 | { |
3a9ea052 ON |
1726 | struct mm_struct *mm = current->mm; |
1727 | struct uprobe *uprobe = NULL; | |
0326f5a9 | 1728 | struct vm_area_struct *vma; |
0326f5a9 | 1729 | |
0326f5a9 SD |
1730 | down_read(&mm->mmap_sem); |
1731 | vma = find_vma(mm, bp_vaddr); | |
3a9ea052 ON |
1732 | if (vma && vma->vm_start <= bp_vaddr) { |
1733 | if (valid_vma(vma, false)) { | |
f281769e | 1734 | struct inode *inode = file_inode(vma->vm_file); |
cb113b47 | 1735 | loff_t offset = vaddr_to_offset(vma, bp_vaddr); |
0326f5a9 | 1736 | |
3a9ea052 ON |
1737 | uprobe = find_uprobe(inode, offset); |
1738 | } | |
d790d346 ON |
1739 | |
1740 | if (!uprobe) | |
0908ad6e | 1741 | *is_swbp = is_trap_at_addr(mm, bp_vaddr); |
d790d346 ON |
1742 | } else { |
1743 | *is_swbp = -EFAULT; | |
0326f5a9 | 1744 | } |
499a4f3e ON |
1745 | |
1746 | if (!uprobe && test_and_clear_bit(MMF_RECALC_UPROBES, &mm->flags)) | |
1747 | mmf_recalc_uprobes(mm); | |
0326f5a9 SD |
1748 | up_read(&mm->mmap_sem); |
1749 | ||
3a9ea052 ON |
1750 | return uprobe; |
1751 | } | |
1752 | ||
da1816b1 ON |
1753 | static void handler_chain(struct uprobe *uprobe, struct pt_regs *regs) |
1754 | { | |
1755 | struct uprobe_consumer *uc; | |
1756 | int remove = UPROBE_HANDLER_REMOVE; | |
0dfd0eb8 | 1757 | bool need_prep = false; /* prepare return uprobe, when needed */ |
da1816b1 ON |
1758 | |
1759 | down_read(&uprobe->register_rwsem); | |
1760 | for (uc = uprobe->consumers; uc; uc = uc->next) { | |
ea024870 | 1761 | int rc = 0; |
da1816b1 | 1762 | |
ea024870 AA |
1763 | if (uc->handler) { |
1764 | rc = uc->handler(uc, regs); | |
1765 | WARN(rc & ~UPROBE_HANDLER_MASK, | |
1766 | "bad rc=0x%x from %pf()\n", rc, uc->handler); | |
1767 | } | |
0dfd0eb8 AA |
1768 | |
1769 | if (uc->ret_handler) | |
1770 | need_prep = true; | |
1771 | ||
da1816b1 ON |
1772 | remove &= rc; |
1773 | } | |
1774 | ||
0dfd0eb8 AA |
1775 | if (need_prep && !remove) |
1776 | prepare_uretprobe(uprobe, regs); /* put bp at return */ | |
1777 | ||
da1816b1 ON |
1778 | if (remove && uprobe->consumers) { |
1779 | WARN_ON(!uprobe_is_active(uprobe)); | |
1780 | unapply_uprobe(uprobe, current->mm); | |
1781 | } | |
1782 | up_read(&uprobe->register_rwsem); | |
1783 | } | |
1784 | ||
fec8898d AA |
1785 | static void |
1786 | handle_uretprobe_chain(struct return_instance *ri, struct pt_regs *regs) | |
1787 | { | |
1788 | struct uprobe *uprobe = ri->uprobe; | |
1789 | struct uprobe_consumer *uc; | |
1790 | ||
1791 | down_read(&uprobe->register_rwsem); | |
1792 | for (uc = uprobe->consumers; uc; uc = uc->next) { | |
1793 | if (uc->ret_handler) | |
1794 | uc->ret_handler(uc, ri->func, regs); | |
1795 | } | |
1796 | up_read(&uprobe->register_rwsem); | |
1797 | } | |
1798 | ||
a83cfeb9 ON |
1799 | static struct return_instance *find_next_ret_chain(struct return_instance *ri) |
1800 | { | |
1801 | bool chained; | |
1802 | ||
1803 | do { | |
1804 | chained = ri->chained; | |
1805 | ri = ri->next; /* can't be NULL if chained */ | |
1806 | } while (chained); | |
1807 | ||
1808 | return ri; | |
1809 | } | |
1810 | ||
0b5256c7 | 1811 | static void handle_trampoline(struct pt_regs *regs) |
fec8898d AA |
1812 | { |
1813 | struct uprobe_task *utask; | |
a83cfeb9 | 1814 | struct return_instance *ri, *next; |
5eeb50de | 1815 | bool valid; |
fec8898d AA |
1816 | |
1817 | utask = current->utask; | |
1818 | if (!utask) | |
0b5256c7 | 1819 | goto sigill; |
fec8898d AA |
1820 | |
1821 | ri = utask->return_instances; | |
1822 | if (!ri) | |
0b5256c7 | 1823 | goto sigill; |
fec8898d | 1824 | |
a83cfeb9 | 1825 | do { |
5eeb50de ON |
1826 | /* |
1827 | * We should throw out the frames invalidated by longjmp(). | |
1828 | * If this chain is valid, then the next one should be alive | |
1829 | * or NULL; the latter case means that nobody but ri->func | |
1830 | * could hit this trampoline on return. TODO: sigaltstack(). | |
1831 | */ | |
1832 | next = find_next_ret_chain(ri); | |
86dcb702 | 1833 | valid = !next || arch_uretprobe_is_alive(next, RP_CHECK_RET, regs); |
5eeb50de ON |
1834 | |
1835 | instruction_pointer_set(regs, ri->orig_ret_vaddr); | |
1836 | do { | |
1837 | if (valid) | |
1838 | handle_uretprobe_chain(ri, regs); | |
1839 | ri = free_ret_instance(ri); | |
1840 | utask->depth--; | |
1841 | } while (ri != next); | |
1842 | } while (!valid); | |
fec8898d AA |
1843 | |
1844 | utask->return_instances = ri; | |
0b5256c7 ON |
1845 | return; |
1846 | ||
1847 | sigill: | |
1848 | uprobe_warn(current, "handle uretprobe, sending SIGILL."); | |
1849 | force_sig_info(SIGILL, SEND_SIG_FORCED, current); | |
fec8898d | 1850 | |
fec8898d AA |
1851 | } |
1852 | ||
6fe50a28 DL |
1853 | bool __weak arch_uprobe_ignore(struct arch_uprobe *aup, struct pt_regs *regs) |
1854 | { | |
1855 | return false; | |
1856 | } | |
1857 | ||
86dcb702 ON |
1858 | bool __weak arch_uretprobe_is_alive(struct return_instance *ret, enum rp_check ctx, |
1859 | struct pt_regs *regs) | |
97da8976 ON |
1860 | { |
1861 | return true; | |
1862 | } | |
1863 | ||
3a9ea052 ON |
1864 | /* |
1865 | * Run handler and ask thread to singlestep. | |
1866 | * Ensure all non-fatal signals cannot interrupt thread while it singlesteps. | |
1867 | */ | |
1868 | static void handle_swbp(struct pt_regs *regs) | |
1869 | { | |
3a9ea052 ON |
1870 | struct uprobe *uprobe; |
1871 | unsigned long bp_vaddr; | |
56bb4cf6 | 1872 | int uninitialized_var(is_swbp); |
3a9ea052 ON |
1873 | |
1874 | bp_vaddr = uprobe_get_swbp_addr(regs); | |
0b5256c7 ON |
1875 | if (bp_vaddr == get_trampoline_vaddr()) |
1876 | return handle_trampoline(regs); | |
fec8898d AA |
1877 | |
1878 | uprobe = find_active_uprobe(bp_vaddr, &is_swbp); | |
0326f5a9 | 1879 | if (!uprobe) { |
56bb4cf6 ON |
1880 | if (is_swbp > 0) { |
1881 | /* No matching uprobe; signal SIGTRAP. */ | |
1882 | send_sig(SIGTRAP, current, 0); | |
1883 | } else { | |
1884 | /* | |
1885 | * Either we raced with uprobe_unregister() or we can't | |
1886 | * access this memory. The latter is only possible if | |
1887 | * another thread plays with our ->mm. In both cases | |
1888 | * we can simply restart. If this vma was unmapped we | |
1889 | * can pretend this insn was not executed yet and get | |
1890 | * the (correct) SIGSEGV after restart. | |
1891 | */ | |
1892 | instruction_pointer_set(regs, bp_vaddr); | |
1893 | } | |
0326f5a9 SD |
1894 | return; |
1895 | } | |
74e59dfc ON |
1896 | |
1897 | /* change it in advance for ->handler() and restart */ | |
1898 | instruction_pointer_set(regs, bp_vaddr); | |
1899 | ||
142b18dd ON |
1900 | /* |
1901 | * TODO: move copy_insn/etc into _register and remove this hack. | |
1902 | * After we hit the bp, _unregister + _register can install the | |
1903 | * new and not-yet-analyzed uprobe at the same address, restart. | |
1904 | */ | |
1905 | smp_rmb(); /* pairs with wmb() in install_breakpoint() */ | |
71434f2f | 1906 | if (unlikely(!test_bit(UPROBE_COPY_INSN, &uprobe->flags))) |
74e59dfc | 1907 | goto out; |
0326f5a9 | 1908 | |
72fd293a ON |
1909 | /* Tracing handlers use ->utask to communicate with fetch methods */ |
1910 | if (!get_utask()) | |
1911 | goto out; | |
1912 | ||
6fe50a28 DL |
1913 | if (arch_uprobe_ignore(&uprobe->arch, regs)) |
1914 | goto out; | |
1915 | ||
0326f5a9 | 1916 | handler_chain(uprobe, regs); |
6fe50a28 | 1917 | |
8a6b1732 | 1918 | if (arch_uprobe_skip_sstep(&uprobe->arch, regs)) |
0578a970 | 1919 | goto out; |
0326f5a9 | 1920 | |
608e7427 | 1921 | if (!pre_ssout(uprobe, regs, bp_vaddr)) |
0326f5a9 | 1922 | return; |
0326f5a9 | 1923 | |
8a6b1732 | 1924 | /* arch_uprobe_skip_sstep() succeeded, or restart if can't singlestep */ |
0578a970 | 1925 | out: |
8bd87445 | 1926 | put_uprobe(uprobe); |
0326f5a9 SD |
1927 | } |
1928 | ||
1929 | /* | |
1930 | * Perform required fix-ups and disable singlestep. | |
1931 | * Allow pending signals to take effect. | |
1932 | */ | |
1933 | static void handle_singlestep(struct uprobe_task *utask, struct pt_regs *regs) | |
1934 | { | |
1935 | struct uprobe *uprobe; | |
014940ba | 1936 | int err = 0; |
0326f5a9 SD |
1937 | |
1938 | uprobe = utask->active_uprobe; | |
1939 | if (utask->state == UTASK_SSTEP_ACK) | |
014940ba | 1940 | err = arch_uprobe_post_xol(&uprobe->arch, regs); |
0326f5a9 SD |
1941 | else if (utask->state == UTASK_SSTEP_TRAPPED) |
1942 | arch_uprobe_abort_xol(&uprobe->arch, regs); | |
1943 | else | |
1944 | WARN_ON_ONCE(1); | |
1945 | ||
1946 | put_uprobe(uprobe); | |
1947 | utask->active_uprobe = NULL; | |
1948 | utask->state = UTASK_RUNNING; | |
d4b3b638 | 1949 | xol_free_insn_slot(current); |
0326f5a9 SD |
1950 | |
1951 | spin_lock_irq(¤t->sighand->siglock); | |
1952 | recalc_sigpending(); /* see uprobe_deny_signal() */ | |
1953 | spin_unlock_irq(¤t->sighand->siglock); | |
014940ba ON |
1954 | |
1955 | if (unlikely(err)) { | |
1956 | uprobe_warn(current, "execute the probed insn, sending SIGILL."); | |
1957 | force_sig_info(SIGILL, SEND_SIG_FORCED, current); | |
1958 | } | |
0326f5a9 SD |
1959 | } |
1960 | ||
1961 | /* | |
1b08e907 ON |
1962 | * On breakpoint hit, breakpoint notifier sets the TIF_UPROBE flag and |
1963 | * allows the thread to return from interrupt. After that handle_swbp() | |
1964 | * sets utask->active_uprobe. | |
0326f5a9 | 1965 | * |
1b08e907 ON |
1966 | * On singlestep exception, singlestep notifier sets the TIF_UPROBE flag |
1967 | * and allows the thread to return from interrupt. | |
0326f5a9 SD |
1968 | * |
1969 | * While returning to userspace, thread notices the TIF_UPROBE flag and calls | |
1970 | * uprobe_notify_resume(). | |
1971 | */ | |
1972 | void uprobe_notify_resume(struct pt_regs *regs) | |
1973 | { | |
1974 | struct uprobe_task *utask; | |
1975 | ||
db023ea5 ON |
1976 | clear_thread_flag(TIF_UPROBE); |
1977 | ||
0326f5a9 | 1978 | utask = current->utask; |
1b08e907 | 1979 | if (utask && utask->active_uprobe) |
0326f5a9 | 1980 | handle_singlestep(utask, regs); |
1b08e907 ON |
1981 | else |
1982 | handle_swbp(regs); | |
0326f5a9 SD |
1983 | } |
1984 | ||
1985 | /* | |
1986 | * uprobe_pre_sstep_notifier gets called from interrupt context as part of | |
1987 | * notifier mechanism. Set TIF_UPROBE flag and indicate breakpoint hit. | |
1988 | */ | |
1989 | int uprobe_pre_sstep_notifier(struct pt_regs *regs) | |
1990 | { | |
0dfd0eb8 AA |
1991 | if (!current->mm) |
1992 | return 0; | |
1993 | ||
1994 | if (!test_bit(MMF_HAS_UPROBES, ¤t->mm->flags) && | |
1995 | (!current->utask || !current->utask->return_instances)) | |
0326f5a9 SD |
1996 | return 0; |
1997 | ||
0326f5a9 | 1998 | set_thread_flag(TIF_UPROBE); |
0326f5a9 SD |
1999 | return 1; |
2000 | } | |
2001 | ||
2002 | /* | |
2003 | * uprobe_post_sstep_notifier gets called in interrupt context as part of notifier | |
2004 | * mechanism. Set TIF_UPROBE flag and indicate completion of singlestep. | |
2005 | */ | |
2006 | int uprobe_post_sstep_notifier(struct pt_regs *regs) | |
2007 | { | |
2008 | struct uprobe_task *utask = current->utask; | |
2009 | ||
2010 | if (!current->mm || !utask || !utask->active_uprobe) | |
2011 | /* task is currently not uprobed */ | |
2012 | return 0; | |
2013 | ||
2014 | utask->state = UTASK_SSTEP_ACK; | |
2015 | set_thread_flag(TIF_UPROBE); | |
2016 | return 1; | |
2017 | } | |
2018 | ||
2019 | static struct notifier_block uprobe_exception_nb = { | |
2020 | .notifier_call = arch_uprobe_exception_notify, | |
2021 | .priority = INT_MAX-1, /* notified after kprobes, kgdb */ | |
2022 | }; | |
2023 | ||
2b144498 SD |
2024 | static int __init init_uprobes(void) |
2025 | { | |
2026 | int i; | |
2027 | ||
66d06dff | 2028 | for (i = 0; i < UPROBES_HASH_SZ; i++) |
2b144498 | 2029 | mutex_init(&uprobes_mmap_mutex[i]); |
0326f5a9 | 2030 | |
32cdba1e ON |
2031 | if (percpu_init_rwsem(&dup_mmap_sem)) |
2032 | return -ENOMEM; | |
2033 | ||
0326f5a9 | 2034 | return register_die_notifier(&uprobe_exception_nb); |
2b144498 | 2035 | } |
736e89d9 | 2036 | __initcall(init_uprobes); |