Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /** |
2 | * @file buffer_sync.c | |
3 | * | |
ae735e99 | 4 | * @remark Copyright 2002-2009 OProfile authors |
1da177e4 LT |
5 | * @remark Read the file COPYING |
6 | * | |
7 | * @author John Levon <levon@movementarian.org> | |
345c2573 | 8 | * @author Barry Kasindorf |
ae735e99 | 9 | * @author Robert Richter <robert.richter@amd.com> |
1da177e4 LT |
10 | * |
11 | * This is the core of the buffer management. Each | |
12 | * CPU buffer is processed and entered into the | |
13 | * global event buffer. Such processing is necessary | |
14 | * in several circumstances, mentioned below. | |
15 | * | |
16 | * The processing does the job of converting the | |
17 | * transitory EIP value into a persistent dentry/offset | |
18 | * value that the profiler can record at its leisure. | |
19 | * | |
20 | * See fs/dcookies.c for a description of the dentry/offset | |
21 | * objects. | |
22 | */ | |
23 | ||
11163348 | 24 | #include <linux/file.h> |
1da177e4 LT |
25 | #include <linux/mm.h> |
26 | #include <linux/workqueue.h> | |
27 | #include <linux/notifier.h> | |
28 | #include <linux/dcookies.h> | |
29 | #include <linux/profile.h> | |
30 | #include <linux/module.h> | |
31 | #include <linux/fs.h> | |
1474855d | 32 | #include <linux/oprofile.h> |
e8edc6e0 | 33 | #include <linux/sched.h> |
5a0e3ad6 | 34 | #include <linux/gfp.h> |
1474855d | 35 | |
1da177e4 LT |
36 | #include "oprofile_stats.h" |
37 | #include "event_buffer.h" | |
38 | #include "cpu_buffer.h" | |
39 | #include "buffer_sync.h" | |
73185e0a | 40 | |
1da177e4 LT |
41 | static LIST_HEAD(dying_tasks); |
42 | static LIST_HEAD(dead_tasks); | |
f7df8ed1 | 43 | static cpumask_var_t marked_cpus; |
1da177e4 LT |
44 | static DEFINE_SPINLOCK(task_mortuary); |
45 | static void process_task_mortuary(void); | |
46 | ||
1da177e4 LT |
47 | /* Take ownership of the task struct and place it on the |
48 | * list for processing. Only after two full buffer syncs | |
49 | * does the task eventually get freed, because by then | |
50 | * we are sure we will not reference it again. | |
4369ef3c PM |
51 | * Can be invoked from softirq via RCU callback due to |
52 | * call_rcu() of the task struct, hence the _irqsave. | |
1da177e4 | 53 | */ |
73185e0a RR |
54 | static int |
55 | task_free_notify(struct notifier_block *self, unsigned long val, void *data) | |
1da177e4 | 56 | { |
4369ef3c | 57 | unsigned long flags; |
73185e0a | 58 | struct task_struct *task = data; |
4369ef3c | 59 | spin_lock_irqsave(&task_mortuary, flags); |
1da177e4 | 60 | list_add(&task->tasks, &dying_tasks); |
4369ef3c | 61 | spin_unlock_irqrestore(&task_mortuary, flags); |
1da177e4 LT |
62 | return NOTIFY_OK; |
63 | } | |
64 | ||
65 | ||
66 | /* The task is on its way out. A sync of the buffer means we can catch | |
67 | * any remaining samples for this task. | |
68 | */ | |
73185e0a RR |
69 | static int |
70 | task_exit_notify(struct notifier_block *self, unsigned long val, void *data) | |
1da177e4 LT |
71 | { |
72 | /* To avoid latency problems, we only process the current CPU, | |
73 | * hoping that most samples for the task are on this CPU | |
74 | */ | |
39c715b7 | 75 | sync_buffer(raw_smp_processor_id()); |
73185e0a | 76 | return 0; |
1da177e4 LT |
77 | } |
78 | ||
79 | ||
80 | /* The task is about to try a do_munmap(). We peek at what it's going to | |
81 | * do, and if it's an executable region, process the samples first, so | |
82 | * we don't lose any. This does not have to be exact, it's a QoI issue | |
83 | * only. | |
84 | */ | |
73185e0a RR |
85 | static int |
86 | munmap_notify(struct notifier_block *self, unsigned long val, void *data) | |
1da177e4 LT |
87 | { |
88 | unsigned long addr = (unsigned long)data; | |
73185e0a RR |
89 | struct mm_struct *mm = current->mm; |
90 | struct vm_area_struct *mpnt; | |
1da177e4 LT |
91 | |
92 | down_read(&mm->mmap_sem); | |
93 | ||
94 | mpnt = find_vma(mm, addr); | |
95 | if (mpnt && mpnt->vm_file && (mpnt->vm_flags & VM_EXEC)) { | |
96 | up_read(&mm->mmap_sem); | |
97 | /* To avoid latency problems, we only process the current CPU, | |
98 | * hoping that most samples for the task are on this CPU | |
99 | */ | |
39c715b7 | 100 | sync_buffer(raw_smp_processor_id()); |
1da177e4 LT |
101 | return 0; |
102 | } | |
103 | ||
104 | up_read(&mm->mmap_sem); | |
105 | return 0; | |
106 | } | |
107 | ||
73185e0a | 108 | |
1da177e4 LT |
109 | /* We need to be told about new modules so we don't attribute to a previously |
110 | * loaded module, or drop the samples on the floor. | |
111 | */ | |
73185e0a RR |
112 | static int |
113 | module_load_notify(struct notifier_block *self, unsigned long val, void *data) | |
1da177e4 LT |
114 | { |
115 | #ifdef CONFIG_MODULES | |
116 | if (val != MODULE_STATE_COMING) | |
117 | return 0; | |
118 | ||
119 | /* FIXME: should we process all CPU buffers ? */ | |
59cc185a | 120 | mutex_lock(&buffer_mutex); |
1da177e4 LT |
121 | add_event_entry(ESCAPE_CODE); |
122 | add_event_entry(MODULE_LOADED_CODE); | |
59cc185a | 123 | mutex_unlock(&buffer_mutex); |
1da177e4 LT |
124 | #endif |
125 | return 0; | |
126 | } | |
127 | ||
73185e0a | 128 | |
1da177e4 LT |
129 | static struct notifier_block task_free_nb = { |
130 | .notifier_call = task_free_notify, | |
131 | }; | |
132 | ||
133 | static struct notifier_block task_exit_nb = { | |
134 | .notifier_call = task_exit_notify, | |
135 | }; | |
136 | ||
137 | static struct notifier_block munmap_nb = { | |
138 | .notifier_call = munmap_notify, | |
139 | }; | |
140 | ||
141 | static struct notifier_block module_load_nb = { | |
142 | .notifier_call = module_load_notify, | |
143 | }; | |
144 | ||
6ac6519b RR |
145 | static void free_all_tasks(void) |
146 | { | |
147 | /* make sure we don't leak task structs */ | |
148 | process_task_mortuary(); | |
149 | process_task_mortuary(); | |
150 | } | |
151 | ||
1da177e4 LT |
152 | int sync_start(void) |
153 | { | |
154 | int err; | |
155 | ||
79f55997 | 156 | if (!zalloc_cpumask_var(&marked_cpus, GFP_KERNEL)) |
4c50d9ea | 157 | return -ENOMEM; |
4c50d9ea | 158 | |
1da177e4 LT |
159 | err = task_handoff_register(&task_free_nb); |
160 | if (err) | |
161 | goto out1; | |
162 | err = profile_event_register(PROFILE_TASK_EXIT, &task_exit_nb); | |
163 | if (err) | |
164 | goto out2; | |
165 | err = profile_event_register(PROFILE_MUNMAP, &munmap_nb); | |
166 | if (err) | |
167 | goto out3; | |
168 | err = register_module_notifier(&module_load_nb); | |
169 | if (err) | |
170 | goto out4; | |
171 | ||
750d857c RR |
172 | start_cpu_work(); |
173 | ||
1da177e4 LT |
174 | out: |
175 | return err; | |
176 | out4: | |
177 | profile_event_unregister(PROFILE_MUNMAP, &munmap_nb); | |
178 | out3: | |
179 | profile_event_unregister(PROFILE_TASK_EXIT, &task_exit_nb); | |
180 | out2: | |
181 | task_handoff_unregister(&task_free_nb); | |
6ac6519b | 182 | free_all_tasks(); |
1da177e4 | 183 | out1: |
4c50d9ea | 184 | free_cpumask_var(marked_cpus); |
1da177e4 LT |
185 | goto out; |
186 | } | |
187 | ||
188 | ||
189 | void sync_stop(void) | |
190 | { | |
750d857c | 191 | end_cpu_work(); |
1da177e4 LT |
192 | unregister_module_notifier(&module_load_nb); |
193 | profile_event_unregister(PROFILE_MUNMAP, &munmap_nb); | |
194 | profile_event_unregister(PROFILE_TASK_EXIT, &task_exit_nb); | |
195 | task_handoff_unregister(&task_free_nb); | |
130c5ce7 RR |
196 | barrier(); /* do all of the above first */ |
197 | ||
3d7851b3 | 198 | flush_cpu_work(); |
750d857c | 199 | |
6ac6519b | 200 | free_all_tasks(); |
4c50d9ea | 201 | free_cpumask_var(marked_cpus); |
1da177e4 LT |
202 | } |
203 | ||
448678a0 | 204 | |
1da177e4 LT |
205 | /* Optimisation. We can manage without taking the dcookie sem |
206 | * because we cannot reach this code without at least one | |
207 | * dcookie user still being registered (namely, the reader | |
208 | * of the event buffer). */ | |
448678a0 | 209 | static inline unsigned long fast_get_dcookie(struct path *path) |
1da177e4 LT |
210 | { |
211 | unsigned long cookie; | |
448678a0 | 212 | |
c2452f32 | 213 | if (path->dentry->d_flags & DCACHE_COOKIE) |
448678a0 JB |
214 | return (unsigned long)path->dentry; |
215 | get_dcookie(path, &cookie); | |
1da177e4 LT |
216 | return cookie; |
217 | } | |
218 | ||
448678a0 | 219 | |
2dd8ad81 | 220 | /* Look up the dcookie for the task's mm->exe_file, |
1da177e4 LT |
221 | * which corresponds loosely to "application name". This is |
222 | * not strictly necessary but allows oprofile to associate | |
223 | * shared-library samples with particular applications | |
224 | */ | |
73185e0a | 225 | static unsigned long get_exec_dcookie(struct mm_struct *mm) |
1da177e4 | 226 | { |
0c0a400d | 227 | unsigned long cookie = NO_COOKIE; |
11163348 | 228 | struct file *exe_file; |
73185e0a | 229 | |
11163348 DB |
230 | if (!mm) |
231 | goto done; | |
232 | ||
233 | exe_file = get_mm_exe_file(mm); | |
234 | if (!exe_file) | |
235 | goto done; | |
1da177e4 | 236 | |
11163348 DB |
237 | cookie = fast_get_dcookie(&exe_file->f_path); |
238 | fput(exe_file); | |
239 | done: | |
1da177e4 LT |
240 | return cookie; |
241 | } | |
242 | ||
243 | ||
244 | /* Convert the EIP value of a sample into a persistent dentry/offset | |
245 | * pair that can then be added to the global event buffer. We make | |
246 | * sure to do this lookup before a mm->mmap modification happens so | |
247 | * we don't lose track. | |
11163348 DB |
248 | * |
249 | * The caller must ensure the mm is not nil (ie: not a kernel thread). | |
1da177e4 | 250 | */ |
73185e0a RR |
251 | static unsigned long |
252 | lookup_dcookie(struct mm_struct *mm, unsigned long addr, off_t *offset) | |
1da177e4 | 253 | { |
0c0a400d | 254 | unsigned long cookie = NO_COOKIE; |
73185e0a | 255 | struct vm_area_struct *vma; |
1da177e4 | 256 | |
11163348 | 257 | down_read(&mm->mmap_sem); |
1da177e4 | 258 | for (vma = find_vma(mm, addr); vma; vma = vma->vm_next) { |
73185e0a | 259 | |
1da177e4 LT |
260 | if (addr < vma->vm_start || addr >= vma->vm_end) |
261 | continue; | |
262 | ||
0c0a400d | 263 | if (vma->vm_file) { |
448678a0 | 264 | cookie = fast_get_dcookie(&vma->vm_file->f_path); |
0c0a400d JL |
265 | *offset = (vma->vm_pgoff << PAGE_SHIFT) + addr - |
266 | vma->vm_start; | |
267 | } else { | |
268 | /* must be an anonymous map */ | |
269 | *offset = addr; | |
270 | } | |
271 | ||
1da177e4 LT |
272 | break; |
273 | } | |
274 | ||
0c0a400d JL |
275 | if (!vma) |
276 | cookie = INVALID_COOKIE; | |
11163348 | 277 | up_read(&mm->mmap_sem); |
0c0a400d | 278 | |
1da177e4 LT |
279 | return cookie; |
280 | } | |
281 | ||
0c0a400d | 282 | static unsigned long last_cookie = INVALID_COOKIE; |
73185e0a | 283 | |
1da177e4 LT |
284 | static void add_cpu_switch(int i) |
285 | { | |
286 | add_event_entry(ESCAPE_CODE); | |
287 | add_event_entry(CPU_SWITCH_CODE); | |
288 | add_event_entry(i); | |
0c0a400d | 289 | last_cookie = INVALID_COOKIE; |
1da177e4 LT |
290 | } |
291 | ||
292 | static void add_kernel_ctx_switch(unsigned int in_kernel) | |
293 | { | |
294 | add_event_entry(ESCAPE_CODE); | |
295 | if (in_kernel) | |
73185e0a | 296 | add_event_entry(KERNEL_ENTER_SWITCH_CODE); |
1da177e4 | 297 | else |
73185e0a | 298 | add_event_entry(KERNEL_EXIT_SWITCH_CODE); |
1da177e4 | 299 | } |
73185e0a | 300 | |
1da177e4 | 301 | static void |
73185e0a | 302 | add_user_ctx_switch(struct task_struct const *task, unsigned long cookie) |
1da177e4 LT |
303 | { |
304 | add_event_entry(ESCAPE_CODE); | |
73185e0a | 305 | add_event_entry(CTX_SWITCH_CODE); |
1da177e4 LT |
306 | add_event_entry(task->pid); |
307 | add_event_entry(cookie); | |
308 | /* Another code for daemon back-compat */ | |
309 | add_event_entry(ESCAPE_CODE); | |
310 | add_event_entry(CTX_TGID_CODE); | |
311 | add_event_entry(task->tgid); | |
312 | } | |
313 | ||
73185e0a | 314 | |
1da177e4 LT |
315 | static void add_cookie_switch(unsigned long cookie) |
316 | { | |
317 | add_event_entry(ESCAPE_CODE); | |
318 | add_event_entry(COOKIE_SWITCH_CODE); | |
319 | add_event_entry(cookie); | |
320 | } | |
321 | ||
73185e0a | 322 | |
1da177e4 LT |
323 | static void add_trace_begin(void) |
324 | { | |
325 | add_event_entry(ESCAPE_CODE); | |
326 | add_event_entry(TRACE_BEGIN_CODE); | |
327 | } | |
328 | ||
1acda878 | 329 | static void add_data(struct op_entry *entry, struct mm_struct *mm) |
345c2573 | 330 | { |
1acda878 RR |
331 | unsigned long code, pc, val; |
332 | unsigned long cookie; | |
345c2573 | 333 | off_t offset; |
345c2573 | 334 | |
1acda878 RR |
335 | if (!op_cpu_buffer_get_data(entry, &code)) |
336 | return; | |
337 | if (!op_cpu_buffer_get_data(entry, &pc)) | |
338 | return; | |
339 | if (!op_cpu_buffer_get_size(entry)) | |
dbe6e283 | 340 | return; |
345c2573 BK |
341 | |
342 | if (mm) { | |
d358e75f | 343 | cookie = lookup_dcookie(mm, pc, &offset); |
345c2573 | 344 | |
d358e75f RR |
345 | if (cookie == NO_COOKIE) |
346 | offset = pc; | |
347 | if (cookie == INVALID_COOKIE) { | |
345c2573 | 348 | atomic_inc(&oprofile_stats.sample_lost_no_mapping); |
d358e75f | 349 | offset = pc; |
345c2573 | 350 | } |
d358e75f RR |
351 | if (cookie != last_cookie) { |
352 | add_cookie_switch(cookie); | |
353 | last_cookie = cookie; | |
345c2573 BK |
354 | } |
355 | } else | |
d358e75f | 356 | offset = pc; |
345c2573 BK |
357 | |
358 | add_event_entry(ESCAPE_CODE); | |
359 | add_event_entry(code); | |
360 | add_event_entry(offset); /* Offset from Dcookie */ | |
361 | ||
1acda878 RR |
362 | while (op_cpu_buffer_get_data(entry, &val)) |
363 | add_event_entry(val); | |
345c2573 | 364 | } |
1da177e4 | 365 | |
6368a1f4 | 366 | static inline void add_sample_entry(unsigned long offset, unsigned long event) |
1da177e4 LT |
367 | { |
368 | add_event_entry(offset); | |
369 | add_event_entry(event); | |
370 | } | |
371 | ||
372 | ||
9741b309 RR |
373 | /* |
374 | * Add a sample to the global event buffer. If possible the | |
375 | * sample is converted into a persistent dentry/offset pair | |
376 | * for later lookup from userspace. Return 0 on failure. | |
377 | */ | |
378 | static int | |
379 | add_sample(struct mm_struct *mm, struct op_sample *s, int in_kernel) | |
1da177e4 LT |
380 | { |
381 | unsigned long cookie; | |
382 | off_t offset; | |
73185e0a | 383 | |
9741b309 RR |
384 | if (in_kernel) { |
385 | add_sample_entry(s->eip, s->event); | |
386 | return 1; | |
387 | } | |
388 | ||
389 | /* add userspace sample */ | |
390 | ||
391 | if (!mm) { | |
392 | atomic_inc(&oprofile_stats.sample_lost_no_mm); | |
393 | return 0; | |
394 | } | |
395 | ||
73185e0a RR |
396 | cookie = lookup_dcookie(mm, s->eip, &offset); |
397 | ||
0c0a400d | 398 | if (cookie == INVALID_COOKIE) { |
1da177e4 LT |
399 | atomic_inc(&oprofile_stats.sample_lost_no_mapping); |
400 | return 0; | |
401 | } | |
402 | ||
403 | if (cookie != last_cookie) { | |
404 | add_cookie_switch(cookie); | |
405 | last_cookie = cookie; | |
406 | } | |
407 | ||
408 | add_sample_entry(offset, s->event); | |
409 | ||
410 | return 1; | |
411 | } | |
412 | ||
73185e0a | 413 | |
73185e0a | 414 | static void release_mm(struct mm_struct *mm) |
1da177e4 LT |
415 | { |
416 | if (!mm) | |
417 | return; | |
1da177e4 LT |
418 | mmput(mm); |
419 | } | |
420 | ||
1da177e4 LT |
421 | static inline int is_code(unsigned long val) |
422 | { | |
423 | return val == ESCAPE_CODE; | |
424 | } | |
73185e0a | 425 | |
1da177e4 | 426 | |
1da177e4 LT |
427 | /* Move tasks along towards death. Any tasks on dead_tasks |
428 | * will definitely have no remaining references in any | |
429 | * CPU buffers at this point, because we use two lists, | |
430 | * and to have reached the list, it must have gone through | |
431 | * one full sync already. | |
432 | */ | |
433 | static void process_task_mortuary(void) | |
434 | { | |
4369ef3c PM |
435 | unsigned long flags; |
436 | LIST_HEAD(local_dead_tasks); | |
73185e0a RR |
437 | struct task_struct *task; |
438 | struct task_struct *ttask; | |
1da177e4 | 439 | |
4369ef3c | 440 | spin_lock_irqsave(&task_mortuary, flags); |
1da177e4 | 441 | |
4369ef3c PM |
442 | list_splice_init(&dead_tasks, &local_dead_tasks); |
443 | list_splice_init(&dying_tasks, &dead_tasks); | |
1da177e4 | 444 | |
4369ef3c PM |
445 | spin_unlock_irqrestore(&task_mortuary, flags); |
446 | ||
447 | list_for_each_entry_safe(task, ttask, &local_dead_tasks, tasks) { | |
1da177e4 | 448 | list_del(&task->tasks); |
4369ef3c | 449 | free_task(task); |
1da177e4 | 450 | } |
1da177e4 LT |
451 | } |
452 | ||
453 | ||
454 | static void mark_done(int cpu) | |
455 | { | |
456 | int i; | |
457 | ||
f7df8ed1 | 458 | cpumask_set_cpu(cpu, marked_cpus); |
1da177e4 LT |
459 | |
460 | for_each_online_cpu(i) { | |
f7df8ed1 | 461 | if (!cpumask_test_cpu(i, marked_cpus)) |
1da177e4 LT |
462 | return; |
463 | } | |
464 | ||
465 | /* All CPUs have been processed at least once, | |
466 | * we can process the mortuary once | |
467 | */ | |
468 | process_task_mortuary(); | |
469 | ||
f7df8ed1 | 470 | cpumask_clear(marked_cpus); |
1da177e4 LT |
471 | } |
472 | ||
473 | ||
474 | /* FIXME: this is not sufficient if we implement syscall barrier backtrace | |
475 | * traversal, the code switch to sb_sample_start at first kernel enter/exit | |
476 | * switch so we need a fifth state and some special handling in sync_buffer() | |
477 | */ | |
478 | typedef enum { | |
479 | sb_bt_ignore = -2, | |
480 | sb_buffer_start, | |
481 | sb_bt_start, | |
482 | sb_sample_start, | |
483 | } sync_buffer_state; | |
484 | ||
485 | /* Sync one of the CPU's buffers into the global event buffer. | |
486 | * Here we need to go through each batch of samples punctuated | |
487 | * by context switch notes, taking the task's mmap_sem and doing | |
488 | * lookup in task->mm->mmap to convert EIP into dcookie/offset | |
489 | * value. | |
490 | */ | |
491 | void sync_buffer(int cpu) | |
492 | { | |
1da177e4 | 493 | struct mm_struct *mm = NULL; |
fd7826d5 | 494 | struct mm_struct *oldmm; |
bd7dc46f | 495 | unsigned long val; |
73185e0a | 496 | struct task_struct *new; |
1da177e4 LT |
497 | unsigned long cookie = 0; |
498 | int in_kernel = 1; | |
1da177e4 | 499 | sync_buffer_state state = sb_buffer_start; |
9b1f2611 | 500 | unsigned int i; |
1da177e4 | 501 | unsigned long available; |
ae735e99 | 502 | unsigned long flags; |
2d87b14c RR |
503 | struct op_entry entry; |
504 | struct op_sample *sample; | |
1da177e4 | 505 | |
59cc185a | 506 | mutex_lock(&buffer_mutex); |
73185e0a | 507 | |
1da177e4 LT |
508 | add_cpu_switch(cpu); |
509 | ||
6d2c53f3 RR |
510 | op_cpu_buffer_reset(cpu); |
511 | available = op_cpu_buffer_entries(cpu); | |
1da177e4 LT |
512 | |
513 | for (i = 0; i < available; ++i) { | |
2d87b14c RR |
514 | sample = op_cpu_buffer_read_entry(&entry, cpu); |
515 | if (!sample) | |
6dad828b | 516 | break; |
73185e0a | 517 | |
2d87b14c | 518 | if (is_code(sample->eip)) { |
ae735e99 RR |
519 | flags = sample->event; |
520 | if (flags & TRACE_BEGIN) { | |
521 | state = sb_bt_start; | |
522 | add_trace_begin(); | |
523 | } | |
524 | if (flags & KERNEL_CTX_SWITCH) { | |
1da177e4 | 525 | /* kernel/userspace switch */ |
ae735e99 | 526 | in_kernel = flags & IS_KERNEL; |
1da177e4 LT |
527 | if (state == sb_buffer_start) |
528 | state = sb_sample_start; | |
ae735e99 RR |
529 | add_kernel_ctx_switch(flags & IS_KERNEL); |
530 | } | |
bd7dc46f RR |
531 | if (flags & USER_CTX_SWITCH |
532 | && op_cpu_buffer_get_data(&entry, &val)) { | |
1da177e4 | 533 | /* userspace context switch */ |
bd7dc46f | 534 | new = (struct task_struct *)val; |
fd7826d5 | 535 | oldmm = mm; |
1da177e4 | 536 | release_mm(oldmm); |
11163348 | 537 | mm = get_task_mm(new); |
1da177e4 LT |
538 | if (mm != oldmm) |
539 | cookie = get_exec_dcookie(mm); | |
540 | add_user_ctx_switch(new, cookie); | |
1da177e4 | 541 | } |
1acda878 RR |
542 | if (op_cpu_buffer_get_size(&entry)) |
543 | add_data(&entry, mm); | |
317f33bc RR |
544 | continue; |
545 | } | |
546 | ||
547 | if (state < sb_bt_start) | |
548 | /* ignore sample */ | |
549 | continue; | |
550 | ||
2d87b14c | 551 | if (add_sample(mm, sample, in_kernel)) |
317f33bc RR |
552 | continue; |
553 | ||
554 | /* ignore backtraces if failed to add a sample */ | |
555 | if (state == sb_bt_start) { | |
556 | state = sb_bt_ignore; | |
557 | atomic_inc(&oprofile_stats.bt_lost_no_mapping); | |
1da177e4 | 558 | } |
1da177e4 LT |
559 | } |
560 | release_mm(mm); | |
561 | ||
562 | mark_done(cpu); | |
563 | ||
59cc185a | 564 | mutex_unlock(&buffer_mutex); |
1da177e4 | 565 | } |
a5598ca0 CL |
566 | |
567 | /* The function can be used to add a buffer worth of data directly to | |
568 | * the kernel buffer. The buffer is assumed to be a circular buffer. | |
569 | * Take the entries from index start and end at index end, wrapping | |
570 | * at max_entries. | |
571 | */ | |
572 | void oprofile_put_buff(unsigned long *buf, unsigned int start, | |
573 | unsigned int stop, unsigned int max) | |
574 | { | |
575 | int i; | |
576 | ||
577 | i = start; | |
578 | ||
579 | mutex_lock(&buffer_mutex); | |
580 | while (i != stop) { | |
581 | add_event_entry(buf[i++]); | |
582 | ||
583 | if (i >= max) | |
584 | i = 0; | |
585 | } | |
586 | ||
587 | mutex_unlock(&buffer_mutex); | |
588 | } | |
589 |