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 | |
35aa621b | 22 | * Copyright (C) 2011-2012 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com> |
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> | |
30 | #include <linux/rmap.h> /* anon_vma_prepare */ | |
31 | #include <linux/mmu_notifier.h> /* set_pte_at_notify */ | |
32 | #include <linux/swap.h> /* try_to_free_swap */ | |
0326f5a9 SD |
33 | #include <linux/ptrace.h> /* user_enable_single_step */ |
34 | #include <linux/kdebug.h> /* notifier mechanism */ | |
194f8dcb | 35 | #include "../../mm/internal.h" /* munlock_vma_page */ |
32cdba1e | 36 | #include <linux/percpu-rwsem.h> |
7b2d81d4 | 37 | |
2b144498 SD |
38 | #include <linux/uprobes.h> |
39 | ||
d4b3b638 SD |
40 | #define UINSNS_PER_PAGE (PAGE_SIZE/UPROBE_XOL_SLOT_BYTES) |
41 | #define MAX_UPROBE_XOL_SLOTS UINSNS_PER_PAGE | |
42 | ||
2b144498 | 43 | static struct rb_root uprobes_tree = RB_ROOT; |
7b2d81d4 | 44 | |
2b144498 SD |
45 | static DEFINE_SPINLOCK(uprobes_treelock); /* serialize rbtree access */ |
46 | ||
47 | #define UPROBES_HASH_SZ 13 | |
7b2d81d4 | 48 | |
c5784de2 PZ |
49 | /* |
50 | * We need separate register/unregister and mmap/munmap lock hashes because | |
51 | * of mmap_sem nesting. | |
52 | * | |
53 | * uprobe_register() needs to install probes on (potentially) all processes | |
54 | * and thus needs to acquire multiple mmap_sems (consequtively, not | |
55 | * concurrently), whereas uprobe_mmap() is called while holding mmap_sem | |
56 | * for the particular process doing the mmap. | |
57 | * | |
58 | * uprobe_register()->register_for_each_vma() needs to drop/acquire mmap_sem | |
59 | * because of lock order against i_mmap_mutex. This means there's a hole in | |
60 | * the register vma iteration where a mmap() can happen. | |
61 | * | |
62 | * Thus uprobe_register() can race with uprobe_mmap() and we can try and | |
63 | * install a probe where one is already installed. | |
64 | */ | |
65 | ||
2b144498 SD |
66 | /* serialize (un)register */ |
67 | static struct mutex uprobes_mutex[UPROBES_HASH_SZ]; | |
7b2d81d4 IM |
68 | |
69 | #define uprobes_hash(v) (&uprobes_mutex[((unsigned long)(v)) % UPROBES_HASH_SZ]) | |
2b144498 SD |
70 | |
71 | /* serialize uprobe->pending_list */ | |
72 | static struct mutex uprobes_mmap_mutex[UPROBES_HASH_SZ]; | |
7b2d81d4 | 73 | #define uprobes_mmap_hash(v) (&uprobes_mmap_mutex[((unsigned long)(v)) % UPROBES_HASH_SZ]) |
2b144498 | 74 | |
32cdba1e ON |
75 | static struct percpu_rw_semaphore dup_mmap_sem; |
76 | ||
2b144498 | 77 | /* |
7b2d81d4 | 78 | * uprobe_events allows us to skip the uprobe_mmap if there are no uprobe |
2b144498 SD |
79 | * events active at this time. Probably a fine grained per inode count is |
80 | * better? | |
81 | */ | |
82 | static atomic_t uprobe_events = ATOMIC_INIT(0); | |
83 | ||
cb9a19fe | 84 | /* Have a copy of original instruction */ |
71434f2f | 85 | #define UPROBE_COPY_INSN 0 |
cb9a19fe | 86 | /* Can skip singlestep */ |
bb929284 | 87 | #define UPROBE_SKIP_SSTEP 1 |
cb9a19fe | 88 | |
3ff54efd SD |
89 | struct uprobe { |
90 | struct rb_node rb_node; /* node in the rb tree */ | |
91 | atomic_t ref; | |
e591c8d7 | 92 | struct rw_semaphore register_rwsem; |
3ff54efd | 93 | struct rw_semaphore consumer_rwsem; |
4710f05f | 94 | struct mutex copy_mutex; /* TODO: kill me and UPROBE_COPY_INSN */ |
3ff54efd SD |
95 | struct list_head pending_list; |
96 | struct uprobe_consumer *consumers; | |
97 | struct inode *inode; /* Also hold a ref to inode */ | |
98 | loff_t offset; | |
71434f2f | 99 | unsigned long flags; |
3ff54efd SD |
100 | struct arch_uprobe arch; |
101 | }; | |
102 | ||
2b144498 SD |
103 | /* |
104 | * valid_vma: Verify if the specified vma is an executable vma | |
105 | * Relax restrictions while unregistering: vm_flags might have | |
106 | * changed after breakpoint was inserted. | |
107 | * - is_register: indicates if we are in register context. | |
108 | * - Return 1 if the specified virtual address is in an | |
109 | * executable vma. | |
110 | */ | |
111 | static bool valid_vma(struct vm_area_struct *vma, bool is_register) | |
112 | { | |
e40cfce6 | 113 | vm_flags_t flags = VM_HUGETLB | VM_MAYEXEC | VM_SHARED; |
2b144498 | 114 | |
e40cfce6 ON |
115 | if (is_register) |
116 | flags |= VM_WRITE; | |
2b144498 | 117 | |
e40cfce6 | 118 | return vma->vm_file && (vma->vm_flags & flags) == VM_MAYEXEC; |
2b144498 SD |
119 | } |
120 | ||
57683f72 | 121 | static unsigned long offset_to_vaddr(struct vm_area_struct *vma, loff_t offset) |
2b144498 | 122 | { |
57683f72 | 123 | return vma->vm_start + offset - ((loff_t)vma->vm_pgoff << PAGE_SHIFT); |
2b144498 SD |
124 | } |
125 | ||
cb113b47 ON |
126 | static loff_t vaddr_to_offset(struct vm_area_struct *vma, unsigned long vaddr) |
127 | { | |
128 | return ((loff_t)vma->vm_pgoff << PAGE_SHIFT) + (vaddr - vma->vm_start); | |
129 | } | |
130 | ||
2b144498 SD |
131 | /** |
132 | * __replace_page - replace page in vma by new page. | |
133 | * based on replace_page in mm/ksm.c | |
134 | * | |
135 | * @vma: vma that holds the pte pointing to page | |
c517ee74 | 136 | * @addr: address the old @page is mapped at |
2b144498 SD |
137 | * @page: the cowed page we are replacing by kpage |
138 | * @kpage: the modified page we replace page by | |
139 | * | |
140 | * Returns 0 on success, -EFAULT on failure. | |
141 | */ | |
c517ee74 ON |
142 | static int __replace_page(struct vm_area_struct *vma, unsigned long addr, |
143 | struct page *page, struct page *kpage) | |
2b144498 SD |
144 | { |
145 | struct mm_struct *mm = vma->vm_mm; | |
5323ce71 ON |
146 | spinlock_t *ptl; |
147 | pte_t *ptep; | |
9f92448c | 148 | int err; |
6bdb913f HE |
149 | /* For mmu_notifiers */ |
150 | const unsigned long mmun_start = addr; | |
151 | const unsigned long mmun_end = addr + PAGE_SIZE; | |
2b144498 | 152 | |
194f8dcb | 153 | /* For try_to_free_swap() and munlock_vma_page() below */ |
9f92448c ON |
154 | lock_page(page); |
155 | ||
6bdb913f | 156 | mmu_notifier_invalidate_range_start(mm, mmun_start, mmun_end); |
9f92448c | 157 | err = -EAGAIN; |
5323ce71 | 158 | ptep = page_check_address(page, mm, addr, &ptl, 0); |
2b144498 | 159 | if (!ptep) |
9f92448c | 160 | goto unlock; |
2b144498 SD |
161 | |
162 | get_page(kpage); | |
163 | page_add_new_anon_rmap(kpage, vma, addr); | |
164 | ||
7396fa81 SD |
165 | if (!PageAnon(page)) { |
166 | dec_mm_counter(mm, MM_FILEPAGES); | |
167 | inc_mm_counter(mm, MM_ANONPAGES); | |
168 | } | |
169 | ||
2b144498 SD |
170 | flush_cache_page(vma, addr, pte_pfn(*ptep)); |
171 | ptep_clear_flush(vma, addr, ptep); | |
172 | set_pte_at_notify(mm, addr, ptep, mk_pte(kpage, vma->vm_page_prot)); | |
173 | ||
174 | page_remove_rmap(page); | |
175 | if (!page_mapped(page)) | |
176 | try_to_free_swap(page); | |
2b144498 | 177 | pte_unmap_unlock(ptep, ptl); |
2b144498 | 178 | |
194f8dcb ON |
179 | if (vma->vm_flags & VM_LOCKED) |
180 | munlock_vma_page(page); | |
181 | put_page(page); | |
182 | ||
9f92448c ON |
183 | err = 0; |
184 | unlock: | |
6bdb913f | 185 | mmu_notifier_invalidate_range_end(mm, mmun_start, mmun_end); |
9f92448c ON |
186 | unlock_page(page); |
187 | return err; | |
2b144498 SD |
188 | } |
189 | ||
190 | /** | |
5cb4ac3a | 191 | * is_swbp_insn - check if instruction is breakpoint instruction. |
2b144498 | 192 | * @insn: instruction to be checked. |
5cb4ac3a | 193 | * Default implementation of is_swbp_insn |
2b144498 SD |
194 | * Returns true if @insn is a breakpoint instruction. |
195 | */ | |
5cb4ac3a | 196 | bool __weak is_swbp_insn(uprobe_opcode_t *insn) |
2b144498 | 197 | { |
5cb4ac3a | 198 | return *insn == UPROBE_SWBP_INSN; |
2b144498 SD |
199 | } |
200 | ||
cceb55aa ON |
201 | static void copy_opcode(struct page *page, unsigned long vaddr, uprobe_opcode_t *opcode) |
202 | { | |
203 | void *kaddr = kmap_atomic(page); | |
204 | memcpy(opcode, kaddr + (vaddr & ~PAGE_MASK), UPROBE_SWBP_INSN_SIZE); | |
205 | kunmap_atomic(kaddr); | |
206 | } | |
207 | ||
ed6f6a50 ON |
208 | static int verify_opcode(struct page *page, unsigned long vaddr, uprobe_opcode_t *new_opcode) |
209 | { | |
210 | uprobe_opcode_t old_opcode; | |
211 | bool is_swbp; | |
212 | ||
213 | copy_opcode(page, vaddr, &old_opcode); | |
214 | is_swbp = is_swbp_insn(&old_opcode); | |
215 | ||
216 | if (is_swbp_insn(new_opcode)) { | |
217 | if (is_swbp) /* register: already installed? */ | |
218 | return 0; | |
219 | } else { | |
220 | if (!is_swbp) /* unregister: was it changed by us? */ | |
076a365b | 221 | return 0; |
ed6f6a50 ON |
222 | } |
223 | ||
224 | return 1; | |
225 | } | |
226 | ||
2b144498 SD |
227 | /* |
228 | * NOTE: | |
229 | * Expect the breakpoint instruction to be the smallest size instruction for | |
230 | * the architecture. If an arch has variable length instruction and the | |
231 | * breakpoint instruction is not of the smallest length instruction | |
cceb55aa | 232 | * supported by that architecture then we need to modify is_swbp_at_addr and |
2b144498 SD |
233 | * write_opcode accordingly. This would never be a problem for archs that |
234 | * have fixed length instructions. | |
235 | */ | |
236 | ||
237 | /* | |
238 | * write_opcode - write the opcode at a given virtual address. | |
239 | * @mm: the probed process address space. | |
2b144498 SD |
240 | * @vaddr: the virtual address to store the opcode. |
241 | * @opcode: opcode to be written at @vaddr. | |
242 | * | |
243 | * Called with mm->mmap_sem held (for read and with a reference to | |
244 | * mm). | |
245 | * | |
246 | * For mm @mm, write the opcode at @vaddr. | |
247 | * Return 0 (success) or a negative errno. | |
248 | */ | |
cceb55aa ON |
249 | static int write_opcode(struct mm_struct *mm, unsigned long vaddr, |
250 | uprobe_opcode_t opcode) | |
2b144498 SD |
251 | { |
252 | struct page *old_page, *new_page; | |
2b144498 SD |
253 | void *vaddr_old, *vaddr_new; |
254 | struct vm_area_struct *vma; | |
2b144498 | 255 | int ret; |
f403072c | 256 | |
5323ce71 | 257 | retry: |
2b144498 | 258 | /* Read the page with vaddr into memory */ |
75ed82ea | 259 | ret = get_user_pages(NULL, mm, vaddr, 1, 0, 1, &old_page, &vma); |
2b144498 SD |
260 | if (ret <= 0) |
261 | return ret; | |
7b2d81d4 | 262 | |
ed6f6a50 ON |
263 | ret = verify_opcode(old_page, vaddr, &opcode); |
264 | if (ret <= 0) | |
265 | goto put_old; | |
266 | ||
2b144498 SD |
267 | ret = -ENOMEM; |
268 | new_page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma, vaddr); | |
269 | if (!new_page) | |
9f92448c | 270 | goto put_old; |
2b144498 SD |
271 | |
272 | __SetPageUptodate(new_page); | |
273 | ||
2b144498 SD |
274 | /* copy the page now that we've got it stable */ |
275 | vaddr_old = kmap_atomic(old_page); | |
276 | vaddr_new = kmap_atomic(new_page); | |
277 | ||
278 | memcpy(vaddr_new, vaddr_old, PAGE_SIZE); | |
d9c4a30e | 279 | memcpy(vaddr_new + (vaddr & ~PAGE_MASK), &opcode, UPROBE_SWBP_INSN_SIZE); |
2b144498 SD |
280 | |
281 | kunmap_atomic(vaddr_new); | |
282 | kunmap_atomic(vaddr_old); | |
283 | ||
284 | ret = anon_vma_prepare(vma); | |
285 | if (ret) | |
9f92448c | 286 | goto put_new; |
2b144498 | 287 | |
c517ee74 | 288 | ret = __replace_page(vma, vaddr, old_page, new_page); |
2b144498 | 289 | |
9f92448c | 290 | put_new: |
2b144498 | 291 | page_cache_release(new_page); |
9f92448c | 292 | put_old: |
7b2d81d4 IM |
293 | put_page(old_page); |
294 | ||
5323ce71 ON |
295 | if (unlikely(ret == -EAGAIN)) |
296 | goto retry; | |
2b144498 SD |
297 | return ret; |
298 | } | |
299 | ||
2b144498 | 300 | /** |
5cb4ac3a | 301 | * set_swbp - store breakpoint at a given address. |
e3343e6a | 302 | * @auprobe: arch specific probepoint information. |
2b144498 | 303 | * @mm: the probed process address space. |
2b144498 SD |
304 | * @vaddr: the virtual address to insert the opcode. |
305 | * | |
306 | * For mm @mm, store the breakpoint instruction at @vaddr. | |
307 | * Return 0 (success) or a negative errno. | |
308 | */ | |
5cb4ac3a | 309 | int __weak set_swbp(struct arch_uprobe *auprobe, struct mm_struct *mm, unsigned long vaddr) |
2b144498 | 310 | { |
cceb55aa | 311 | return write_opcode(mm, vaddr, UPROBE_SWBP_INSN); |
2b144498 SD |
312 | } |
313 | ||
314 | /** | |
315 | * set_orig_insn - Restore the original instruction. | |
316 | * @mm: the probed process address space. | |
e3343e6a | 317 | * @auprobe: arch specific probepoint information. |
2b144498 | 318 | * @vaddr: the virtual address to insert the opcode. |
2b144498 SD |
319 | * |
320 | * For mm @mm, restore the original opcode (opcode) at @vaddr. | |
321 | * Return 0 (success) or a negative errno. | |
322 | */ | |
7b2d81d4 | 323 | int __weak |
ded86e7c | 324 | set_orig_insn(struct arch_uprobe *auprobe, struct mm_struct *mm, unsigned long vaddr) |
2b144498 | 325 | { |
cceb55aa | 326 | return write_opcode(mm, vaddr, *(uprobe_opcode_t *)auprobe->insn); |
2b144498 SD |
327 | } |
328 | ||
329 | static int match_uprobe(struct uprobe *l, struct uprobe *r) | |
330 | { | |
331 | if (l->inode < r->inode) | |
332 | return -1; | |
7b2d81d4 | 333 | |
2b144498 SD |
334 | if (l->inode > r->inode) |
335 | return 1; | |
2b144498 | 336 | |
7b2d81d4 IM |
337 | if (l->offset < r->offset) |
338 | return -1; | |
339 | ||
340 | if (l->offset > r->offset) | |
341 | return 1; | |
2b144498 SD |
342 | |
343 | return 0; | |
344 | } | |
345 | ||
346 | static struct uprobe *__find_uprobe(struct inode *inode, loff_t offset) | |
347 | { | |
348 | struct uprobe u = { .inode = inode, .offset = offset }; | |
349 | struct rb_node *n = uprobes_tree.rb_node; | |
350 | struct uprobe *uprobe; | |
351 | int match; | |
352 | ||
353 | while (n) { | |
354 | uprobe = rb_entry(n, struct uprobe, rb_node); | |
355 | match = match_uprobe(&u, uprobe); | |
356 | if (!match) { | |
357 | atomic_inc(&uprobe->ref); | |
358 | return uprobe; | |
359 | } | |
7b2d81d4 | 360 | |
2b144498 SD |
361 | if (match < 0) |
362 | n = n->rb_left; | |
363 | else | |
364 | n = n->rb_right; | |
365 | } | |
366 | return NULL; | |
367 | } | |
368 | ||
369 | /* | |
370 | * Find a uprobe corresponding to a given inode:offset | |
371 | * Acquires uprobes_treelock | |
372 | */ | |
373 | static struct uprobe *find_uprobe(struct inode *inode, loff_t offset) | |
374 | { | |
375 | struct uprobe *uprobe; | |
2b144498 | 376 | |
6f47caa0 | 377 | spin_lock(&uprobes_treelock); |
2b144498 | 378 | uprobe = __find_uprobe(inode, offset); |
6f47caa0 | 379 | spin_unlock(&uprobes_treelock); |
7b2d81d4 | 380 | |
2b144498 SD |
381 | return uprobe; |
382 | } | |
383 | ||
384 | static struct uprobe *__insert_uprobe(struct uprobe *uprobe) | |
385 | { | |
386 | struct rb_node **p = &uprobes_tree.rb_node; | |
387 | struct rb_node *parent = NULL; | |
388 | struct uprobe *u; | |
389 | int match; | |
390 | ||
391 | while (*p) { | |
392 | parent = *p; | |
393 | u = rb_entry(parent, struct uprobe, rb_node); | |
394 | match = match_uprobe(uprobe, u); | |
395 | if (!match) { | |
396 | atomic_inc(&u->ref); | |
397 | return u; | |
398 | } | |
399 | ||
400 | if (match < 0) | |
401 | p = &parent->rb_left; | |
402 | else | |
403 | p = &parent->rb_right; | |
404 | ||
405 | } | |
7b2d81d4 | 406 | |
2b144498 SD |
407 | u = NULL; |
408 | rb_link_node(&uprobe->rb_node, parent, p); | |
409 | rb_insert_color(&uprobe->rb_node, &uprobes_tree); | |
410 | /* get access + creation ref */ | |
411 | atomic_set(&uprobe->ref, 2); | |
7b2d81d4 | 412 | |
2b144498 SD |
413 | return u; |
414 | } | |
415 | ||
416 | /* | |
7b2d81d4 | 417 | * Acquire uprobes_treelock. |
2b144498 SD |
418 | * Matching uprobe already exists in rbtree; |
419 | * increment (access refcount) and return the matching uprobe. | |
420 | * | |
421 | * No matching uprobe; insert the uprobe in rb_tree; | |
422 | * get a double refcount (access + creation) and return NULL. | |
423 | */ | |
424 | static struct uprobe *insert_uprobe(struct uprobe *uprobe) | |
425 | { | |
2b144498 SD |
426 | struct uprobe *u; |
427 | ||
6f47caa0 | 428 | spin_lock(&uprobes_treelock); |
2b144498 | 429 | u = __insert_uprobe(uprobe); |
6f47caa0 | 430 | spin_unlock(&uprobes_treelock); |
7b2d81d4 | 431 | |
2b144498 SD |
432 | return u; |
433 | } | |
434 | ||
435 | static void put_uprobe(struct uprobe *uprobe) | |
436 | { | |
437 | if (atomic_dec_and_test(&uprobe->ref)) | |
438 | kfree(uprobe); | |
439 | } | |
440 | ||
441 | static struct uprobe *alloc_uprobe(struct inode *inode, loff_t offset) | |
442 | { | |
443 | struct uprobe *uprobe, *cur_uprobe; | |
444 | ||
445 | uprobe = kzalloc(sizeof(struct uprobe), GFP_KERNEL); | |
446 | if (!uprobe) | |
447 | return NULL; | |
448 | ||
449 | uprobe->inode = igrab(inode); | |
450 | uprobe->offset = offset; | |
e591c8d7 | 451 | init_rwsem(&uprobe->register_rwsem); |
2b144498 | 452 | init_rwsem(&uprobe->consumer_rwsem); |
4710f05f | 453 | mutex_init(&uprobe->copy_mutex); |
bbc33d05 ON |
454 | /* For now assume that the instruction need not be single-stepped */ |
455 | __set_bit(UPROBE_SKIP_SSTEP, &uprobe->flags); | |
2b144498 SD |
456 | |
457 | /* add to uprobes_tree, sorted on inode:offset */ | |
458 | cur_uprobe = insert_uprobe(uprobe); | |
459 | ||
460 | /* a uprobe exists for this inode:offset combination */ | |
461 | if (cur_uprobe) { | |
462 | kfree(uprobe); | |
463 | uprobe = cur_uprobe; | |
464 | iput(inode); | |
7b2d81d4 | 465 | } else { |
2b144498 | 466 | atomic_inc(&uprobe_events); |
7b2d81d4 IM |
467 | } |
468 | ||
2b144498 SD |
469 | return uprobe; |
470 | } | |
471 | ||
0326f5a9 SD |
472 | static void handler_chain(struct uprobe *uprobe, struct pt_regs *regs) |
473 | { | |
474 | struct uprobe_consumer *uc; | |
475 | ||
e591c8d7 | 476 | down_read(&uprobe->register_rwsem); |
fe20d71f ON |
477 | for (uc = uprobe->consumers; uc; uc = uc->next) |
478 | uc->handler(uc, regs); | |
e591c8d7 | 479 | up_read(&uprobe->register_rwsem); |
0326f5a9 SD |
480 | } |
481 | ||
9a98e03c | 482 | static void consumer_add(struct uprobe *uprobe, struct uprobe_consumer *uc) |
2b144498 SD |
483 | { |
484 | down_write(&uprobe->consumer_rwsem); | |
e3343e6a SD |
485 | uc->next = uprobe->consumers; |
486 | uprobe->consumers = uc; | |
2b144498 | 487 | up_write(&uprobe->consumer_rwsem); |
2b144498 SD |
488 | } |
489 | ||
490 | /* | |
e3343e6a SD |
491 | * For uprobe @uprobe, delete the consumer @uc. |
492 | * Return true if the @uc is deleted successfully | |
2b144498 SD |
493 | * or return false. |
494 | */ | |
e3343e6a | 495 | static bool consumer_del(struct uprobe *uprobe, struct uprobe_consumer *uc) |
2b144498 SD |
496 | { |
497 | struct uprobe_consumer **con; | |
498 | bool ret = false; | |
499 | ||
500 | down_write(&uprobe->consumer_rwsem); | |
501 | for (con = &uprobe->consumers; *con; con = &(*con)->next) { | |
e3343e6a SD |
502 | if (*con == uc) { |
503 | *con = uc->next; | |
2b144498 SD |
504 | ret = true; |
505 | break; | |
506 | } | |
507 | } | |
508 | up_write(&uprobe->consumer_rwsem); | |
7b2d81d4 | 509 | |
2b144498 SD |
510 | return ret; |
511 | } | |
512 | ||
e3343e6a | 513 | static int |
d436615e | 514 | __copy_insn(struct address_space *mapping, struct file *filp, char *insn, |
593609a5 | 515 | unsigned long nbytes, loff_t offset) |
2b144498 | 516 | { |
2b144498 SD |
517 | struct page *page; |
518 | void *vaddr; | |
593609a5 ON |
519 | unsigned long off; |
520 | pgoff_t idx; | |
2b144498 SD |
521 | |
522 | if (!filp) | |
523 | return -EINVAL; | |
524 | ||
cc359d18 ON |
525 | if (!mapping->a_ops->readpage) |
526 | return -EIO; | |
527 | ||
593609a5 ON |
528 | idx = offset >> PAGE_CACHE_SHIFT; |
529 | off = offset & ~PAGE_MASK; | |
2b144498 SD |
530 | |
531 | /* | |
532 | * Ensure that the page that has the original instruction is | |
533 | * populated and in page-cache. | |
534 | */ | |
535 | page = read_mapping_page(mapping, idx, filp); | |
536 | if (IS_ERR(page)) | |
537 | return PTR_ERR(page); | |
538 | ||
539 | vaddr = kmap_atomic(page); | |
593609a5 | 540 | memcpy(insn, vaddr + off, nbytes); |
2b144498 SD |
541 | kunmap_atomic(vaddr); |
542 | page_cache_release(page); | |
7b2d81d4 | 543 | |
2b144498 SD |
544 | return 0; |
545 | } | |
546 | ||
d436615e | 547 | static int copy_insn(struct uprobe *uprobe, struct file *filp) |
2b144498 SD |
548 | { |
549 | struct address_space *mapping; | |
2b144498 | 550 | unsigned long nbytes; |
7b2d81d4 | 551 | int bytes; |
2b144498 | 552 | |
d436615e | 553 | nbytes = PAGE_SIZE - (uprobe->offset & ~PAGE_MASK); |
2b144498 SD |
554 | mapping = uprobe->inode->i_mapping; |
555 | ||
556 | /* Instruction at end of binary; copy only available bytes */ | |
557 | if (uprobe->offset + MAX_UINSN_BYTES > uprobe->inode->i_size) | |
558 | bytes = uprobe->inode->i_size - uprobe->offset; | |
559 | else | |
560 | bytes = MAX_UINSN_BYTES; | |
561 | ||
562 | /* Instruction at the page-boundary; copy bytes in second page */ | |
563 | if (nbytes < bytes) { | |
fc36f595 ON |
564 | int err = __copy_insn(mapping, filp, uprobe->arch.insn + nbytes, |
565 | bytes - nbytes, uprobe->offset + nbytes); | |
566 | if (err) | |
567 | return err; | |
2b144498 SD |
568 | bytes = nbytes; |
569 | } | |
d436615e | 570 | return __copy_insn(mapping, filp, uprobe->arch.insn, bytes, uprobe->offset); |
2b144498 SD |
571 | } |
572 | ||
cb9a19fe ON |
573 | static int prepare_uprobe(struct uprobe *uprobe, struct file *file, |
574 | struct mm_struct *mm, unsigned long vaddr) | |
575 | { | |
576 | int ret = 0; | |
577 | ||
71434f2f | 578 | if (test_bit(UPROBE_COPY_INSN, &uprobe->flags)) |
cb9a19fe ON |
579 | return ret; |
580 | ||
4710f05f | 581 | mutex_lock(&uprobe->copy_mutex); |
71434f2f | 582 | if (test_bit(UPROBE_COPY_INSN, &uprobe->flags)) |
4710f05f ON |
583 | goto out; |
584 | ||
cb9a19fe ON |
585 | ret = copy_insn(uprobe, file); |
586 | if (ret) | |
587 | goto out; | |
588 | ||
589 | ret = -ENOTSUPP; | |
590 | if (is_swbp_insn((uprobe_opcode_t *)uprobe->arch.insn)) | |
591 | goto out; | |
592 | ||
593 | ret = arch_uprobe_analyze_insn(&uprobe->arch, mm, vaddr); | |
594 | if (ret) | |
595 | goto out; | |
596 | ||
597 | /* write_opcode() assumes we don't cross page boundary */ | |
598 | BUG_ON((uprobe->offset & ~PAGE_MASK) + | |
599 | UPROBE_SWBP_INSN_SIZE > PAGE_SIZE); | |
600 | ||
601 | smp_wmb(); /* pairs with rmb() in find_active_uprobe() */ | |
71434f2f | 602 | set_bit(UPROBE_COPY_INSN, &uprobe->flags); |
cb9a19fe ON |
603 | |
604 | out: | |
4710f05f ON |
605 | mutex_unlock(&uprobe->copy_mutex); |
606 | ||
cb9a19fe ON |
607 | return ret; |
608 | } | |
609 | ||
63633cbf ON |
610 | static bool filter_chain(struct uprobe *uprobe) |
611 | { | |
1ff6fee5 ON |
612 | struct uprobe_consumer *uc; |
613 | bool ret = false; | |
614 | ||
615 | down_read(&uprobe->consumer_rwsem); | |
616 | for (uc = uprobe->consumers; uc; uc = uc->next) { | |
617 | /* TODO: ret = uc->filter(...) */ | |
618 | ret = true; | |
619 | if (ret) | |
620 | break; | |
621 | } | |
622 | up_read(&uprobe->consumer_rwsem); | |
623 | ||
624 | return ret; | |
63633cbf ON |
625 | } |
626 | ||
e3343e6a SD |
627 | static int |
628 | install_breakpoint(struct uprobe *uprobe, struct mm_struct *mm, | |
816c03fb | 629 | struct vm_area_struct *vma, unsigned long vaddr) |
2b144498 | 630 | { |
f8ac4ec9 | 631 | bool first_uprobe; |
2b144498 SD |
632 | int ret; |
633 | ||
634 | /* | |
635 | * If probe is being deleted, unregister thread could be done with | |
636 | * the vma-rmap-walk through. Adding a probe now can be fatal since | |
63633cbf ON |
637 | * nobody will be able to cleanup. But in this case filter_chain() |
638 | * must return false, all consumers have gone away. | |
2b144498 | 639 | */ |
63633cbf | 640 | if (!filter_chain(uprobe)) |
78f74116 | 641 | return 0; |
2b144498 | 642 | |
cb9a19fe ON |
643 | ret = prepare_uprobe(uprobe, vma->vm_file, mm, vaddr); |
644 | if (ret) | |
645 | return ret; | |
682968e0 | 646 | |
f8ac4ec9 ON |
647 | /* |
648 | * set MMF_HAS_UPROBES in advance for uprobe_pre_sstep_notifier(), | |
649 | * the task can hit this breakpoint right after __replace_page(). | |
650 | */ | |
651 | first_uprobe = !test_bit(MMF_HAS_UPROBES, &mm->flags); | |
652 | if (first_uprobe) | |
653 | set_bit(MMF_HAS_UPROBES, &mm->flags); | |
654 | ||
816c03fb | 655 | ret = set_swbp(&uprobe->arch, mm, vaddr); |
9f68f672 ON |
656 | if (!ret) |
657 | clear_bit(MMF_RECALC_UPROBES, &mm->flags); | |
658 | else if (first_uprobe) | |
f8ac4ec9 | 659 | clear_bit(MMF_HAS_UPROBES, &mm->flags); |
2b144498 SD |
660 | |
661 | return ret; | |
662 | } | |
663 | ||
076a365b | 664 | static int |
816c03fb | 665 | remove_breakpoint(struct uprobe *uprobe, struct mm_struct *mm, unsigned long vaddr) |
2b144498 | 666 | { |
9f68f672 | 667 | if (!test_bit(MMF_HAS_UPROBES, &mm->flags)) |
076a365b | 668 | return 0; |
9f68f672 | 669 | |
63633cbf ON |
670 | if (filter_chain(uprobe)) |
671 | return 0; | |
672 | ||
9f68f672 | 673 | set_bit(MMF_RECALC_UPROBES, &mm->flags); |
076a365b | 674 | return set_orig_insn(&uprobe->arch, mm, vaddr); |
2b144498 SD |
675 | } |
676 | ||
0326f5a9 | 677 | /* |
778b032d ON |
678 | * There could be threads that have already hit the breakpoint. They |
679 | * will recheck the current insn and restart if find_uprobe() fails. | |
680 | * See find_active_uprobe(). | |
0326f5a9 | 681 | */ |
2b144498 SD |
682 | static void delete_uprobe(struct uprobe *uprobe) |
683 | { | |
6f47caa0 | 684 | spin_lock(&uprobes_treelock); |
2b144498 | 685 | rb_erase(&uprobe->rb_node, &uprobes_tree); |
6f47caa0 | 686 | spin_unlock(&uprobes_treelock); |
2b144498 SD |
687 | iput(uprobe->inode); |
688 | put_uprobe(uprobe); | |
689 | atomic_dec(&uprobe_events); | |
690 | } | |
691 | ||
26872090 ON |
692 | struct map_info { |
693 | struct map_info *next; | |
694 | struct mm_struct *mm; | |
816c03fb | 695 | unsigned long vaddr; |
26872090 ON |
696 | }; |
697 | ||
698 | static inline struct map_info *free_map_info(struct map_info *info) | |
2b144498 | 699 | { |
26872090 ON |
700 | struct map_info *next = info->next; |
701 | kfree(info); | |
702 | return next; | |
703 | } | |
704 | ||
705 | static struct map_info * | |
706 | build_map_info(struct address_space *mapping, loff_t offset, bool is_register) | |
707 | { | |
708 | unsigned long pgoff = offset >> PAGE_SHIFT; | |
2b144498 | 709 | struct vm_area_struct *vma; |
26872090 ON |
710 | struct map_info *curr = NULL; |
711 | struct map_info *prev = NULL; | |
712 | struct map_info *info; | |
713 | int more = 0; | |
2b144498 | 714 | |
26872090 ON |
715 | again: |
716 | mutex_lock(&mapping->i_mmap_mutex); | |
6b2dbba8 | 717 | vma_interval_tree_foreach(vma, &mapping->i_mmap, pgoff, pgoff) { |
2b144498 SD |
718 | if (!valid_vma(vma, is_register)) |
719 | continue; | |
720 | ||
7a5bfb66 ON |
721 | if (!prev && !more) { |
722 | /* | |
723 | * Needs GFP_NOWAIT to avoid i_mmap_mutex recursion through | |
724 | * reclaim. This is optimistic, no harm done if it fails. | |
725 | */ | |
726 | prev = kmalloc(sizeof(struct map_info), | |
727 | GFP_NOWAIT | __GFP_NOMEMALLOC | __GFP_NOWARN); | |
728 | if (prev) | |
729 | prev->next = NULL; | |
730 | } | |
26872090 ON |
731 | if (!prev) { |
732 | more++; | |
733 | continue; | |
2b144498 | 734 | } |
2b144498 | 735 | |
26872090 ON |
736 | if (!atomic_inc_not_zero(&vma->vm_mm->mm_users)) |
737 | continue; | |
7b2d81d4 | 738 | |
26872090 ON |
739 | info = prev; |
740 | prev = prev->next; | |
741 | info->next = curr; | |
742 | curr = info; | |
2b144498 | 743 | |
26872090 | 744 | info->mm = vma->vm_mm; |
57683f72 | 745 | info->vaddr = offset_to_vaddr(vma, offset); |
26872090 | 746 | } |
2b144498 SD |
747 | mutex_unlock(&mapping->i_mmap_mutex); |
748 | ||
26872090 ON |
749 | if (!more) |
750 | goto out; | |
751 | ||
752 | prev = curr; | |
753 | while (curr) { | |
754 | mmput(curr->mm); | |
755 | curr = curr->next; | |
756 | } | |
7b2d81d4 | 757 | |
26872090 ON |
758 | do { |
759 | info = kmalloc(sizeof(struct map_info), GFP_KERNEL); | |
760 | if (!info) { | |
761 | curr = ERR_PTR(-ENOMEM); | |
762 | goto out; | |
763 | } | |
764 | info->next = prev; | |
765 | prev = info; | |
766 | } while (--more); | |
767 | ||
768 | goto again; | |
769 | out: | |
770 | while (prev) | |
771 | prev = free_map_info(prev); | |
772 | return curr; | |
2b144498 SD |
773 | } |
774 | ||
775 | static int register_for_each_vma(struct uprobe *uprobe, bool is_register) | |
776 | { | |
26872090 ON |
777 | struct map_info *info; |
778 | int err = 0; | |
2b144498 | 779 | |
32cdba1e | 780 | percpu_down_write(&dup_mmap_sem); |
26872090 ON |
781 | info = build_map_info(uprobe->inode->i_mapping, |
782 | uprobe->offset, is_register); | |
32cdba1e ON |
783 | if (IS_ERR(info)) { |
784 | err = PTR_ERR(info); | |
785 | goto out; | |
786 | } | |
7b2d81d4 | 787 | |
26872090 ON |
788 | while (info) { |
789 | struct mm_struct *mm = info->mm; | |
790 | struct vm_area_struct *vma; | |
7b2d81d4 | 791 | |
076a365b | 792 | if (err && is_register) |
26872090 | 793 | goto free; |
7b2d81d4 | 794 | |
77fc4af1 | 795 | down_write(&mm->mmap_sem); |
f4d6dfe5 ON |
796 | vma = find_vma(mm, info->vaddr); |
797 | if (!vma || !valid_vma(vma, is_register) || | |
798 | vma->vm_file->f_mapping->host != uprobe->inode) | |
26872090 ON |
799 | goto unlock; |
800 | ||
f4d6dfe5 ON |
801 | if (vma->vm_start > info->vaddr || |
802 | vaddr_to_offset(vma, info->vaddr) != uprobe->offset) | |
26872090 | 803 | goto unlock; |
2b144498 | 804 | |
78f74116 | 805 | if (is_register) |
26872090 | 806 | err = install_breakpoint(uprobe, mm, vma, info->vaddr); |
78f74116 | 807 | else |
076a365b | 808 | err |= remove_breakpoint(uprobe, mm, info->vaddr); |
78f74116 | 809 | |
26872090 ON |
810 | unlock: |
811 | up_write(&mm->mmap_sem); | |
812 | free: | |
813 | mmput(mm); | |
814 | info = free_map_info(info); | |
2b144498 | 815 | } |
32cdba1e ON |
816 | out: |
817 | percpu_up_write(&dup_mmap_sem); | |
26872090 | 818 | return err; |
2b144498 SD |
819 | } |
820 | ||
9a98e03c | 821 | static int __uprobe_register(struct uprobe *uprobe, struct uprobe_consumer *uc) |
2b144498 | 822 | { |
9a98e03c | 823 | consumer_add(uprobe, uc); |
bb929284 | 824 | return register_for_each_vma(uprobe, true); |
2b144498 SD |
825 | } |
826 | ||
04aab9b2 | 827 | static void __uprobe_unregister(struct uprobe *uprobe, struct uprobe_consumer *uc) |
2b144498 | 828 | { |
04aab9b2 ON |
829 | int err; |
830 | ||
831 | if (!consumer_del(uprobe, uc)) /* WARN? */ | |
832 | return; | |
2b144498 | 833 | |
04aab9b2 | 834 | err = register_for_each_vma(uprobe, false); |
bb929284 ON |
835 | /* TODO : cant unregister? schedule a worker thread */ |
836 | if (!uprobe->consumers && !err) | |
837 | delete_uprobe(uprobe); | |
2b144498 SD |
838 | } |
839 | ||
840 | /* | |
7b2d81d4 | 841 | * uprobe_register - register a probe |
2b144498 SD |
842 | * @inode: the file in which the probe has to be placed. |
843 | * @offset: offset from the start of the file. | |
e3343e6a | 844 | * @uc: information on howto handle the probe.. |
2b144498 | 845 | * |
7b2d81d4 | 846 | * Apart from the access refcount, uprobe_register() takes a creation |
2b144498 SD |
847 | * refcount (thro alloc_uprobe) if and only if this @uprobe is getting |
848 | * inserted into the rbtree (i.e first consumer for a @inode:@offset | |
7b2d81d4 | 849 | * tuple). Creation refcount stops uprobe_unregister from freeing the |
2b144498 | 850 | * @uprobe even before the register operation is complete. Creation |
e3343e6a | 851 | * refcount is released when the last @uc for the @uprobe |
2b144498 SD |
852 | * unregisters. |
853 | * | |
854 | * Return errno if it cannot successully install probes | |
855 | * else return 0 (success) | |
856 | */ | |
e3343e6a | 857 | int uprobe_register(struct inode *inode, loff_t offset, struct uprobe_consumer *uc) |
2b144498 SD |
858 | { |
859 | struct uprobe *uprobe; | |
7b2d81d4 | 860 | int ret; |
2b144498 | 861 | |
f0744af7 | 862 | /* Racy, just to catch the obvious mistakes */ |
2b144498 | 863 | if (offset > i_size_read(inode)) |
7b2d81d4 | 864 | return -EINVAL; |
2b144498 | 865 | |
9a98e03c | 866 | ret = -ENOMEM; |
2b144498 SD |
867 | mutex_lock(uprobes_hash(inode)); |
868 | uprobe = alloc_uprobe(inode, offset); | |
9a98e03c | 869 | if (uprobe) { |
e591c8d7 | 870 | down_write(&uprobe->register_rwsem); |
9a98e03c ON |
871 | ret = __uprobe_register(uprobe, uc); |
872 | if (ret) | |
04aab9b2 | 873 | __uprobe_unregister(uprobe, uc); |
e591c8d7 | 874 | up_write(&uprobe->register_rwsem); |
2b144498 | 875 | } |
2b144498 | 876 | mutex_unlock(uprobes_hash(inode)); |
6d1d8dfa SAS |
877 | if (uprobe) |
878 | put_uprobe(uprobe); | |
2b144498 SD |
879 | |
880 | return ret; | |
881 | } | |
882 | ||
883 | /* | |
7b2d81d4 | 884 | * uprobe_unregister - unregister a already registered probe. |
2b144498 SD |
885 | * @inode: the file in which the probe has to be removed. |
886 | * @offset: offset from the start of the file. | |
e3343e6a | 887 | * @uc: identify which probe if multiple probes are colocated. |
2b144498 | 888 | */ |
e3343e6a | 889 | void uprobe_unregister(struct inode *inode, loff_t offset, struct uprobe_consumer *uc) |
2b144498 | 890 | { |
7b2d81d4 | 891 | struct uprobe *uprobe; |
2b144498 | 892 | |
2b144498 SD |
893 | uprobe = find_uprobe(inode, offset); |
894 | if (!uprobe) | |
895 | return; | |
896 | ||
897 | mutex_lock(uprobes_hash(inode)); | |
e591c8d7 | 898 | down_write(&uprobe->register_rwsem); |
04aab9b2 | 899 | __uprobe_unregister(uprobe, uc); |
e591c8d7 | 900 | up_write(&uprobe->register_rwsem); |
2b144498 | 901 | mutex_unlock(uprobes_hash(inode)); |
c91368c4 | 902 | put_uprobe(uprobe); |
2b144498 SD |
903 | } |
904 | ||
891c3970 ON |
905 | static struct rb_node * |
906 | find_node_in_range(struct inode *inode, loff_t min, loff_t max) | |
2b144498 | 907 | { |
2b144498 | 908 | struct rb_node *n = uprobes_tree.rb_node; |
2b144498 SD |
909 | |
910 | while (n) { | |
891c3970 | 911 | struct uprobe *u = rb_entry(n, struct uprobe, rb_node); |
2b144498 | 912 | |
891c3970 | 913 | if (inode < u->inode) { |
2b144498 | 914 | n = n->rb_left; |
891c3970 | 915 | } else if (inode > u->inode) { |
2b144498 | 916 | n = n->rb_right; |
891c3970 ON |
917 | } else { |
918 | if (max < u->offset) | |
919 | n = n->rb_left; | |
920 | else if (min > u->offset) | |
921 | n = n->rb_right; | |
922 | else | |
923 | break; | |
924 | } | |
2b144498 | 925 | } |
7b2d81d4 | 926 | |
891c3970 | 927 | return n; |
2b144498 SD |
928 | } |
929 | ||
930 | /* | |
891c3970 | 931 | * For a given range in vma, build a list of probes that need to be inserted. |
2b144498 | 932 | */ |
891c3970 ON |
933 | static void build_probe_list(struct inode *inode, |
934 | struct vm_area_struct *vma, | |
935 | unsigned long start, unsigned long end, | |
936 | struct list_head *head) | |
2b144498 | 937 | { |
891c3970 | 938 | loff_t min, max; |
891c3970 ON |
939 | struct rb_node *n, *t; |
940 | struct uprobe *u; | |
7b2d81d4 | 941 | |
891c3970 | 942 | INIT_LIST_HEAD(head); |
cb113b47 | 943 | min = vaddr_to_offset(vma, start); |
891c3970 | 944 | max = min + (end - start) - 1; |
2b144498 | 945 | |
6f47caa0 | 946 | spin_lock(&uprobes_treelock); |
891c3970 ON |
947 | n = find_node_in_range(inode, min, max); |
948 | if (n) { | |
949 | for (t = n; t; t = rb_prev(t)) { | |
950 | u = rb_entry(t, struct uprobe, rb_node); | |
951 | if (u->inode != inode || u->offset < min) | |
952 | break; | |
953 | list_add(&u->pending_list, head); | |
954 | atomic_inc(&u->ref); | |
955 | } | |
956 | for (t = n; (t = rb_next(t)); ) { | |
957 | u = rb_entry(t, struct uprobe, rb_node); | |
958 | if (u->inode != inode || u->offset > max) | |
959 | break; | |
960 | list_add(&u->pending_list, head); | |
961 | atomic_inc(&u->ref); | |
962 | } | |
2b144498 | 963 | } |
6f47caa0 | 964 | spin_unlock(&uprobes_treelock); |
2b144498 SD |
965 | } |
966 | ||
967 | /* | |
5e5be71a | 968 | * Called from mmap_region/vma_adjust with mm->mmap_sem acquired. |
2b144498 | 969 | * |
5e5be71a ON |
970 | * Currently we ignore all errors and always return 0, the callers |
971 | * can't handle the failure anyway. | |
2b144498 | 972 | */ |
7b2d81d4 | 973 | int uprobe_mmap(struct vm_area_struct *vma) |
2b144498 SD |
974 | { |
975 | struct list_head tmp_list; | |
665605a2 | 976 | struct uprobe *uprobe, *u; |
2b144498 | 977 | struct inode *inode; |
2b144498 SD |
978 | |
979 | if (!atomic_read(&uprobe_events) || !valid_vma(vma, true)) | |
7b2d81d4 | 980 | return 0; |
2b144498 SD |
981 | |
982 | inode = vma->vm_file->f_mapping->host; | |
983 | if (!inode) | |
7b2d81d4 | 984 | return 0; |
2b144498 | 985 | |
2b144498 | 986 | mutex_lock(uprobes_mmap_hash(inode)); |
891c3970 | 987 | build_probe_list(inode, vma, vma->vm_start, vma->vm_end, &tmp_list); |
7b2d81d4 | 988 | |
665605a2 | 989 | list_for_each_entry_safe(uprobe, u, &tmp_list, pending_list) { |
5e5be71a | 990 | if (!fatal_signal_pending(current)) { |
57683f72 | 991 | unsigned long vaddr = offset_to_vaddr(vma, uprobe->offset); |
5e5be71a | 992 | install_breakpoint(uprobe, vma->vm_mm, vma, vaddr); |
2b144498 SD |
993 | } |
994 | put_uprobe(uprobe); | |
995 | } | |
2b144498 SD |
996 | mutex_unlock(uprobes_mmap_hash(inode)); |
997 | ||
5e5be71a | 998 | return 0; |
2b144498 SD |
999 | } |
1000 | ||
9f68f672 ON |
1001 | static bool |
1002 | vma_has_uprobes(struct vm_area_struct *vma, unsigned long start, unsigned long end) | |
1003 | { | |
1004 | loff_t min, max; | |
1005 | struct inode *inode; | |
1006 | struct rb_node *n; | |
1007 | ||
1008 | inode = vma->vm_file->f_mapping->host; | |
1009 | ||
1010 | min = vaddr_to_offset(vma, start); | |
1011 | max = min + (end - start) - 1; | |
1012 | ||
1013 | spin_lock(&uprobes_treelock); | |
1014 | n = find_node_in_range(inode, min, max); | |
1015 | spin_unlock(&uprobes_treelock); | |
1016 | ||
1017 | return !!n; | |
1018 | } | |
1019 | ||
682968e0 SD |
1020 | /* |
1021 | * Called in context of a munmap of a vma. | |
1022 | */ | |
cbc91f71 | 1023 | void uprobe_munmap(struct vm_area_struct *vma, unsigned long start, unsigned long end) |
682968e0 | 1024 | { |
682968e0 SD |
1025 | if (!atomic_read(&uprobe_events) || !valid_vma(vma, false)) |
1026 | return; | |
1027 | ||
2fd611a9 ON |
1028 | if (!atomic_read(&vma->vm_mm->mm_users)) /* called by mmput() ? */ |
1029 | return; | |
1030 | ||
9f68f672 ON |
1031 | if (!test_bit(MMF_HAS_UPROBES, &vma->vm_mm->flags) || |
1032 | test_bit(MMF_RECALC_UPROBES, &vma->vm_mm->flags)) | |
f8ac4ec9 ON |
1033 | return; |
1034 | ||
9f68f672 ON |
1035 | if (vma_has_uprobes(vma, start, end)) |
1036 | set_bit(MMF_RECALC_UPROBES, &vma->vm_mm->flags); | |
682968e0 SD |
1037 | } |
1038 | ||
d4b3b638 SD |
1039 | /* Slot allocation for XOL */ |
1040 | static int xol_add_vma(struct xol_area *area) | |
1041 | { | |
1042 | struct mm_struct *mm; | |
1043 | int ret; | |
1044 | ||
1045 | area->page = alloc_page(GFP_HIGHUSER); | |
1046 | if (!area->page) | |
1047 | return -ENOMEM; | |
1048 | ||
1049 | ret = -EALREADY; | |
1050 | mm = current->mm; | |
1051 | ||
1052 | down_write(&mm->mmap_sem); | |
1053 | if (mm->uprobes_state.xol_area) | |
1054 | goto fail; | |
1055 | ||
1056 | ret = -ENOMEM; | |
1057 | ||
1058 | /* Try to map as high as possible, this is only a hint. */ | |
1059 | area->vaddr = get_unmapped_area(NULL, TASK_SIZE - PAGE_SIZE, PAGE_SIZE, 0, 0); | |
1060 | if (area->vaddr & ~PAGE_MASK) { | |
1061 | ret = area->vaddr; | |
1062 | goto fail; | |
1063 | } | |
1064 | ||
1065 | ret = install_special_mapping(mm, area->vaddr, PAGE_SIZE, | |
1066 | VM_EXEC|VM_MAYEXEC|VM_DONTCOPY|VM_IO, &area->page); | |
1067 | if (ret) | |
1068 | goto fail; | |
1069 | ||
1070 | smp_wmb(); /* pairs with get_xol_area() */ | |
1071 | mm->uprobes_state.xol_area = area; | |
1072 | ret = 0; | |
1073 | ||
1074 | fail: | |
1075 | up_write(&mm->mmap_sem); | |
1076 | if (ret) | |
1077 | __free_page(area->page); | |
1078 | ||
1079 | return ret; | |
1080 | } | |
1081 | ||
1082 | static struct xol_area *get_xol_area(struct mm_struct *mm) | |
1083 | { | |
1084 | struct xol_area *area; | |
1085 | ||
1086 | area = mm->uprobes_state.xol_area; | |
1087 | smp_read_barrier_depends(); /* pairs with wmb in xol_add_vma() */ | |
1088 | ||
1089 | return area; | |
1090 | } | |
1091 | ||
1092 | /* | |
1093 | * xol_alloc_area - Allocate process's xol_area. | |
1094 | * This area will be used for storing instructions for execution out of | |
1095 | * line. | |
1096 | * | |
1097 | * Returns the allocated area or NULL. | |
1098 | */ | |
1099 | static struct xol_area *xol_alloc_area(void) | |
1100 | { | |
1101 | struct xol_area *area; | |
1102 | ||
1103 | area = kzalloc(sizeof(*area), GFP_KERNEL); | |
1104 | if (unlikely(!area)) | |
1105 | return NULL; | |
1106 | ||
1107 | area->bitmap = kzalloc(BITS_TO_LONGS(UINSNS_PER_PAGE) * sizeof(long), GFP_KERNEL); | |
1108 | ||
1109 | if (!area->bitmap) | |
1110 | goto fail; | |
1111 | ||
1112 | init_waitqueue_head(&area->wq); | |
1113 | if (!xol_add_vma(area)) | |
1114 | return area; | |
1115 | ||
1116 | fail: | |
1117 | kfree(area->bitmap); | |
1118 | kfree(area); | |
1119 | ||
1120 | return get_xol_area(current->mm); | |
1121 | } | |
1122 | ||
1123 | /* | |
1124 | * uprobe_clear_state - Free the area allocated for slots. | |
1125 | */ | |
1126 | void uprobe_clear_state(struct mm_struct *mm) | |
1127 | { | |
1128 | struct xol_area *area = mm->uprobes_state.xol_area; | |
1129 | ||
1130 | if (!area) | |
1131 | return; | |
1132 | ||
1133 | put_page(area->page); | |
1134 | kfree(area->bitmap); | |
1135 | kfree(area); | |
1136 | } | |
1137 | ||
32cdba1e ON |
1138 | void uprobe_start_dup_mmap(void) |
1139 | { | |
1140 | percpu_down_read(&dup_mmap_sem); | |
1141 | } | |
1142 | ||
1143 | void uprobe_end_dup_mmap(void) | |
1144 | { | |
1145 | percpu_up_read(&dup_mmap_sem); | |
1146 | } | |
1147 | ||
f8ac4ec9 ON |
1148 | void uprobe_dup_mmap(struct mm_struct *oldmm, struct mm_struct *newmm) |
1149 | { | |
61559a81 ON |
1150 | newmm->uprobes_state.xol_area = NULL; |
1151 | ||
9f68f672 | 1152 | if (test_bit(MMF_HAS_UPROBES, &oldmm->flags)) { |
f8ac4ec9 | 1153 | set_bit(MMF_HAS_UPROBES, &newmm->flags); |
9f68f672 ON |
1154 | /* unconditionally, dup_mmap() skips VM_DONTCOPY vmas */ |
1155 | set_bit(MMF_RECALC_UPROBES, &newmm->flags); | |
1156 | } | |
f8ac4ec9 ON |
1157 | } |
1158 | ||
d4b3b638 SD |
1159 | /* |
1160 | * - search for a free slot. | |
1161 | */ | |
1162 | static unsigned long xol_take_insn_slot(struct xol_area *area) | |
1163 | { | |
1164 | unsigned long slot_addr; | |
1165 | int slot_nr; | |
1166 | ||
1167 | do { | |
1168 | slot_nr = find_first_zero_bit(area->bitmap, UINSNS_PER_PAGE); | |
1169 | if (slot_nr < UINSNS_PER_PAGE) { | |
1170 | if (!test_and_set_bit(slot_nr, area->bitmap)) | |
1171 | break; | |
1172 | ||
1173 | slot_nr = UINSNS_PER_PAGE; | |
1174 | continue; | |
1175 | } | |
1176 | wait_event(area->wq, (atomic_read(&area->slot_count) < UINSNS_PER_PAGE)); | |
1177 | } while (slot_nr >= UINSNS_PER_PAGE); | |
1178 | ||
1179 | slot_addr = area->vaddr + (slot_nr * UPROBE_XOL_SLOT_BYTES); | |
1180 | atomic_inc(&area->slot_count); | |
1181 | ||
1182 | return slot_addr; | |
1183 | } | |
1184 | ||
1185 | /* | |
1186 | * xol_get_insn_slot - If was not allocated a slot, then | |
1187 | * allocate a slot. | |
1188 | * Returns the allocated slot address or 0. | |
1189 | */ | |
1190 | static unsigned long xol_get_insn_slot(struct uprobe *uprobe, unsigned long slot_addr) | |
1191 | { | |
1192 | struct xol_area *area; | |
1193 | unsigned long offset; | |
1194 | void *vaddr; | |
1195 | ||
1196 | area = get_xol_area(current->mm); | |
1197 | if (!area) { | |
1198 | area = xol_alloc_area(); | |
1199 | if (!area) | |
1200 | return 0; | |
1201 | } | |
1202 | current->utask->xol_vaddr = xol_take_insn_slot(area); | |
1203 | ||
1204 | /* | |
1205 | * Initialize the slot if xol_vaddr points to valid | |
1206 | * instruction slot. | |
1207 | */ | |
1208 | if (unlikely(!current->utask->xol_vaddr)) | |
1209 | return 0; | |
1210 | ||
1211 | current->utask->vaddr = slot_addr; | |
1212 | offset = current->utask->xol_vaddr & ~PAGE_MASK; | |
1213 | vaddr = kmap_atomic(area->page); | |
1214 | memcpy(vaddr + offset, uprobe->arch.insn, MAX_UINSN_BYTES); | |
1215 | kunmap_atomic(vaddr); | |
65b6ecc0 RV |
1216 | /* |
1217 | * We probably need flush_icache_user_range() but it needs vma. | |
1218 | * This should work on supported architectures too. | |
1219 | */ | |
1220 | flush_dcache_page(area->page); | |
d4b3b638 SD |
1221 | |
1222 | return current->utask->xol_vaddr; | |
1223 | } | |
1224 | ||
1225 | /* | |
1226 | * xol_free_insn_slot - If slot was earlier allocated by | |
1227 | * @xol_get_insn_slot(), make the slot available for | |
1228 | * subsequent requests. | |
1229 | */ | |
1230 | static void xol_free_insn_slot(struct task_struct *tsk) | |
1231 | { | |
1232 | struct xol_area *area; | |
1233 | unsigned long vma_end; | |
1234 | unsigned long slot_addr; | |
1235 | ||
1236 | if (!tsk->mm || !tsk->mm->uprobes_state.xol_area || !tsk->utask) | |
1237 | return; | |
1238 | ||
1239 | slot_addr = tsk->utask->xol_vaddr; | |
1240 | ||
1241 | if (unlikely(!slot_addr || IS_ERR_VALUE(slot_addr))) | |
1242 | return; | |
1243 | ||
1244 | area = tsk->mm->uprobes_state.xol_area; | |
1245 | vma_end = area->vaddr + PAGE_SIZE; | |
1246 | if (area->vaddr <= slot_addr && slot_addr < vma_end) { | |
1247 | unsigned long offset; | |
1248 | int slot_nr; | |
1249 | ||
1250 | offset = slot_addr - area->vaddr; | |
1251 | slot_nr = offset / UPROBE_XOL_SLOT_BYTES; | |
1252 | if (slot_nr >= UINSNS_PER_PAGE) | |
1253 | return; | |
1254 | ||
1255 | clear_bit(slot_nr, area->bitmap); | |
1256 | atomic_dec(&area->slot_count); | |
1257 | if (waitqueue_active(&area->wq)) | |
1258 | wake_up(&area->wq); | |
1259 | ||
1260 | tsk->utask->xol_vaddr = 0; | |
1261 | } | |
1262 | } | |
1263 | ||
0326f5a9 SD |
1264 | /** |
1265 | * uprobe_get_swbp_addr - compute address of swbp given post-swbp regs | |
1266 | * @regs: Reflects the saved state of the task after it has hit a breakpoint | |
1267 | * instruction. | |
1268 | * Return the address of the breakpoint instruction. | |
1269 | */ | |
1270 | unsigned long __weak uprobe_get_swbp_addr(struct pt_regs *regs) | |
1271 | { | |
1272 | return instruction_pointer(regs) - UPROBE_SWBP_INSN_SIZE; | |
1273 | } | |
1274 | ||
1275 | /* | |
1276 | * Called with no locks held. | |
1277 | * Called in context of a exiting or a exec-ing thread. | |
1278 | */ | |
1279 | void uprobe_free_utask(struct task_struct *t) | |
1280 | { | |
1281 | struct uprobe_task *utask = t->utask; | |
1282 | ||
0326f5a9 SD |
1283 | if (!utask) |
1284 | return; | |
1285 | ||
1286 | if (utask->active_uprobe) | |
1287 | put_uprobe(utask->active_uprobe); | |
1288 | ||
d4b3b638 | 1289 | xol_free_insn_slot(t); |
0326f5a9 SD |
1290 | kfree(utask); |
1291 | t->utask = NULL; | |
1292 | } | |
1293 | ||
1294 | /* | |
1295 | * Called in context of a new clone/fork from copy_process. | |
1296 | */ | |
1297 | void uprobe_copy_process(struct task_struct *t) | |
1298 | { | |
1299 | t->utask = NULL; | |
0326f5a9 SD |
1300 | } |
1301 | ||
1302 | /* | |
1303 | * Allocate a uprobe_task object for the task. | |
1304 | * Called when the thread hits a breakpoint for the first time. | |
1305 | * | |
1306 | * Returns: | |
1307 | * - pointer to new uprobe_task on success | |
1308 | * - NULL otherwise | |
1309 | */ | |
1310 | static struct uprobe_task *add_utask(void) | |
1311 | { | |
1312 | struct uprobe_task *utask; | |
1313 | ||
1314 | utask = kzalloc(sizeof *utask, GFP_KERNEL); | |
1315 | if (unlikely(!utask)) | |
1316 | return NULL; | |
1317 | ||
0326f5a9 SD |
1318 | current->utask = utask; |
1319 | return utask; | |
1320 | } | |
1321 | ||
1322 | /* Prepare to single-step probed instruction out of line. */ | |
1323 | static int | |
1324 | pre_ssout(struct uprobe *uprobe, struct pt_regs *regs, unsigned long vaddr) | |
1325 | { | |
d4b3b638 SD |
1326 | if (xol_get_insn_slot(uprobe, vaddr) && !arch_uprobe_pre_xol(&uprobe->arch, regs)) |
1327 | return 0; | |
1328 | ||
0326f5a9 SD |
1329 | return -EFAULT; |
1330 | } | |
1331 | ||
1332 | /* | |
1333 | * If we are singlestepping, then ensure this thread is not connected to | |
1334 | * non-fatal signals until completion of singlestep. When xol insn itself | |
1335 | * triggers the signal, restart the original insn even if the task is | |
1336 | * already SIGKILL'ed (since coredump should report the correct ip). This | |
1337 | * is even more important if the task has a handler for SIGSEGV/etc, The | |
1338 | * _same_ instruction should be repeated again after return from the signal | |
1339 | * handler, and SSTEP can never finish in this case. | |
1340 | */ | |
1341 | bool uprobe_deny_signal(void) | |
1342 | { | |
1343 | struct task_struct *t = current; | |
1344 | struct uprobe_task *utask = t->utask; | |
1345 | ||
1346 | if (likely(!utask || !utask->active_uprobe)) | |
1347 | return false; | |
1348 | ||
1349 | WARN_ON_ONCE(utask->state != UTASK_SSTEP); | |
1350 | ||
1351 | if (signal_pending(t)) { | |
1352 | spin_lock_irq(&t->sighand->siglock); | |
1353 | clear_tsk_thread_flag(t, TIF_SIGPENDING); | |
1354 | spin_unlock_irq(&t->sighand->siglock); | |
1355 | ||
1356 | if (__fatal_signal_pending(t) || arch_uprobe_xol_was_trapped(t)) { | |
1357 | utask->state = UTASK_SSTEP_TRAPPED; | |
1358 | set_tsk_thread_flag(t, TIF_UPROBE); | |
1359 | set_tsk_thread_flag(t, TIF_NOTIFY_RESUME); | |
1360 | } | |
1361 | } | |
1362 | ||
1363 | return true; | |
1364 | } | |
1365 | ||
1366 | /* | |
1367 | * Avoid singlestepping the original instruction if the original instruction | |
1368 | * is a NOP or can be emulated. | |
1369 | */ | |
1370 | static bool can_skip_sstep(struct uprobe *uprobe, struct pt_regs *regs) | |
1371 | { | |
71434f2f | 1372 | if (test_bit(UPROBE_SKIP_SSTEP, &uprobe->flags)) { |
0578a970 ON |
1373 | if (arch_uprobe_skip_sstep(&uprobe->arch, regs)) |
1374 | return true; | |
71434f2f | 1375 | clear_bit(UPROBE_SKIP_SSTEP, &uprobe->flags); |
0578a970 | 1376 | } |
0326f5a9 SD |
1377 | return false; |
1378 | } | |
1379 | ||
499a4f3e ON |
1380 | static void mmf_recalc_uprobes(struct mm_struct *mm) |
1381 | { | |
1382 | struct vm_area_struct *vma; | |
1383 | ||
1384 | for (vma = mm->mmap; vma; vma = vma->vm_next) { | |
1385 | if (!valid_vma(vma, false)) | |
1386 | continue; | |
1387 | /* | |
1388 | * This is not strictly accurate, we can race with | |
1389 | * uprobe_unregister() and see the already removed | |
1390 | * uprobe if delete_uprobe() was not yet called. | |
63633cbf | 1391 | * Or this uprobe can be filtered out. |
499a4f3e ON |
1392 | */ |
1393 | if (vma_has_uprobes(vma, vma->vm_start, vma->vm_end)) | |
1394 | return; | |
1395 | } | |
1396 | ||
1397 | clear_bit(MMF_HAS_UPROBES, &mm->flags); | |
1398 | } | |
1399 | ||
ec75fba9 ON |
1400 | static int is_swbp_at_addr(struct mm_struct *mm, unsigned long vaddr) |
1401 | { | |
1402 | struct page *page; | |
1403 | uprobe_opcode_t opcode; | |
1404 | int result; | |
1405 | ||
1406 | pagefault_disable(); | |
1407 | result = __copy_from_user_inatomic(&opcode, (void __user*)vaddr, | |
1408 | sizeof(opcode)); | |
1409 | pagefault_enable(); | |
1410 | ||
1411 | if (likely(result == 0)) | |
1412 | goto out; | |
1413 | ||
1414 | result = get_user_pages(NULL, mm, vaddr, 1, 0, 1, &page, NULL); | |
1415 | if (result < 0) | |
1416 | return result; | |
1417 | ||
1418 | copy_opcode(page, vaddr, &opcode); | |
1419 | put_page(page); | |
1420 | out: | |
1421 | return is_swbp_insn(&opcode); | |
1422 | } | |
1423 | ||
d790d346 | 1424 | static struct uprobe *find_active_uprobe(unsigned long bp_vaddr, int *is_swbp) |
0326f5a9 | 1425 | { |
3a9ea052 ON |
1426 | struct mm_struct *mm = current->mm; |
1427 | struct uprobe *uprobe = NULL; | |
0326f5a9 | 1428 | struct vm_area_struct *vma; |
0326f5a9 | 1429 | |
0326f5a9 SD |
1430 | down_read(&mm->mmap_sem); |
1431 | vma = find_vma(mm, bp_vaddr); | |
3a9ea052 ON |
1432 | if (vma && vma->vm_start <= bp_vaddr) { |
1433 | if (valid_vma(vma, false)) { | |
cb113b47 ON |
1434 | struct inode *inode = vma->vm_file->f_mapping->host; |
1435 | loff_t offset = vaddr_to_offset(vma, bp_vaddr); | |
0326f5a9 | 1436 | |
3a9ea052 ON |
1437 | uprobe = find_uprobe(inode, offset); |
1438 | } | |
d790d346 ON |
1439 | |
1440 | if (!uprobe) | |
1441 | *is_swbp = is_swbp_at_addr(mm, bp_vaddr); | |
1442 | } else { | |
1443 | *is_swbp = -EFAULT; | |
0326f5a9 | 1444 | } |
499a4f3e ON |
1445 | |
1446 | if (!uprobe && test_and_clear_bit(MMF_RECALC_UPROBES, &mm->flags)) | |
1447 | mmf_recalc_uprobes(mm); | |
0326f5a9 SD |
1448 | up_read(&mm->mmap_sem); |
1449 | ||
3a9ea052 ON |
1450 | return uprobe; |
1451 | } | |
1452 | ||
1453 | /* | |
1454 | * Run handler and ask thread to singlestep. | |
1455 | * Ensure all non-fatal signals cannot interrupt thread while it singlesteps. | |
1456 | */ | |
1457 | static void handle_swbp(struct pt_regs *regs) | |
1458 | { | |
1459 | struct uprobe_task *utask; | |
1460 | struct uprobe *uprobe; | |
1461 | unsigned long bp_vaddr; | |
56bb4cf6 | 1462 | int uninitialized_var(is_swbp); |
3a9ea052 ON |
1463 | |
1464 | bp_vaddr = uprobe_get_swbp_addr(regs); | |
d790d346 | 1465 | uprobe = find_active_uprobe(bp_vaddr, &is_swbp); |
3a9ea052 | 1466 | |
0326f5a9 | 1467 | if (!uprobe) { |
56bb4cf6 ON |
1468 | if (is_swbp > 0) { |
1469 | /* No matching uprobe; signal SIGTRAP. */ | |
1470 | send_sig(SIGTRAP, current, 0); | |
1471 | } else { | |
1472 | /* | |
1473 | * Either we raced with uprobe_unregister() or we can't | |
1474 | * access this memory. The latter is only possible if | |
1475 | * another thread plays with our ->mm. In both cases | |
1476 | * we can simply restart. If this vma was unmapped we | |
1477 | * can pretend this insn was not executed yet and get | |
1478 | * the (correct) SIGSEGV after restart. | |
1479 | */ | |
1480 | instruction_pointer_set(regs, bp_vaddr); | |
1481 | } | |
0326f5a9 SD |
1482 | return; |
1483 | } | |
142b18dd ON |
1484 | /* |
1485 | * TODO: move copy_insn/etc into _register and remove this hack. | |
1486 | * After we hit the bp, _unregister + _register can install the | |
1487 | * new and not-yet-analyzed uprobe at the same address, restart. | |
1488 | */ | |
1489 | smp_rmb(); /* pairs with wmb() in install_breakpoint() */ | |
71434f2f | 1490 | if (unlikely(!test_bit(UPROBE_COPY_INSN, &uprobe->flags))) |
142b18dd | 1491 | goto restart; |
0326f5a9 SD |
1492 | |
1493 | utask = current->utask; | |
1494 | if (!utask) { | |
1495 | utask = add_utask(); | |
1496 | /* Cannot allocate; re-execute the instruction. */ | |
1497 | if (!utask) | |
0578a970 | 1498 | goto restart; |
0326f5a9 | 1499 | } |
746a9e6b | 1500 | |
0326f5a9 | 1501 | handler_chain(uprobe, regs); |
0578a970 ON |
1502 | if (can_skip_sstep(uprobe, regs)) |
1503 | goto out; | |
0326f5a9 | 1504 | |
0326f5a9 | 1505 | if (!pre_ssout(uprobe, regs, bp_vaddr)) { |
746a9e6b ON |
1506 | utask->active_uprobe = uprobe; |
1507 | utask->state = UTASK_SSTEP; | |
0326f5a9 SD |
1508 | return; |
1509 | } | |
1510 | ||
0578a970 ON |
1511 | restart: |
1512 | /* | |
1513 | * cannot singlestep; cannot skip instruction; | |
1514 | * re-execute the instruction. | |
1515 | */ | |
1516 | instruction_pointer_set(regs, bp_vaddr); | |
1517 | out: | |
8bd87445 | 1518 | put_uprobe(uprobe); |
0326f5a9 SD |
1519 | } |
1520 | ||
1521 | /* | |
1522 | * Perform required fix-ups and disable singlestep. | |
1523 | * Allow pending signals to take effect. | |
1524 | */ | |
1525 | static void handle_singlestep(struct uprobe_task *utask, struct pt_regs *regs) | |
1526 | { | |
1527 | struct uprobe *uprobe; | |
1528 | ||
1529 | uprobe = utask->active_uprobe; | |
1530 | if (utask->state == UTASK_SSTEP_ACK) | |
1531 | arch_uprobe_post_xol(&uprobe->arch, regs); | |
1532 | else if (utask->state == UTASK_SSTEP_TRAPPED) | |
1533 | arch_uprobe_abort_xol(&uprobe->arch, regs); | |
1534 | else | |
1535 | WARN_ON_ONCE(1); | |
1536 | ||
1537 | put_uprobe(uprobe); | |
1538 | utask->active_uprobe = NULL; | |
1539 | utask->state = UTASK_RUNNING; | |
d4b3b638 | 1540 | xol_free_insn_slot(current); |
0326f5a9 SD |
1541 | |
1542 | spin_lock_irq(¤t->sighand->siglock); | |
1543 | recalc_sigpending(); /* see uprobe_deny_signal() */ | |
1544 | spin_unlock_irq(¤t->sighand->siglock); | |
1545 | } | |
1546 | ||
1547 | /* | |
1b08e907 ON |
1548 | * On breakpoint hit, breakpoint notifier sets the TIF_UPROBE flag and |
1549 | * allows the thread to return from interrupt. After that handle_swbp() | |
1550 | * sets utask->active_uprobe. | |
0326f5a9 | 1551 | * |
1b08e907 ON |
1552 | * On singlestep exception, singlestep notifier sets the TIF_UPROBE flag |
1553 | * and allows the thread to return from interrupt. | |
0326f5a9 SD |
1554 | * |
1555 | * While returning to userspace, thread notices the TIF_UPROBE flag and calls | |
1556 | * uprobe_notify_resume(). | |
1557 | */ | |
1558 | void uprobe_notify_resume(struct pt_regs *regs) | |
1559 | { | |
1560 | struct uprobe_task *utask; | |
1561 | ||
db023ea5 ON |
1562 | clear_thread_flag(TIF_UPROBE); |
1563 | ||
0326f5a9 | 1564 | utask = current->utask; |
1b08e907 | 1565 | if (utask && utask->active_uprobe) |
0326f5a9 | 1566 | handle_singlestep(utask, regs); |
1b08e907 ON |
1567 | else |
1568 | handle_swbp(regs); | |
0326f5a9 SD |
1569 | } |
1570 | ||
1571 | /* | |
1572 | * uprobe_pre_sstep_notifier gets called from interrupt context as part of | |
1573 | * notifier mechanism. Set TIF_UPROBE flag and indicate breakpoint hit. | |
1574 | */ | |
1575 | int uprobe_pre_sstep_notifier(struct pt_regs *regs) | |
1576 | { | |
f8ac4ec9 | 1577 | if (!current->mm || !test_bit(MMF_HAS_UPROBES, ¤t->mm->flags)) |
0326f5a9 SD |
1578 | return 0; |
1579 | ||
0326f5a9 | 1580 | set_thread_flag(TIF_UPROBE); |
0326f5a9 SD |
1581 | return 1; |
1582 | } | |
1583 | ||
1584 | /* | |
1585 | * uprobe_post_sstep_notifier gets called in interrupt context as part of notifier | |
1586 | * mechanism. Set TIF_UPROBE flag and indicate completion of singlestep. | |
1587 | */ | |
1588 | int uprobe_post_sstep_notifier(struct pt_regs *regs) | |
1589 | { | |
1590 | struct uprobe_task *utask = current->utask; | |
1591 | ||
1592 | if (!current->mm || !utask || !utask->active_uprobe) | |
1593 | /* task is currently not uprobed */ | |
1594 | return 0; | |
1595 | ||
1596 | utask->state = UTASK_SSTEP_ACK; | |
1597 | set_thread_flag(TIF_UPROBE); | |
1598 | return 1; | |
1599 | } | |
1600 | ||
1601 | static struct notifier_block uprobe_exception_nb = { | |
1602 | .notifier_call = arch_uprobe_exception_notify, | |
1603 | .priority = INT_MAX-1, /* notified after kprobes, kgdb */ | |
1604 | }; | |
1605 | ||
2b144498 SD |
1606 | static int __init init_uprobes(void) |
1607 | { | |
1608 | int i; | |
1609 | ||
1610 | for (i = 0; i < UPROBES_HASH_SZ; i++) { | |
1611 | mutex_init(&uprobes_mutex[i]); | |
1612 | mutex_init(&uprobes_mmap_mutex[i]); | |
1613 | } | |
0326f5a9 | 1614 | |
32cdba1e ON |
1615 | if (percpu_init_rwsem(&dup_mmap_sem)) |
1616 | return -ENOMEM; | |
1617 | ||
0326f5a9 | 1618 | return register_die_notifier(&uprobe_exception_nb); |
2b144498 | 1619 | } |
0326f5a9 | 1620 | module_init(init_uprobes); |
2b144498 SD |
1621 | |
1622 | static void __exit exit_uprobes(void) | |
1623 | { | |
1624 | } | |
2b144498 | 1625 | module_exit(exit_uprobes); |