Commit | Line | Data |
---|---|---|
76369139 FW |
1 | /* |
2 | * Performance events ring-buffer code: | |
3 | * | |
4 | * Copyright (C) 2008 Thomas Gleixner <tglx@linutronix.de> | |
5 | * Copyright (C) 2008-2011 Red Hat, Inc., Ingo Molnar | |
90eec103 | 6 | * Copyright (C) 2008-2011 Red Hat, Inc., Peter Zijlstra |
d36b6910 | 7 | * Copyright © 2009 Paul Mackerras, IBM Corp. <paulus@au1.ibm.com> |
76369139 FW |
8 | * |
9 | * For licensing details see kernel-base/COPYING | |
10 | */ | |
11 | ||
12 | #include <linux/perf_event.h> | |
13 | #include <linux/vmalloc.h> | |
14 | #include <linux/slab.h> | |
26c86da8 | 15 | #include <linux/circ_buf.h> |
7c60fc0e | 16 | #include <linux/poll.h> |
76369139 FW |
17 | |
18 | #include "internal.h" | |
19 | ||
76369139 FW |
20 | static void perf_output_wakeup(struct perf_output_handle *handle) |
21 | { | |
7c60fc0e | 22 | atomic_set(&handle->rb->poll, POLLIN); |
76369139 | 23 | |
a8b0ca17 PZ |
24 | handle->event->pending_wakeup = 1; |
25 | irq_work_queue(&handle->event->pending); | |
76369139 FW |
26 | } |
27 | ||
28 | /* | |
29 | * We need to ensure a later event_id doesn't publish a head when a former | |
30 | * event isn't done writing. However since we need to deal with NMIs we | |
31 | * cannot fully serialize things. | |
32 | * | |
33 | * We only publish the head (and generate a wakeup) when the outer-most | |
34 | * event completes. | |
35 | */ | |
36 | static void perf_output_get_handle(struct perf_output_handle *handle) | |
37 | { | |
38 | struct ring_buffer *rb = handle->rb; | |
39 | ||
40 | preempt_disable(); | |
41 | local_inc(&rb->nest); | |
42 | handle->wakeup = local_read(&rb->wakeup); | |
43 | } | |
44 | ||
45 | static void perf_output_put_handle(struct perf_output_handle *handle) | |
46 | { | |
47 | struct ring_buffer *rb = handle->rb; | |
48 | unsigned long head; | |
49 | ||
50 | again: | |
51 | head = local_read(&rb->head); | |
52 | ||
53 | /* | |
54 | * IRQ/NMI can happen here, which means we can miss a head update. | |
55 | */ | |
56 | ||
57 | if (!local_dec_and_test(&rb->nest)) | |
58 | goto out; | |
59 | ||
60 | /* | |
bf378d34 PZ |
61 | * Since the mmap() consumer (userspace) can run on a different CPU: |
62 | * | |
63 | * kernel user | |
64 | * | |
c7f2e3cd PZ |
65 | * if (LOAD ->data_tail) { LOAD ->data_head |
66 | * (A) smp_rmb() (C) | |
67 | * STORE $data LOAD $data | |
68 | * smp_wmb() (B) smp_mb() (D) | |
69 | * STORE ->data_head STORE ->data_tail | |
70 | * } | |
bf378d34 PZ |
71 | * |
72 | * Where A pairs with D, and B pairs with C. | |
73 | * | |
c7f2e3cd PZ |
74 | * In our case (A) is a control dependency that separates the load of |
75 | * the ->data_tail and the stores of $data. In case ->data_tail | |
76 | * indicates there is no room in the buffer to store $data we do not. | |
bf378d34 | 77 | * |
c7f2e3cd | 78 | * D needs to be a full barrier since it separates the data READ |
bf378d34 PZ |
79 | * from the tail WRITE. |
80 | * | |
81 | * For B a WMB is sufficient since it separates two WRITEs, and for C | |
82 | * an RMB is sufficient since it separates two READs. | |
83 | * | |
84 | * See perf_output_begin(). | |
76369139 | 85 | */ |
c7f2e3cd | 86 | smp_wmb(); /* B, matches C */ |
76369139 FW |
87 | rb->user_page->data_head = head; |
88 | ||
89 | /* | |
394570b7 PZ |
90 | * Now check if we missed an update -- rely on previous implied |
91 | * compiler barriers to force a re-read. | |
76369139 FW |
92 | */ |
93 | if (unlikely(head != local_read(&rb->head))) { | |
94 | local_inc(&rb->nest); | |
95 | goto again; | |
96 | } | |
97 | ||
98 | if (handle->wakeup != local_read(&rb->wakeup)) | |
99 | perf_output_wakeup(handle); | |
100 | ||
101 | out: | |
102 | preempt_enable(); | |
103 | } | |
104 | ||
d1b26c70 WN |
105 | static bool __always_inline |
106 | ring_buffer_has_space(unsigned long head, unsigned long tail, | |
107 | unsigned long data_size, unsigned int size, | |
108 | bool backward) | |
109 | { | |
110 | if (!backward) | |
111 | return CIRC_SPACE(head, tail, data_size) >= size; | |
112 | else | |
113 | return CIRC_SPACE(tail, head, data_size) >= size; | |
114 | } | |
115 | ||
116 | static int __always_inline | |
117 | __perf_output_begin(struct perf_output_handle *handle, | |
118 | struct perf_event *event, unsigned int size, | |
119 | bool backward) | |
76369139 FW |
120 | { |
121 | struct ring_buffer *rb; | |
122 | unsigned long tail, offset, head; | |
524feca5 | 123 | int have_lost, page_shift; |
76369139 FW |
124 | struct { |
125 | struct perf_event_header header; | |
126 | u64 id; | |
127 | u64 lost; | |
128 | } lost_event; | |
129 | ||
130 | rcu_read_lock(); | |
131 | /* | |
132 | * For inherited events we send all the output towards the parent. | |
133 | */ | |
134 | if (event->parent) | |
135 | event = event->parent; | |
136 | ||
137 | rb = rcu_dereference(event->rb); | |
c72b42a3 | 138 | if (unlikely(!rb)) |
76369139 FW |
139 | goto out; |
140 | ||
86e7972f WN |
141 | if (unlikely(rb->paused)) { |
142 | if (rb->nr_pages) | |
143 | local_inc(&rb->lost); | |
76369139 | 144 | goto out; |
86e7972f | 145 | } |
76369139 | 146 | |
c72b42a3 PZ |
147 | handle->rb = rb; |
148 | handle->event = event; | |
149 | ||
76369139 | 150 | have_lost = local_read(&rb->lost); |
c72b42a3 | 151 | if (unlikely(have_lost)) { |
d20a973f PZ |
152 | size += sizeof(lost_event); |
153 | if (event->attr.sample_id_all) | |
154 | size += event->id_header_size; | |
76369139 FW |
155 | } |
156 | ||
157 | perf_output_get_handle(handle); | |
158 | ||
159 | do { | |
105ff3cb | 160 | tail = READ_ONCE(rb->user_page->data_tail); |
76369139 | 161 | offset = head = local_read(&rb->head); |
d1b26c70 WN |
162 | if (!rb->overwrite) { |
163 | if (unlikely(!ring_buffer_has_space(head, tail, | |
164 | perf_data_size(rb), | |
165 | size, backward))) | |
166 | goto fail; | |
167 | } | |
c7f2e3cd PZ |
168 | |
169 | /* | |
170 | * The above forms a control dependency barrier separating the | |
171 | * @tail load above from the data stores below. Since the @tail | |
172 | * load is required to compute the branch to fail below. | |
173 | * | |
174 | * A, matches D; the full memory barrier userspace SHOULD issue | |
175 | * after reading the data and before storing the new tail | |
176 | * position. | |
177 | * | |
178 | * See perf_output_put_handle(). | |
179 | */ | |
180 | ||
d1b26c70 WN |
181 | if (!backward) |
182 | head += size; | |
183 | else | |
184 | head -= size; | |
76369139 FW |
185 | } while (local_cmpxchg(&rb->head, offset, head) != offset); |
186 | ||
d1b26c70 WN |
187 | if (backward) { |
188 | offset = head; | |
189 | head = (u64)(-head); | |
190 | } | |
191 | ||
85f59edf | 192 | /* |
c7f2e3cd PZ |
193 | * We rely on the implied barrier() by local_cmpxchg() to ensure |
194 | * none of the data stores below can be lifted up by the compiler. | |
85f59edf | 195 | */ |
85f59edf | 196 | |
c72b42a3 | 197 | if (unlikely(head - local_read(&rb->wakeup) > rb->watermark)) |
76369139 FW |
198 | local_add(rb->watermark, &rb->wakeup); |
199 | ||
524feca5 PZ |
200 | page_shift = PAGE_SHIFT + page_order(rb); |
201 | ||
202 | handle->page = (offset >> page_shift) & (rb->nr_pages - 1); | |
203 | offset &= (1UL << page_shift) - 1; | |
204 | handle->addr = rb->data_pages[handle->page] + offset; | |
205 | handle->size = (1UL << page_shift) - offset; | |
76369139 | 206 | |
c72b42a3 | 207 | if (unlikely(have_lost)) { |
d20a973f PZ |
208 | struct perf_sample_data sample_data; |
209 | ||
210 | lost_event.header.size = sizeof(lost_event); | |
76369139 FW |
211 | lost_event.header.type = PERF_RECORD_LOST; |
212 | lost_event.header.misc = 0; | |
213 | lost_event.id = event->id; | |
214 | lost_event.lost = local_xchg(&rb->lost, 0); | |
215 | ||
d20a973f PZ |
216 | perf_event_header__init_id(&lost_event.header, |
217 | &sample_data, event); | |
76369139 FW |
218 | perf_output_put(handle, lost_event); |
219 | perf_event__output_id_sample(event, handle, &sample_data); | |
220 | } | |
221 | ||
222 | return 0; | |
223 | ||
224 | fail: | |
225 | local_inc(&rb->lost); | |
226 | perf_output_put_handle(handle); | |
227 | out: | |
228 | rcu_read_unlock(); | |
229 | ||
230 | return -ENOSPC; | |
231 | } | |
232 | ||
9ecda41a WN |
233 | int perf_output_begin_forward(struct perf_output_handle *handle, |
234 | struct perf_event *event, unsigned int size) | |
235 | { | |
236 | return __perf_output_begin(handle, event, size, false); | |
237 | } | |
238 | ||
239 | int perf_output_begin_backward(struct perf_output_handle *handle, | |
240 | struct perf_event *event, unsigned int size) | |
241 | { | |
242 | return __perf_output_begin(handle, event, size, true); | |
243 | } | |
244 | ||
d1b26c70 WN |
245 | int perf_output_begin(struct perf_output_handle *handle, |
246 | struct perf_event *event, unsigned int size) | |
247 | { | |
9ecda41a WN |
248 | |
249 | return __perf_output_begin(handle, event, size, | |
250 | unlikely(is_write_backward(event))); | |
d1b26c70 WN |
251 | } |
252 | ||
91d7753a | 253 | unsigned int perf_output_copy(struct perf_output_handle *handle, |
76369139 FW |
254 | const void *buf, unsigned int len) |
255 | { | |
91d7753a | 256 | return __output_copy(handle, buf, len); |
76369139 FW |
257 | } |
258 | ||
5685e0ff JO |
259 | unsigned int perf_output_skip(struct perf_output_handle *handle, |
260 | unsigned int len) | |
261 | { | |
262 | return __output_skip(handle, NULL, len); | |
263 | } | |
264 | ||
76369139 FW |
265 | void perf_output_end(struct perf_output_handle *handle) |
266 | { | |
76369139 FW |
267 | perf_output_put_handle(handle); |
268 | rcu_read_unlock(); | |
269 | } | |
270 | ||
271 | static void | |
272 | ring_buffer_init(struct ring_buffer *rb, long watermark, int flags) | |
273 | { | |
274 | long max_size = perf_data_size(rb); | |
275 | ||
276 | if (watermark) | |
277 | rb->watermark = min(max_size, watermark); | |
278 | ||
279 | if (!rb->watermark) | |
280 | rb->watermark = max_size / 2; | |
281 | ||
282 | if (flags & RING_BUFFER_WRITABLE) | |
dd9c086d SE |
283 | rb->overwrite = 0; |
284 | else | |
285 | rb->overwrite = 1; | |
76369139 FW |
286 | |
287 | atomic_set(&rb->refcount, 1); | |
10c6db11 PZ |
288 | |
289 | INIT_LIST_HEAD(&rb->event_list); | |
290 | spin_lock_init(&rb->event_lock); | |
86e7972f WN |
291 | |
292 | /* | |
293 | * perf_output_begin() only checks rb->paused, therefore | |
294 | * rb->paused must be true if we have no pages for output. | |
295 | */ | |
296 | if (!rb->nr_pages) | |
297 | rb->paused = 1; | |
76369139 FW |
298 | } |
299 | ||
f4c0b0aa WD |
300 | void perf_aux_output_flag(struct perf_output_handle *handle, u64 flags) |
301 | { | |
302 | /* | |
303 | * OVERWRITE is determined by perf_aux_output_end() and can't | |
304 | * be passed in directly. | |
305 | */ | |
306 | if (WARN_ON_ONCE(flags & PERF_AUX_FLAG_OVERWRITE)) | |
307 | return; | |
308 | ||
309 | handle->aux_flags |= flags; | |
310 | } | |
311 | EXPORT_SYMBOL_GPL(perf_aux_output_flag); | |
312 | ||
fdc26706 AS |
313 | /* |
314 | * This is called before hardware starts writing to the AUX area to | |
315 | * obtain an output handle and make sure there's room in the buffer. | |
316 | * When the capture completes, call perf_aux_output_end() to commit | |
317 | * the recorded data to the buffer. | |
318 | * | |
319 | * The ordering is similar to that of perf_output_{begin,end}, with | |
320 | * the exception of (B), which should be taken care of by the pmu | |
321 | * driver, since ordering rules will differ depending on hardware. | |
af5bb4ed AS |
322 | * |
323 | * Call this from pmu::start(); see the comment in perf_aux_output_end() | |
324 | * about its use in pmu callbacks. Both can also be called from the PMI | |
325 | * handler if needed. | |
fdc26706 AS |
326 | */ |
327 | void *perf_aux_output_begin(struct perf_output_handle *handle, | |
328 | struct perf_event *event) | |
329 | { | |
330 | struct perf_event *output_event = event; | |
331 | unsigned long aux_head, aux_tail; | |
332 | struct ring_buffer *rb; | |
333 | ||
334 | if (output_event->parent) | |
335 | output_event = output_event->parent; | |
336 | ||
337 | /* | |
338 | * Since this will typically be open across pmu::add/pmu::del, we | |
339 | * grab ring_buffer's refcount instead of holding rcu read lock | |
340 | * to make sure it doesn't disappear under us. | |
341 | */ | |
342 | rb = ring_buffer_get(output_event); | |
343 | if (!rb) | |
344 | return NULL; | |
345 | ||
b79ccadd | 346 | if (!rb_has_aux(rb)) |
fdc26706 AS |
347 | goto err; |
348 | ||
dcb10a96 | 349 | /* |
b79ccadd AS |
350 | * If aux_mmap_count is zero, the aux buffer is in perf_mmap_close(), |
351 | * about to get freed, so we leave immediately. | |
352 | * | |
353 | * Checking rb::aux_mmap_count and rb::refcount has to be done in | |
354 | * the same order, see perf_mmap_close. Otherwise we end up freeing | |
355 | * aux pages in this path, which is a bug, because in_atomic(). | |
dcb10a96 AS |
356 | */ |
357 | if (!atomic_read(&rb->aux_mmap_count)) | |
b79ccadd AS |
358 | goto err; |
359 | ||
360 | if (!atomic_inc_not_zero(&rb->aux_refcount)) | |
361 | goto err; | |
dcb10a96 | 362 | |
fdc26706 AS |
363 | /* |
364 | * Nesting is not supported for AUX area, make sure nested | |
365 | * writers are caught early | |
366 | */ | |
367 | if (WARN_ON_ONCE(local_xchg(&rb->aux_nest, 1))) | |
368 | goto err_put; | |
369 | ||
370 | aux_head = local_read(&rb->aux_head); | |
fdc26706 AS |
371 | |
372 | handle->rb = rb; | |
373 | handle->event = event; | |
374 | handle->head = aux_head; | |
2023a0d2 | 375 | handle->size = 0; |
f4c0b0aa | 376 | handle->aux_flags = 0; |
fdc26706 AS |
377 | |
378 | /* | |
2023a0d2 AS |
379 | * In overwrite mode, AUX data stores do not depend on aux_tail, |
380 | * therefore (A) control dependency barrier does not exist. The | |
381 | * (B) <-> (C) ordering is still observed by the pmu driver. | |
fdc26706 | 382 | */ |
2023a0d2 AS |
383 | if (!rb->aux_overwrite) { |
384 | aux_tail = ACCESS_ONCE(rb->user_page->aux_tail); | |
1a594131 | 385 | handle->wakeup = local_read(&rb->aux_wakeup) + rb->aux_watermark; |
2023a0d2 AS |
386 | if (aux_head - aux_tail < perf_aux_size(rb)) |
387 | handle->size = CIRC_SPACE(aux_head, aux_tail, perf_aux_size(rb)); | |
388 | ||
389 | /* | |
390 | * handle->size computation depends on aux_tail load; this forms a | |
391 | * control dependency barrier separating aux_tail load from aux data | |
392 | * store that will be enabled on successful return | |
393 | */ | |
394 | if (!handle->size) { /* A, matches D */ | |
395 | event->pending_disable = 1; | |
396 | perf_output_wakeup(handle); | |
397 | local_set(&rb->aux_nest, 0); | |
398 | goto err_put; | |
399 | } | |
fdc26706 AS |
400 | } |
401 | ||
402 | return handle->rb->aux_priv; | |
403 | ||
404 | err_put: | |
af5bb4ed | 405 | /* can't be last */ |
fdc26706 AS |
406 | rb_free_aux(rb); |
407 | ||
408 | err: | |
95ff4ca2 | 409 | ring_buffer_put(rb); |
fdc26706 AS |
410 | handle->event = NULL; |
411 | ||
412 | return NULL; | |
413 | } | |
414 | ||
415 | /* | |
416 | * Commit the data written by hardware into the ring buffer by adjusting | |
417 | * aux_head and posting a PERF_RECORD_AUX into the perf buffer. It is the | |
418 | * pmu driver's responsibility to observe ordering rules of the hardware, | |
419 | * so that all the data is externally visible before this is called. | |
af5bb4ed AS |
420 | * |
421 | * Note: this has to be called from pmu::stop() callback, as the assumption | |
422 | * of the AUX buffer management code is that after pmu::stop(), the AUX | |
423 | * transaction must be stopped and therefore drop the AUX reference count. | |
fdc26706 | 424 | */ |
f4c0b0aa | 425 | void perf_aux_output_end(struct perf_output_handle *handle, unsigned long size) |
fdc26706 AS |
426 | { |
427 | struct ring_buffer *rb = handle->rb; | |
f4c0b0aa | 428 | bool wakeup = !!handle->aux_flags; |
2023a0d2 | 429 | unsigned long aux_head; |
fdc26706 | 430 | |
2023a0d2 AS |
431 | /* in overwrite mode, driver provides aux_head via handle */ |
432 | if (rb->aux_overwrite) { | |
f4c0b0aa | 433 | handle->aux_flags |= PERF_AUX_FLAG_OVERWRITE; |
2023a0d2 AS |
434 | |
435 | aux_head = handle->head; | |
436 | local_set(&rb->aux_head, aux_head); | |
437 | } else { | |
f4c0b0aa WD |
438 | handle->aux_flags &= ~PERF_AUX_FLAG_OVERWRITE; |
439 | ||
2023a0d2 AS |
440 | aux_head = local_read(&rb->aux_head); |
441 | local_add(size, &rb->aux_head); | |
442 | } | |
fdc26706 | 443 | |
f4c0b0aa | 444 | if (size || handle->aux_flags) { |
fdc26706 AS |
445 | /* |
446 | * Only send RECORD_AUX if we have something useful to communicate | |
447 | */ | |
448 | ||
f4c0b0aa WD |
449 | perf_event_aux_event(handle->event, aux_head, size, |
450 | handle->aux_flags); | |
fdc26706 AS |
451 | } |
452 | ||
1a594131 | 453 | aux_head = rb->user_page->aux_head = local_read(&rb->aux_head); |
fdc26706 | 454 | |
1a594131 | 455 | if (aux_head - local_read(&rb->aux_wakeup) >= rb->aux_watermark) { |
3f56e687 | 456 | wakeup = true; |
1a594131 AS |
457 | local_add(rb->aux_watermark, &rb->aux_wakeup); |
458 | } | |
3f56e687 AS |
459 | |
460 | if (wakeup) { | |
f4c0b0aa | 461 | if (handle->aux_flags & PERF_AUX_FLAG_TRUNCATED) |
3f56e687 AS |
462 | handle->event->pending_disable = 1; |
463 | perf_output_wakeup(handle); | |
464 | } | |
465 | ||
fdc26706 AS |
466 | handle->event = NULL; |
467 | ||
468 | local_set(&rb->aux_nest, 0); | |
af5bb4ed | 469 | /* can't be last */ |
fdc26706 | 470 | rb_free_aux(rb); |
95ff4ca2 | 471 | ring_buffer_put(rb); |
fdc26706 AS |
472 | } |
473 | ||
474 | /* | |
475 | * Skip over a given number of bytes in the AUX buffer, due to, for example, | |
476 | * hardware's alignment constraints. | |
477 | */ | |
478 | int perf_aux_output_skip(struct perf_output_handle *handle, unsigned long size) | |
479 | { | |
480 | struct ring_buffer *rb = handle->rb; | |
481 | unsigned long aux_head; | |
482 | ||
483 | if (size > handle->size) | |
484 | return -ENOSPC; | |
485 | ||
486 | local_add(size, &rb->aux_head); | |
487 | ||
1a594131 AS |
488 | aux_head = rb->user_page->aux_head = local_read(&rb->aux_head); |
489 | if (aux_head - local_read(&rb->aux_wakeup) >= rb->aux_watermark) { | |
490 | perf_output_wakeup(handle); | |
491 | local_add(rb->aux_watermark, &rb->aux_wakeup); | |
492 | handle->wakeup = local_read(&rb->aux_wakeup) + | |
493 | rb->aux_watermark; | |
494 | } | |
495 | ||
fdc26706 AS |
496 | handle->head = aux_head; |
497 | handle->size -= size; | |
498 | ||
499 | return 0; | |
500 | } | |
501 | ||
502 | void *perf_get_aux(struct perf_output_handle *handle) | |
503 | { | |
504 | /* this is only valid between perf_aux_output_begin and *_end */ | |
505 | if (!handle->event) | |
506 | return NULL; | |
507 | ||
508 | return handle->rb->aux_priv; | |
509 | } | |
510 | ||
0a4e38e6 AS |
511 | #define PERF_AUX_GFP (GFP_KERNEL | __GFP_ZERO | __GFP_NOWARN | __GFP_NORETRY) |
512 | ||
513 | static struct page *rb_alloc_aux_page(int node, int order) | |
514 | { | |
515 | struct page *page; | |
516 | ||
517 | if (order > MAX_ORDER) | |
518 | order = MAX_ORDER; | |
519 | ||
520 | do { | |
521 | page = alloc_pages_node(node, PERF_AUX_GFP, order); | |
522 | } while (!page && order--); | |
523 | ||
524 | if (page && order) { | |
525 | /* | |
c2ad6b51 AS |
526 | * Communicate the allocation size to the driver: |
527 | * if we managed to secure a high-order allocation, | |
528 | * set its first page's private to this order; | |
529 | * !PagePrivate(page) means it's just a normal page. | |
0a4e38e6 AS |
530 | */ |
531 | split_page(page, order); | |
532 | SetPagePrivate(page); | |
533 | set_page_private(page, order); | |
534 | } | |
535 | ||
536 | return page; | |
537 | } | |
538 | ||
539 | static void rb_free_aux_page(struct ring_buffer *rb, int idx) | |
540 | { | |
541 | struct page *page = virt_to_page(rb->aux_pages[idx]); | |
542 | ||
543 | ClearPagePrivate(page); | |
544 | page->mapping = NULL; | |
545 | __free_page(page); | |
546 | } | |
547 | ||
45c815f0 AS |
548 | static void __rb_free_aux(struct ring_buffer *rb) |
549 | { | |
550 | int pg; | |
551 | ||
95ff4ca2 AS |
552 | /* |
553 | * Should never happen, the last reference should be dropped from | |
554 | * perf_mmap_close() path, which first stops aux transactions (which | |
555 | * in turn are the atomic holders of aux_refcount) and then does the | |
556 | * last rb_free_aux(). | |
557 | */ | |
558 | WARN_ON_ONCE(in_atomic()); | |
559 | ||
45c815f0 AS |
560 | if (rb->aux_priv) { |
561 | rb->free_aux(rb->aux_priv); | |
562 | rb->free_aux = NULL; | |
563 | rb->aux_priv = NULL; | |
564 | } | |
565 | ||
566 | if (rb->aux_nr_pages) { | |
567 | for (pg = 0; pg < rb->aux_nr_pages; pg++) | |
568 | rb_free_aux_page(rb, pg); | |
569 | ||
570 | kfree(rb->aux_pages); | |
571 | rb->aux_nr_pages = 0; | |
572 | } | |
573 | } | |
574 | ||
45bfb2e5 | 575 | int rb_alloc_aux(struct ring_buffer *rb, struct perf_event *event, |
1a594131 | 576 | pgoff_t pgoff, int nr_pages, long watermark, int flags) |
45bfb2e5 PZ |
577 | { |
578 | bool overwrite = !(flags & RING_BUFFER_WRITABLE); | |
579 | int node = (event->cpu == -1) ? -1 : cpu_to_node(event->cpu); | |
0a4e38e6 | 580 | int ret = -ENOMEM, max_order = 0; |
45bfb2e5 PZ |
581 | |
582 | if (!has_aux(event)) | |
583 | return -ENOTSUPP; | |
584 | ||
6a279230 | 585 | if (event->pmu->capabilities & PERF_PMU_CAP_AUX_NO_SG) { |
0a4e38e6 AS |
586 | /* |
587 | * We need to start with the max_order that fits in nr_pages, | |
588 | * not the other way around, hence ilog2() and not get_order. | |
589 | */ | |
590 | max_order = ilog2(nr_pages); | |
591 | ||
6a279230 AS |
592 | /* |
593 | * PMU requests more than one contiguous chunks of memory | |
594 | * for SW double buffering | |
595 | */ | |
596 | if ((event->pmu->capabilities & PERF_PMU_CAP_AUX_SW_DOUBLEBUF) && | |
597 | !overwrite) { | |
598 | if (!max_order) | |
599 | return -EINVAL; | |
600 | ||
601 | max_order--; | |
602 | } | |
603 | } | |
604 | ||
45bfb2e5 PZ |
605 | rb->aux_pages = kzalloc_node(nr_pages * sizeof(void *), GFP_KERNEL, node); |
606 | if (!rb->aux_pages) | |
607 | return -ENOMEM; | |
608 | ||
609 | rb->free_aux = event->pmu->free_aux; | |
0a4e38e6 | 610 | for (rb->aux_nr_pages = 0; rb->aux_nr_pages < nr_pages;) { |
45bfb2e5 | 611 | struct page *page; |
0a4e38e6 | 612 | int last, order; |
45bfb2e5 | 613 | |
0a4e38e6 AS |
614 | order = min(max_order, ilog2(nr_pages - rb->aux_nr_pages)); |
615 | page = rb_alloc_aux_page(node, order); | |
45bfb2e5 PZ |
616 | if (!page) |
617 | goto out; | |
618 | ||
0a4e38e6 AS |
619 | for (last = rb->aux_nr_pages + (1 << page_private(page)); |
620 | last > rb->aux_nr_pages; rb->aux_nr_pages++) | |
621 | rb->aux_pages[rb->aux_nr_pages] = page_address(page++); | |
45bfb2e5 PZ |
622 | } |
623 | ||
aa319bcd AS |
624 | /* |
625 | * In overwrite mode, PMUs that don't support SG may not handle more | |
626 | * than one contiguous allocation, since they rely on PMI to do double | |
627 | * buffering. In this case, the entire buffer has to be one contiguous | |
628 | * chunk. | |
629 | */ | |
630 | if ((event->pmu->capabilities & PERF_PMU_CAP_AUX_NO_SG) && | |
631 | overwrite) { | |
632 | struct page *page = virt_to_page(rb->aux_pages[0]); | |
633 | ||
634 | if (page_private(page) != max_order) | |
635 | goto out; | |
636 | } | |
637 | ||
45bfb2e5 PZ |
638 | rb->aux_priv = event->pmu->setup_aux(event->cpu, rb->aux_pages, nr_pages, |
639 | overwrite); | |
640 | if (!rb->aux_priv) | |
641 | goto out; | |
642 | ||
643 | ret = 0; | |
644 | ||
645 | /* | |
646 | * aux_pages (and pmu driver's private data, aux_priv) will be | |
647 | * referenced in both producer's and consumer's contexts, thus | |
648 | * we keep a refcount here to make sure either of the two can | |
649 | * reference them safely. | |
650 | */ | |
651 | atomic_set(&rb->aux_refcount, 1); | |
652 | ||
2023a0d2 | 653 | rb->aux_overwrite = overwrite; |
1a594131 AS |
654 | rb->aux_watermark = watermark; |
655 | ||
656 | if (!rb->aux_watermark && !rb->aux_overwrite) | |
657 | rb->aux_watermark = nr_pages << (PAGE_SHIFT - 1); | |
2023a0d2 | 658 | |
45bfb2e5 PZ |
659 | out: |
660 | if (!ret) | |
661 | rb->aux_pgoff = pgoff; | |
662 | else | |
45c815f0 | 663 | __rb_free_aux(rb); |
45bfb2e5 PZ |
664 | |
665 | return ret; | |
666 | } | |
667 | ||
45bfb2e5 PZ |
668 | void rb_free_aux(struct ring_buffer *rb) |
669 | { | |
670 | if (atomic_dec_and_test(&rb->aux_refcount)) | |
671 | __rb_free_aux(rb); | |
672 | } | |
673 | ||
76369139 FW |
674 | #ifndef CONFIG_PERF_USE_VMALLOC |
675 | ||
676 | /* | |
677 | * Back perf_mmap() with regular GFP_KERNEL-0 pages. | |
678 | */ | |
679 | ||
45bfb2e5 PZ |
680 | static struct page * |
681 | __perf_mmap_to_page(struct ring_buffer *rb, unsigned long pgoff) | |
76369139 FW |
682 | { |
683 | if (pgoff > rb->nr_pages) | |
684 | return NULL; | |
685 | ||
686 | if (pgoff == 0) | |
687 | return virt_to_page(rb->user_page); | |
688 | ||
689 | return virt_to_page(rb->data_pages[pgoff - 1]); | |
690 | } | |
691 | ||
692 | static void *perf_mmap_alloc_page(int cpu) | |
693 | { | |
694 | struct page *page; | |
695 | int node; | |
696 | ||
697 | node = (cpu == -1) ? cpu : cpu_to_node(cpu); | |
698 | page = alloc_pages_node(node, GFP_KERNEL | __GFP_ZERO, 0); | |
699 | if (!page) | |
700 | return NULL; | |
701 | ||
702 | return page_address(page); | |
703 | } | |
704 | ||
705 | struct ring_buffer *rb_alloc(int nr_pages, long watermark, int cpu, int flags) | |
706 | { | |
707 | struct ring_buffer *rb; | |
708 | unsigned long size; | |
709 | int i; | |
710 | ||
711 | size = sizeof(struct ring_buffer); | |
712 | size += nr_pages * sizeof(void *); | |
713 | ||
714 | rb = kzalloc(size, GFP_KERNEL); | |
715 | if (!rb) | |
716 | goto fail; | |
717 | ||
718 | rb->user_page = perf_mmap_alloc_page(cpu); | |
719 | if (!rb->user_page) | |
720 | goto fail_user_page; | |
721 | ||
722 | for (i = 0; i < nr_pages; i++) { | |
723 | rb->data_pages[i] = perf_mmap_alloc_page(cpu); | |
724 | if (!rb->data_pages[i]) | |
725 | goto fail_data_pages; | |
726 | } | |
727 | ||
728 | rb->nr_pages = nr_pages; | |
729 | ||
730 | ring_buffer_init(rb, watermark, flags); | |
731 | ||
732 | return rb; | |
733 | ||
734 | fail_data_pages: | |
735 | for (i--; i >= 0; i--) | |
736 | free_page((unsigned long)rb->data_pages[i]); | |
737 | ||
738 | free_page((unsigned long)rb->user_page); | |
739 | ||
740 | fail_user_page: | |
741 | kfree(rb); | |
742 | ||
743 | fail: | |
744 | return NULL; | |
745 | } | |
746 | ||
747 | static void perf_mmap_free_page(unsigned long addr) | |
748 | { | |
749 | struct page *page = virt_to_page((void *)addr); | |
750 | ||
751 | page->mapping = NULL; | |
752 | __free_page(page); | |
753 | } | |
754 | ||
755 | void rb_free(struct ring_buffer *rb) | |
756 | { | |
757 | int i; | |
758 | ||
759 | perf_mmap_free_page((unsigned long)rb->user_page); | |
760 | for (i = 0; i < rb->nr_pages; i++) | |
761 | perf_mmap_free_page((unsigned long)rb->data_pages[i]); | |
762 | kfree(rb); | |
763 | } | |
764 | ||
765 | #else | |
5919b309 JO |
766 | static int data_page_nr(struct ring_buffer *rb) |
767 | { | |
768 | return rb->nr_pages << page_order(rb); | |
769 | } | |
76369139 | 770 | |
45bfb2e5 PZ |
771 | static struct page * |
772 | __perf_mmap_to_page(struct ring_buffer *rb, unsigned long pgoff) | |
76369139 | 773 | { |
5919b309 JO |
774 | /* The '>' counts in the user page. */ |
775 | if (pgoff > data_page_nr(rb)) | |
76369139 FW |
776 | return NULL; |
777 | ||
778 | return vmalloc_to_page((void *)rb->user_page + pgoff * PAGE_SIZE); | |
779 | } | |
780 | ||
781 | static void perf_mmap_unmark_page(void *addr) | |
782 | { | |
783 | struct page *page = vmalloc_to_page(addr); | |
784 | ||
785 | page->mapping = NULL; | |
786 | } | |
787 | ||
788 | static void rb_free_work(struct work_struct *work) | |
789 | { | |
790 | struct ring_buffer *rb; | |
791 | void *base; | |
792 | int i, nr; | |
793 | ||
794 | rb = container_of(work, struct ring_buffer, work); | |
5919b309 | 795 | nr = data_page_nr(rb); |
76369139 FW |
796 | |
797 | base = rb->user_page; | |
5919b309 JO |
798 | /* The '<=' counts in the user page. */ |
799 | for (i = 0; i <= nr; i++) | |
76369139 FW |
800 | perf_mmap_unmark_page(base + (i * PAGE_SIZE)); |
801 | ||
802 | vfree(base); | |
803 | kfree(rb); | |
804 | } | |
805 | ||
806 | void rb_free(struct ring_buffer *rb) | |
807 | { | |
808 | schedule_work(&rb->work); | |
809 | } | |
810 | ||
811 | struct ring_buffer *rb_alloc(int nr_pages, long watermark, int cpu, int flags) | |
812 | { | |
813 | struct ring_buffer *rb; | |
814 | unsigned long size; | |
815 | void *all_buf; | |
816 | ||
817 | size = sizeof(struct ring_buffer); | |
818 | size += sizeof(void *); | |
819 | ||
820 | rb = kzalloc(size, GFP_KERNEL); | |
821 | if (!rb) | |
822 | goto fail; | |
823 | ||
824 | INIT_WORK(&rb->work, rb_free_work); | |
825 | ||
826 | all_buf = vmalloc_user((nr_pages + 1) * PAGE_SIZE); | |
827 | if (!all_buf) | |
828 | goto fail_all_buf; | |
829 | ||
830 | rb->user_page = all_buf; | |
831 | rb->data_pages[0] = all_buf + PAGE_SIZE; | |
8184059e PZ |
832 | if (nr_pages) { |
833 | rb->nr_pages = 1; | |
834 | rb->page_order = ilog2(nr_pages); | |
835 | } | |
76369139 FW |
836 | |
837 | ring_buffer_init(rb, watermark, flags); | |
838 | ||
839 | return rb; | |
840 | ||
841 | fail_all_buf: | |
842 | kfree(rb); | |
843 | ||
844 | fail: | |
845 | return NULL; | |
846 | } | |
847 | ||
848 | #endif | |
45bfb2e5 PZ |
849 | |
850 | struct page * | |
851 | perf_mmap_to_page(struct ring_buffer *rb, unsigned long pgoff) | |
852 | { | |
853 | if (rb->aux_nr_pages) { | |
854 | /* above AUX space */ | |
855 | if (pgoff > rb->aux_pgoff + rb->aux_nr_pages) | |
856 | return NULL; | |
857 | ||
858 | /* AUX space */ | |
859 | if (pgoff >= rb->aux_pgoff) | |
860 | return virt_to_page(rb->aux_pages[pgoff - rb->aux_pgoff]); | |
861 | } | |
862 | ||
863 | return __perf_mmap_to_page(rb, pgoff); | |
864 | } |