2 * Performance events ring-buffer code:
4 * Copyright (C) 2008 Thomas Gleixner <tglx@linutronix.de>
5 * Copyright (C) 2008-2011 Red Hat, Inc., Ingo Molnar
6 * Copyright (C) 2008-2011 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com>
7 * Copyright © 2009 Paul Mackerras, IBM Corp. <paulus@au1.ibm.com>
9 * For licensing details see kernel-base/COPYING
12 #include <linux/perf_event.h>
13 #include <linux/vmalloc.h>
14 #include <linux/slab.h>
18 static bool perf_output_space(struct ring_buffer *rb, unsigned long tail,
19 unsigned long offset, unsigned long head)
21 unsigned long sz = perf_data_size(rb);
22 unsigned long mask = sz - 1;
25 * check if user-writable
26 * overwrite : over-write its own tail
27 * !overwrite: buffer possibly drops events.
33 * verify that payload is not bigger than buffer
34 * otherwise masking logic may fail to detect
35 * the "not enough space" condition
37 if ((head - offset) > sz)
40 offset = (offset - tail) & mask;
41 head = (head - tail) & mask;
43 if ((int)(head - offset) < 0)
49 static void perf_output_wakeup(struct perf_output_handle *handle)
51 atomic_set(&handle->rb->poll, POLL_IN);
53 handle->event->pending_wakeup = 1;
54 irq_work_queue(&handle->event->pending);
58 * We need to ensure a later event_id doesn't publish a head when a former
59 * event isn't done writing. However since we need to deal with NMIs we
60 * cannot fully serialize things.
62 * We only publish the head (and generate a wakeup) when the outer-most
65 static void perf_output_get_handle(struct perf_output_handle *handle)
67 struct ring_buffer *rb = handle->rb;
71 handle->wakeup = local_read(&rb->wakeup);
74 static void perf_output_put_handle(struct perf_output_handle *handle)
76 struct ring_buffer *rb = handle->rb;
80 head = local_read(&rb->head);
83 * IRQ/NMI can happen here, which means we can miss a head update.
86 if (!local_dec_and_test(&rb->nest))
90 * Publish the known good head. Rely on the full barrier implied
91 * by atomic_dec_and_test() order the rb->head read and this
94 rb->user_page->data_head = head;
97 * Now check if we missed an update, rely on the (compiler)
98 * barrier in atomic_dec_and_test() to re-read rb->head.
100 if (unlikely(head != local_read(&rb->head))) {
101 local_inc(&rb->nest);
105 if (handle->wakeup != local_read(&rb->wakeup))
106 perf_output_wakeup(handle);
112 int perf_output_begin(struct perf_output_handle *handle,
113 struct perf_event *event, unsigned int size)
115 struct ring_buffer *rb;
116 unsigned long tail, offset, head;
118 struct perf_sample_data sample_data;
120 struct perf_event_header header;
127 * For inherited events we send all the output towards the parent.
130 event = event->parent;
132 rb = rcu_dereference(event->rb);
137 handle->event = event;
142 have_lost = local_read(&rb->lost);
144 lost_event.header.size = sizeof(lost_event);
145 perf_event_header__init_id(&lost_event.header, &sample_data,
147 size += lost_event.header.size;
150 perf_output_get_handle(handle);
154 * Userspace could choose to issue a mb() before updating the
155 * tail pointer. So that all reads will be completed before the
158 tail = ACCESS_ONCE(rb->user_page->data_tail);
160 offset = head = local_read(&rb->head);
162 if (unlikely(!perf_output_space(rb, tail, offset, head)))
164 } while (local_cmpxchg(&rb->head, offset, head) != offset);
166 if (head - local_read(&rb->wakeup) > rb->watermark)
167 local_add(rb->watermark, &rb->wakeup);
169 handle->page = offset >> (PAGE_SHIFT + page_order(rb));
170 handle->page &= rb->nr_pages - 1;
171 handle->size = offset & ((PAGE_SIZE << page_order(rb)) - 1);
172 handle->addr = rb->data_pages[handle->page];
173 handle->addr += handle->size;
174 handle->size = (PAGE_SIZE << page_order(rb)) - handle->size;
177 lost_event.header.type = PERF_RECORD_LOST;
178 lost_event.header.misc = 0;
179 lost_event.id = event->id;
180 lost_event.lost = local_xchg(&rb->lost, 0);
182 perf_output_put(handle, lost_event);
183 perf_event__output_id_sample(event, handle, &sample_data);
189 local_inc(&rb->lost);
190 perf_output_put_handle(handle);
197 unsigned int perf_output_copy(struct perf_output_handle *handle,
198 const void *buf, unsigned int len)
200 return __output_copy(handle, buf, len);
203 unsigned int perf_output_skip(struct perf_output_handle *handle,
206 return __output_skip(handle, NULL, len);
209 void perf_output_end(struct perf_output_handle *handle)
211 perf_output_put_handle(handle);
216 ring_buffer_init(struct ring_buffer *rb, long watermark, int flags)
218 long max_size = perf_data_size(rb);
221 rb->watermark = min(max_size, watermark);
224 rb->watermark = max_size / 2;
226 if (flags & RING_BUFFER_WRITABLE)
231 atomic_set(&rb->refcount, 1);
233 INIT_LIST_HEAD(&rb->event_list);
234 spin_lock_init(&rb->event_lock);
237 #ifndef CONFIG_PERF_USE_VMALLOC
240 * Back perf_mmap() with regular GFP_KERNEL-0 pages.
244 perf_mmap_to_page(struct ring_buffer *rb, unsigned long pgoff)
246 if (pgoff > rb->nr_pages)
250 return virt_to_page(rb->user_page);
252 return virt_to_page(rb->data_pages[pgoff - 1]);
255 static void *perf_mmap_alloc_page(int cpu)
260 node = (cpu == -1) ? cpu : cpu_to_node(cpu);
261 page = alloc_pages_node(node, GFP_KERNEL | __GFP_ZERO, 0);
265 return page_address(page);
268 struct ring_buffer *rb_alloc(int nr_pages, long watermark, int cpu, int flags)
270 struct ring_buffer *rb;
274 size = sizeof(struct ring_buffer);
275 size += nr_pages * sizeof(void *);
277 rb = kzalloc(size, GFP_KERNEL);
281 rb->user_page = perf_mmap_alloc_page(cpu);
285 for (i = 0; i < nr_pages; i++) {
286 rb->data_pages[i] = perf_mmap_alloc_page(cpu);
287 if (!rb->data_pages[i])
288 goto fail_data_pages;
291 rb->nr_pages = nr_pages;
293 ring_buffer_init(rb, watermark, flags);
298 for (i--; i >= 0; i--)
299 free_page((unsigned long)rb->data_pages[i]);
301 free_page((unsigned long)rb->user_page);
310 static void perf_mmap_free_page(unsigned long addr)
312 struct page *page = virt_to_page((void *)addr);
314 page->mapping = NULL;
318 void rb_free(struct ring_buffer *rb)
322 perf_mmap_free_page((unsigned long)rb->user_page);
323 for (i = 0; i < rb->nr_pages; i++)
324 perf_mmap_free_page((unsigned long)rb->data_pages[i]);
329 static int data_page_nr(struct ring_buffer *rb)
331 return rb->nr_pages << page_order(rb);
335 perf_mmap_to_page(struct ring_buffer *rb, unsigned long pgoff)
337 /* The '>' counts in the user page. */
338 if (pgoff > data_page_nr(rb))
341 return vmalloc_to_page((void *)rb->user_page + pgoff * PAGE_SIZE);
344 static void perf_mmap_unmark_page(void *addr)
346 struct page *page = vmalloc_to_page(addr);
348 page->mapping = NULL;
351 static void rb_free_work(struct work_struct *work)
353 struct ring_buffer *rb;
357 rb = container_of(work, struct ring_buffer, work);
358 nr = data_page_nr(rb);
360 base = rb->user_page;
361 /* The '<=' counts in the user page. */
362 for (i = 0; i <= nr; i++)
363 perf_mmap_unmark_page(base + (i * PAGE_SIZE));
369 void rb_free(struct ring_buffer *rb)
371 schedule_work(&rb->work);
374 struct ring_buffer *rb_alloc(int nr_pages, long watermark, int cpu, int flags)
376 struct ring_buffer *rb;
380 size = sizeof(struct ring_buffer);
381 size += sizeof(void *);
383 rb = kzalloc(size, GFP_KERNEL);
387 INIT_WORK(&rb->work, rb_free_work);
389 all_buf = vmalloc_user((nr_pages + 1) * PAGE_SIZE);
393 rb->user_page = all_buf;
394 rb->data_pages[0] = all_buf + PAGE_SIZE;
395 rb->page_order = ilog2(nr_pages);
396 rb->nr_pages = !!nr_pages;
398 ring_buffer_init(rb, watermark, flags);