4 * Copyright (C) 2008 Steven Rostedt <srostedt@redhat.com>
6 #include <linux/ring_buffer.h>
7 #include <linux/trace_clock.h>
8 #include <linux/ftrace_irq.h>
9 #include <linux/spinlock.h>
10 #include <linux/debugfs.h>
11 #include <linux/uaccess.h>
12 #include <linux/hardirq.h>
13 #include <linux/kmemcheck.h>
14 #include <linux/module.h>
15 #include <linux/percpu.h>
16 #include <linux/mutex.h>
17 #include <linux/init.h>
18 #include <linux/hash.h>
19 #include <linux/list.h>
20 #include <linux/cpu.h>
26 * The ring buffer header is special. We must manually up keep it.
28 int ring_buffer_print_entry_header(struct trace_seq *s)
32 ret = trace_seq_printf(s, "# compressed entry header\n");
33 ret = trace_seq_printf(s, "\ttype_len : 5 bits\n");
34 ret = trace_seq_printf(s, "\ttime_delta : 27 bits\n");
35 ret = trace_seq_printf(s, "\tarray : 32 bits\n");
36 ret = trace_seq_printf(s, "\n");
37 ret = trace_seq_printf(s, "\tpadding : type == %d\n",
38 RINGBUF_TYPE_PADDING);
39 ret = trace_seq_printf(s, "\ttime_extend : type == %d\n",
40 RINGBUF_TYPE_TIME_EXTEND);
41 ret = trace_seq_printf(s, "\tdata max type_len == %d\n",
42 RINGBUF_TYPE_DATA_TYPE_LEN_MAX);
48 * The ring buffer is made up of a list of pages. A separate list of pages is
49 * allocated for each CPU. A writer may only write to a buffer that is
50 * associated with the CPU it is currently executing on. A reader may read
51 * from any per cpu buffer.
53 * The reader is special. For each per cpu buffer, the reader has its own
54 * reader page. When a reader has read the entire reader page, this reader
55 * page is swapped with another page in the ring buffer.
57 * Now, as long as the writer is off the reader page, the reader can do what
58 * ever it wants with that page. The writer will never write to that page
59 * again (as long as it is out of the ring buffer).
61 * Here's some silly ASCII art.
64 * |reader| RING BUFFER
66 * +------+ +---+ +---+ +---+
75 * |reader| RING BUFFER
76 * |page |------------------v
77 * +------+ +---+ +---+ +---+
86 * |reader| RING BUFFER
87 * |page |------------------v
88 * +------+ +---+ +---+ +---+
93 * +------------------------------+
97 * |buffer| RING BUFFER
98 * |page |------------------v
99 * +------+ +---+ +---+ +---+
101 * | New +---+ +---+ +---+
104 * +------------------------------+
107 * After we make this swap, the reader can hand this page off to the splice
108 * code and be done with it. It can even allocate a new page if it needs to
109 * and swap that into the ring buffer.
111 * We will be using cmpxchg soon to make all this lockless.
116 * A fast way to enable or disable all ring buffers is to
117 * call tracing_on or tracing_off. Turning off the ring buffers
118 * prevents all ring buffers from being recorded to.
119 * Turning this switch on, makes it OK to write to the
120 * ring buffer, if the ring buffer is enabled itself.
122 * There's three layers that must be on in order to write
123 * to the ring buffer.
125 * 1) This global flag must be set.
126 * 2) The ring buffer must be enabled for recording.
127 * 3) The per cpu buffer must be enabled for recording.
129 * In case of an anomaly, this global flag has a bit set that
130 * will permantly disable all ring buffers.
134 * Global flag to disable all recording to ring buffers
135 * This has two bits: ON, DISABLED
139 * 0 0 : ring buffers are off
140 * 1 0 : ring buffers are on
141 * X 1 : ring buffers are permanently disabled
145 RB_BUFFERS_ON_BIT = 0,
146 RB_BUFFERS_DISABLED_BIT = 1,
150 RB_BUFFERS_ON = 1 << RB_BUFFERS_ON_BIT,
151 RB_BUFFERS_DISABLED = 1 << RB_BUFFERS_DISABLED_BIT,
154 static unsigned long ring_buffer_flags __read_mostly = RB_BUFFERS_ON;
156 #define BUF_PAGE_HDR_SIZE offsetof(struct buffer_data_page, data)
159 * tracing_on - enable all tracing buffers
161 * This function enables all tracing buffers that may have been
162 * disabled with tracing_off.
164 void tracing_on(void)
166 set_bit(RB_BUFFERS_ON_BIT, &ring_buffer_flags);
168 EXPORT_SYMBOL_GPL(tracing_on);
171 * tracing_off - turn off all tracing buffers
173 * This function stops all tracing buffers from recording data.
174 * It does not disable any overhead the tracers themselves may
175 * be causing. This function simply causes all recording to
176 * the ring buffers to fail.
178 void tracing_off(void)
180 clear_bit(RB_BUFFERS_ON_BIT, &ring_buffer_flags);
182 EXPORT_SYMBOL_GPL(tracing_off);
185 * tracing_off_permanent - permanently disable ring buffers
187 * This function, once called, will disable all ring buffers
190 void tracing_off_permanent(void)
192 set_bit(RB_BUFFERS_DISABLED_BIT, &ring_buffer_flags);
196 * tracing_is_on - show state of ring buffers enabled
198 int tracing_is_on(void)
200 return ring_buffer_flags == RB_BUFFERS_ON;
202 EXPORT_SYMBOL_GPL(tracing_is_on);
206 #define RB_EVNT_HDR_SIZE (offsetof(struct ring_buffer_event, array))
207 #define RB_ALIGNMENT 4U
208 #define RB_MAX_SMALL_DATA (RB_ALIGNMENT * RINGBUF_TYPE_DATA_TYPE_LEN_MAX)
209 #define RB_EVNT_MIN_SIZE 8U /* two 32bit words */
211 /* define RINGBUF_TYPE_DATA for 'case RINGBUF_TYPE_DATA:' */
212 #define RINGBUF_TYPE_DATA 0 ... RINGBUF_TYPE_DATA_TYPE_LEN_MAX
215 RB_LEN_TIME_EXTEND = 8,
216 RB_LEN_TIME_STAMP = 16,
219 static inline int rb_null_event(struct ring_buffer_event *event)
221 return event->type_len == RINGBUF_TYPE_PADDING && !event->time_delta;
224 static void rb_event_set_padding(struct ring_buffer_event *event)
226 /* padding has a NULL time_delta */
227 event->type_len = RINGBUF_TYPE_PADDING;
228 event->time_delta = 0;
232 rb_event_data_length(struct ring_buffer_event *event)
237 length = event->type_len * RB_ALIGNMENT;
239 length = event->array[0];
240 return length + RB_EVNT_HDR_SIZE;
243 /* inline for ring buffer fast paths */
245 rb_event_length(struct ring_buffer_event *event)
247 switch (event->type_len) {
248 case RINGBUF_TYPE_PADDING:
249 if (rb_null_event(event))
252 return event->array[0] + RB_EVNT_HDR_SIZE;
254 case RINGBUF_TYPE_TIME_EXTEND:
255 return RB_LEN_TIME_EXTEND;
257 case RINGBUF_TYPE_TIME_STAMP:
258 return RB_LEN_TIME_STAMP;
260 case RINGBUF_TYPE_DATA:
261 return rb_event_data_length(event);
270 * ring_buffer_event_length - return the length of the event
271 * @event: the event to get the length of
273 unsigned ring_buffer_event_length(struct ring_buffer_event *event)
275 unsigned length = rb_event_length(event);
276 if (event->type_len > RINGBUF_TYPE_DATA_TYPE_LEN_MAX)
278 length -= RB_EVNT_HDR_SIZE;
279 if (length > RB_MAX_SMALL_DATA + sizeof(event->array[0]))
280 length -= sizeof(event->array[0]);
283 EXPORT_SYMBOL_GPL(ring_buffer_event_length);
285 /* inline for ring buffer fast paths */
287 rb_event_data(struct ring_buffer_event *event)
289 BUG_ON(event->type_len > RINGBUF_TYPE_DATA_TYPE_LEN_MAX);
290 /* If length is in len field, then array[0] has the data */
292 return (void *)&event->array[0];
293 /* Otherwise length is in array[0] and array[1] has the data */
294 return (void *)&event->array[1];
298 * ring_buffer_event_data - return the data of the event
299 * @event: the event to get the data from
301 void *ring_buffer_event_data(struct ring_buffer_event *event)
303 return rb_event_data(event);
305 EXPORT_SYMBOL_GPL(ring_buffer_event_data);
307 #define for_each_buffer_cpu(buffer, cpu) \
308 for_each_cpu(cpu, buffer->cpumask)
311 #define TS_MASK ((1ULL << TS_SHIFT) - 1)
312 #define TS_DELTA_TEST (~TS_MASK)
314 struct buffer_data_page {
315 u64 time_stamp; /* page time stamp */
316 local_t commit; /* write committed index */
317 unsigned char data[]; /* data of buffer page */
321 * Note, the buffer_page list must be first. The buffer pages
322 * are allocated in cache lines, which means that each buffer
323 * page will be at the beginning of a cache line, and thus
324 * the least significant bits will be zero. We use this to
325 * add flags in the list struct pointers, to make the ring buffer
329 struct list_head list; /* list of buffer pages */
330 local_t write; /* index for next write */
331 unsigned read; /* index for next read */
332 local_t entries; /* entries on this page */
333 struct buffer_data_page *page; /* Actual data page */
337 * The buffer page counters, write and entries, must be reset
338 * atomically when crossing page boundaries. To synchronize this
339 * update, two counters are inserted into the number. One is
340 * the actual counter for the write position or count on the page.
342 * The other is a counter of updaters. Before an update happens
343 * the update partition of the counter is incremented. This will
344 * allow the updater to update the counter atomically.
346 * The counter is 20 bits, and the state data is 12.
348 #define RB_WRITE_MASK 0xfffff
349 #define RB_WRITE_INTCNT (1 << 20)
351 static void rb_init_page(struct buffer_data_page *bpage)
353 local_set(&bpage->commit, 0);
357 * ring_buffer_page_len - the size of data on the page.
358 * @page: The page to read
360 * Returns the amount of data on the page, including buffer page header.
362 size_t ring_buffer_page_len(void *page)
364 return local_read(&((struct buffer_data_page *)page)->commit)
369 * Also stolen from mm/slob.c. Thanks to Mathieu Desnoyers for pointing
372 static void free_buffer_page(struct buffer_page *bpage)
374 free_page((unsigned long)bpage->page);
379 * We need to fit the time_stamp delta into 27 bits.
381 static inline int test_time_stamp(u64 delta)
383 if (delta & TS_DELTA_TEST)
388 #define BUF_PAGE_SIZE (PAGE_SIZE - BUF_PAGE_HDR_SIZE)
390 /* Max payload is BUF_PAGE_SIZE - header (8bytes) */
391 #define BUF_MAX_DATA_SIZE (BUF_PAGE_SIZE - (sizeof(u32) * 2))
393 /* Max number of timestamps that can fit on a page */
394 #define RB_TIMESTAMPS_PER_PAGE (BUF_PAGE_SIZE / RB_LEN_TIME_STAMP)
396 int ring_buffer_print_page_header(struct trace_seq *s)
398 struct buffer_data_page field;
401 ret = trace_seq_printf(s, "\tfield: u64 timestamp;\t"
402 "offset:0;\tsize:%u;\n",
403 (unsigned int)sizeof(field.time_stamp));
405 ret = trace_seq_printf(s, "\tfield: local_t commit;\t"
406 "offset:%u;\tsize:%u;\n",
407 (unsigned int)offsetof(typeof(field), commit),
408 (unsigned int)sizeof(field.commit));
410 ret = trace_seq_printf(s, "\tfield: char data;\t"
411 "offset:%u;\tsize:%u;\n",
412 (unsigned int)offsetof(typeof(field), data),
413 (unsigned int)BUF_PAGE_SIZE);
419 * head_page == tail_page && head == tail then buffer is empty.
421 struct ring_buffer_per_cpu {
423 struct ring_buffer *buffer;
424 spinlock_t reader_lock; /* serialize readers */
426 struct lock_class_key lock_key;
427 struct list_head *pages;
428 struct buffer_page *head_page; /* read from head */
429 struct buffer_page *tail_page; /* write to tail */
430 struct buffer_page *commit_page; /* committed pages */
431 struct buffer_page *reader_page;
432 local_t commit_overrun;
440 atomic_t record_disabled;
447 atomic_t record_disabled;
448 cpumask_var_t cpumask;
450 struct lock_class_key *reader_lock_key;
454 struct ring_buffer_per_cpu **buffers;
456 #ifdef CONFIG_HOTPLUG_CPU
457 struct notifier_block cpu_notify;
462 struct ring_buffer_iter {
463 struct ring_buffer_per_cpu *cpu_buffer;
465 struct buffer_page *head_page;
469 /* buffer may be either ring_buffer or ring_buffer_per_cpu */
470 #define RB_WARN_ON(b, cond) \
472 int _____ret = unlikely(cond); \
474 if (__same_type(*(b), struct ring_buffer_per_cpu)) { \
475 struct ring_buffer_per_cpu *__b = \
477 atomic_inc(&__b->buffer->record_disabled); \
479 atomic_inc(&b->record_disabled); \
485 /* Up this if you want to test the TIME_EXTENTS and normalization */
486 #define DEBUG_SHIFT 0
488 static inline u64 rb_time_stamp(struct ring_buffer *buffer, int cpu)
490 /* shift to debug/test normalization and TIME_EXTENTS */
491 return buffer->clock() << DEBUG_SHIFT;
494 u64 ring_buffer_time_stamp(struct ring_buffer *buffer, int cpu)
498 preempt_disable_notrace();
499 time = rb_time_stamp(buffer, cpu);
500 preempt_enable_no_resched_notrace();
504 EXPORT_SYMBOL_GPL(ring_buffer_time_stamp);
506 void ring_buffer_normalize_time_stamp(struct ring_buffer *buffer,
509 /* Just stupid testing the normalize function and deltas */
512 EXPORT_SYMBOL_GPL(ring_buffer_normalize_time_stamp);
515 * Making the ring buffer lockless makes things tricky.
516 * Although writes only happen on the CPU that they are on,
517 * and they only need to worry about interrupts. Reads can
520 * The reader page is always off the ring buffer, but when the
521 * reader finishes with a page, it needs to swap its page with
522 * a new one from the buffer. The reader needs to take from
523 * the head (writes go to the tail). But if a writer is in overwrite
524 * mode and wraps, it must push the head page forward.
526 * Here lies the problem.
528 * The reader must be careful to replace only the head page, and
529 * not another one. As described at the top of the file in the
530 * ASCII art, the reader sets its old page to point to the next
531 * page after head. It then sets the page after head to point to
532 * the old reader page. But if the writer moves the head page
533 * during this operation, the reader could end up with the tail.
535 * We use cmpxchg to help prevent this race. We also do something
536 * special with the page before head. We set the LSB to 1.
538 * When the writer must push the page forward, it will clear the
539 * bit that points to the head page, move the head, and then set
540 * the bit that points to the new head page.
542 * We also don't want an interrupt coming in and moving the head
543 * page on another writer. Thus we use the second LSB to catch
546 * head->list->prev->next bit 1 bit 0
549 * Points to head page 0 1
552 * Note we can not trust the prev pointer of the head page, because:
554 * +----+ +-----+ +-----+
555 * | |------>| T |---X--->| N |
557 * +----+ +-----+ +-----+
560 * +----------| R |----------+ |
564 * Key: ---X--> HEAD flag set in pointer
569 * (see __rb_reserve_next() to see where this happens)
571 * What the above shows is that the reader just swapped out
572 * the reader page with a page in the buffer, but before it
573 * could make the new header point back to the new page added
574 * it was preempted by a writer. The writer moved forward onto
575 * the new page added by the reader and is about to move forward
578 * You can see, it is legitimate for the previous pointer of
579 * the head (or any page) not to point back to itself. But only
583 #define RB_PAGE_NORMAL 0UL
584 #define RB_PAGE_HEAD 1UL
585 #define RB_PAGE_UPDATE 2UL
588 #define RB_FLAG_MASK 3UL
590 /* PAGE_MOVED is not part of the mask */
591 #define RB_PAGE_MOVED 4UL
594 * rb_list_head - remove any bit
596 static struct list_head *rb_list_head(struct list_head *list)
598 unsigned long val = (unsigned long)list;
600 return (struct list_head *)(val & ~RB_FLAG_MASK);
604 * rb_is_head_page - test if the give page is the head page
606 * Because the reader may move the head_page pointer, we can
607 * not trust what the head page is (it may be pointing to
608 * the reader page). But if the next page is a header page,
609 * its flags will be non zero.
612 rb_is_head_page(struct ring_buffer_per_cpu *cpu_buffer,
613 struct buffer_page *page, struct list_head *list)
617 val = (unsigned long)list->next;
619 if ((val & ~RB_FLAG_MASK) != (unsigned long)&page->list)
620 return RB_PAGE_MOVED;
622 return val & RB_FLAG_MASK;
628 * The unique thing about the reader page, is that, if the
629 * writer is ever on it, the previous pointer never points
630 * back to the reader page.
632 static int rb_is_reader_page(struct buffer_page *page)
634 struct list_head *list = page->list.prev;
636 return rb_list_head(list->next) != &page->list;
640 * rb_set_list_to_head - set a list_head to be pointing to head.
642 static void rb_set_list_to_head(struct ring_buffer_per_cpu *cpu_buffer,
643 struct list_head *list)
647 ptr = (unsigned long *)&list->next;
648 *ptr |= RB_PAGE_HEAD;
649 *ptr &= ~RB_PAGE_UPDATE;
653 * rb_head_page_activate - sets up head page
655 static void rb_head_page_activate(struct ring_buffer_per_cpu *cpu_buffer)
657 struct buffer_page *head;
659 head = cpu_buffer->head_page;
664 * Set the previous list pointer to have the HEAD flag.
666 rb_set_list_to_head(cpu_buffer, head->list.prev);
669 static void rb_list_head_clear(struct list_head *list)
671 unsigned long *ptr = (unsigned long *)&list->next;
673 *ptr &= ~RB_FLAG_MASK;
677 * rb_head_page_dactivate - clears head page ptr (for free list)
680 rb_head_page_deactivate(struct ring_buffer_per_cpu *cpu_buffer)
682 struct list_head *hd;
684 /* Go through the whole list and clear any pointers found. */
685 rb_list_head_clear(cpu_buffer->pages);
687 list_for_each(hd, cpu_buffer->pages)
688 rb_list_head_clear(hd);
691 static int rb_head_page_set(struct ring_buffer_per_cpu *cpu_buffer,
692 struct buffer_page *head,
693 struct buffer_page *prev,
694 int old_flag, int new_flag)
696 struct list_head *list;
697 unsigned long val = (unsigned long)&head->list;
702 val &= ~RB_FLAG_MASK;
704 ret = (unsigned long)cmpxchg(&list->next,
705 val | old_flag, val | new_flag);
707 /* check if the reader took the page */
708 if ((ret & ~RB_FLAG_MASK) != val)
709 return RB_PAGE_MOVED;
711 return ret & RB_FLAG_MASK;
714 static int rb_head_page_set_update(struct ring_buffer_per_cpu *cpu_buffer,
715 struct buffer_page *head,
716 struct buffer_page *prev,
719 return rb_head_page_set(cpu_buffer, head, prev,
720 old_flag, RB_PAGE_UPDATE);
723 static int rb_head_page_set_head(struct ring_buffer_per_cpu *cpu_buffer,
724 struct buffer_page *head,
725 struct buffer_page *prev,
728 return rb_head_page_set(cpu_buffer, head, prev,
729 old_flag, RB_PAGE_HEAD);
732 static int rb_head_page_set_normal(struct ring_buffer_per_cpu *cpu_buffer,
733 struct buffer_page *head,
734 struct buffer_page *prev,
737 return rb_head_page_set(cpu_buffer, head, prev,
738 old_flag, RB_PAGE_NORMAL);
741 static inline void rb_inc_page(struct ring_buffer_per_cpu *cpu_buffer,
742 struct buffer_page **bpage)
744 struct list_head *p = rb_list_head((*bpage)->list.next);
746 *bpage = list_entry(p, struct buffer_page, list);
749 static struct buffer_page *
750 rb_set_head_page(struct ring_buffer_per_cpu *cpu_buffer)
752 struct buffer_page *head;
753 struct buffer_page *page;
754 struct list_head *list;
757 if (RB_WARN_ON(cpu_buffer, !cpu_buffer->head_page))
761 list = cpu_buffer->pages;
762 if (RB_WARN_ON(cpu_buffer, rb_list_head(list->prev->next) != list))
765 page = head = cpu_buffer->head_page;
767 * It is possible that the writer moves the header behind
768 * where we started, and we miss in one loop.
769 * A second loop should grab the header, but we'll do
770 * three loops just because I'm paranoid.
772 for (i = 0; i < 3; i++) {
774 if (rb_is_head_page(cpu_buffer, page, page->list.prev)) {
775 cpu_buffer->head_page = page;
778 rb_inc_page(cpu_buffer, &page);
779 } while (page != head);
782 RB_WARN_ON(cpu_buffer, 1);
787 static int rb_head_page_replace(struct buffer_page *old,
788 struct buffer_page *new)
790 unsigned long *ptr = (unsigned long *)&old->list.prev->next;
794 val = *ptr & ~RB_FLAG_MASK;
797 ret = cmpxchg(ptr, val, &new->list);
803 * rb_tail_page_update - move the tail page forward
805 * Returns 1 if moved tail page, 0 if someone else did.
807 static int rb_tail_page_update(struct ring_buffer_per_cpu *cpu_buffer,
808 struct buffer_page *tail_page,
809 struct buffer_page *next_page)
811 struct buffer_page *old_tail;
812 unsigned long old_entries;
813 unsigned long old_write;
817 * The tail page now needs to be moved forward.
819 * We need to reset the tail page, but without messing
820 * with possible erasing of data brought in by interrupts
821 * that have moved the tail page and are currently on it.
823 * We add a counter to the write field to denote this.
825 old_write = local_add_return(RB_WRITE_INTCNT, &next_page->write);
826 old_entries = local_add_return(RB_WRITE_INTCNT, &next_page->entries);
829 * Just make sure we have seen our old_write and synchronize
830 * with any interrupts that come in.
835 * If the tail page is still the same as what we think
836 * it is, then it is up to us to update the tail
839 if (tail_page == cpu_buffer->tail_page) {
840 /* Zero the write counter */
841 unsigned long val = old_write & ~RB_WRITE_MASK;
842 unsigned long eval = old_entries & ~RB_WRITE_MASK;
845 * This will only succeed if an interrupt did
846 * not come in and change it. In which case, we
847 * do not want to modify it.
849 * We add (void) to let the compiler know that we do not care
850 * about the return value of these functions. We use the
851 * cmpxchg to only update if an interrupt did not already
852 * do it for us. If the cmpxchg fails, we don't care.
854 (void)local_cmpxchg(&next_page->write, old_write, val);
855 (void)local_cmpxchg(&next_page->entries, old_entries, eval);
858 * No need to worry about races with clearing out the commit.
859 * it only can increment when a commit takes place. But that
860 * only happens in the outer most nested commit.
862 local_set(&next_page->page->commit, 0);
864 old_tail = cmpxchg(&cpu_buffer->tail_page,
865 tail_page, next_page);
867 if (old_tail == tail_page)
874 static int rb_check_bpage(struct ring_buffer_per_cpu *cpu_buffer,
875 struct buffer_page *bpage)
877 unsigned long val = (unsigned long)bpage;
879 if (RB_WARN_ON(cpu_buffer, val & RB_FLAG_MASK))
886 * rb_check_list - make sure a pointer to a list has the last bits zero
888 static int rb_check_list(struct ring_buffer_per_cpu *cpu_buffer,
889 struct list_head *list)
891 if (RB_WARN_ON(cpu_buffer, rb_list_head(list->prev) != list->prev))
893 if (RB_WARN_ON(cpu_buffer, rb_list_head(list->next) != list->next))
899 * check_pages - integrity check of buffer pages
900 * @cpu_buffer: CPU buffer with pages to test
902 * As a safety measure we check to make sure the data pages have not
905 static int rb_check_pages(struct ring_buffer_per_cpu *cpu_buffer)
907 struct list_head *head = cpu_buffer->pages;
908 struct buffer_page *bpage, *tmp;
910 rb_head_page_deactivate(cpu_buffer);
912 if (RB_WARN_ON(cpu_buffer, head->next->prev != head))
914 if (RB_WARN_ON(cpu_buffer, head->prev->next != head))
917 if (rb_check_list(cpu_buffer, head))
920 list_for_each_entry_safe(bpage, tmp, head, list) {
921 if (RB_WARN_ON(cpu_buffer,
922 bpage->list.next->prev != &bpage->list))
924 if (RB_WARN_ON(cpu_buffer,
925 bpage->list.prev->next != &bpage->list))
927 if (rb_check_list(cpu_buffer, &bpage->list))
931 rb_head_page_activate(cpu_buffer);
936 static int rb_allocate_pages(struct ring_buffer_per_cpu *cpu_buffer,
939 struct buffer_page *bpage, *tmp;
946 for (i = 0; i < nr_pages; i++) {
947 bpage = kzalloc_node(ALIGN(sizeof(*bpage), cache_line_size()),
948 GFP_KERNEL, cpu_to_node(cpu_buffer->cpu));
952 rb_check_bpage(cpu_buffer, bpage);
954 list_add(&bpage->list, &pages);
956 addr = __get_free_page(GFP_KERNEL);
959 bpage->page = (void *)addr;
960 rb_init_page(bpage->page);
964 * The ring buffer page list is a circular list that does not
965 * start and end with a list head. All page list items point to
968 cpu_buffer->pages = pages.next;
971 rb_check_pages(cpu_buffer);
976 list_for_each_entry_safe(bpage, tmp, &pages, list) {
977 list_del_init(&bpage->list);
978 free_buffer_page(bpage);
983 static struct ring_buffer_per_cpu *
984 rb_allocate_cpu_buffer(struct ring_buffer *buffer, int cpu)
986 struct ring_buffer_per_cpu *cpu_buffer;
987 struct buffer_page *bpage;
991 cpu_buffer = kzalloc_node(ALIGN(sizeof(*cpu_buffer), cache_line_size()),
992 GFP_KERNEL, cpu_to_node(cpu));
996 cpu_buffer->cpu = cpu;
997 cpu_buffer->buffer = buffer;
998 spin_lock_init(&cpu_buffer->reader_lock);
999 lockdep_set_class(&cpu_buffer->reader_lock, buffer->reader_lock_key);
1000 cpu_buffer->lock = (raw_spinlock_t)__RAW_SPIN_LOCK_UNLOCKED;
1002 bpage = kzalloc_node(ALIGN(sizeof(*bpage), cache_line_size()),
1003 GFP_KERNEL, cpu_to_node(cpu));
1005 goto fail_free_buffer;
1007 rb_check_bpage(cpu_buffer, bpage);
1009 cpu_buffer->reader_page = bpage;
1010 addr = __get_free_page(GFP_KERNEL);
1012 goto fail_free_reader;
1013 bpage->page = (void *)addr;
1014 rb_init_page(bpage->page);
1016 INIT_LIST_HEAD(&cpu_buffer->reader_page->list);
1018 ret = rb_allocate_pages(cpu_buffer, buffer->pages);
1020 goto fail_free_reader;
1022 cpu_buffer->head_page
1023 = list_entry(cpu_buffer->pages, struct buffer_page, list);
1024 cpu_buffer->tail_page = cpu_buffer->commit_page = cpu_buffer->head_page;
1026 rb_head_page_activate(cpu_buffer);
1031 free_buffer_page(cpu_buffer->reader_page);
1038 static void rb_free_cpu_buffer(struct ring_buffer_per_cpu *cpu_buffer)
1040 struct list_head *head = cpu_buffer->pages;
1041 struct buffer_page *bpage, *tmp;
1043 free_buffer_page(cpu_buffer->reader_page);
1045 rb_head_page_deactivate(cpu_buffer);
1048 list_for_each_entry_safe(bpage, tmp, head, list) {
1049 list_del_init(&bpage->list);
1050 free_buffer_page(bpage);
1052 bpage = list_entry(head, struct buffer_page, list);
1053 free_buffer_page(bpage);
1059 #ifdef CONFIG_HOTPLUG_CPU
1060 static int rb_cpu_notify(struct notifier_block *self,
1061 unsigned long action, void *hcpu);
1065 * ring_buffer_alloc - allocate a new ring_buffer
1066 * @size: the size in bytes per cpu that is needed.
1067 * @flags: attributes to set for the ring buffer.
1069 * Currently the only flag that is available is the RB_FL_OVERWRITE
1070 * flag. This flag means that the buffer will overwrite old data
1071 * when the buffer wraps. If this flag is not set, the buffer will
1072 * drop data when the tail hits the head.
1074 struct ring_buffer *__ring_buffer_alloc(unsigned long size, unsigned flags,
1075 struct lock_class_key *key)
1077 struct ring_buffer *buffer;
1081 /* keep it in its own cache line */
1082 buffer = kzalloc(ALIGN(sizeof(*buffer), cache_line_size()),
1087 if (!alloc_cpumask_var(&buffer->cpumask, GFP_KERNEL))
1088 goto fail_free_buffer;
1090 buffer->pages = DIV_ROUND_UP(size, BUF_PAGE_SIZE);
1091 buffer->flags = flags;
1092 buffer->clock = trace_clock_local;
1093 buffer->reader_lock_key = key;
1095 /* need at least two pages */
1096 if (buffer->pages < 2)
1100 * In case of non-hotplug cpu, if the ring-buffer is allocated
1101 * in early initcall, it will not be notified of secondary cpus.
1102 * In that off case, we need to allocate for all possible cpus.
1104 #ifdef CONFIG_HOTPLUG_CPU
1106 cpumask_copy(buffer->cpumask, cpu_online_mask);
1108 cpumask_copy(buffer->cpumask, cpu_possible_mask);
1110 buffer->cpus = nr_cpu_ids;
1112 bsize = sizeof(void *) * nr_cpu_ids;
1113 buffer->buffers = kzalloc(ALIGN(bsize, cache_line_size()),
1115 if (!buffer->buffers)
1116 goto fail_free_cpumask;
1118 for_each_buffer_cpu(buffer, cpu) {
1119 buffer->buffers[cpu] =
1120 rb_allocate_cpu_buffer(buffer, cpu);
1121 if (!buffer->buffers[cpu])
1122 goto fail_free_buffers;
1125 #ifdef CONFIG_HOTPLUG_CPU
1126 buffer->cpu_notify.notifier_call = rb_cpu_notify;
1127 buffer->cpu_notify.priority = 0;
1128 register_cpu_notifier(&buffer->cpu_notify);
1132 mutex_init(&buffer->mutex);
1137 for_each_buffer_cpu(buffer, cpu) {
1138 if (buffer->buffers[cpu])
1139 rb_free_cpu_buffer(buffer->buffers[cpu]);
1141 kfree(buffer->buffers);
1144 free_cpumask_var(buffer->cpumask);
1151 EXPORT_SYMBOL_GPL(__ring_buffer_alloc);
1154 * ring_buffer_free - free a ring buffer.
1155 * @buffer: the buffer to free.
1158 ring_buffer_free(struct ring_buffer *buffer)
1164 #ifdef CONFIG_HOTPLUG_CPU
1165 unregister_cpu_notifier(&buffer->cpu_notify);
1168 for_each_buffer_cpu(buffer, cpu)
1169 rb_free_cpu_buffer(buffer->buffers[cpu]);
1173 kfree(buffer->buffers);
1174 free_cpumask_var(buffer->cpumask);
1178 EXPORT_SYMBOL_GPL(ring_buffer_free);
1180 void ring_buffer_set_clock(struct ring_buffer *buffer,
1183 buffer->clock = clock;
1186 static void rb_reset_cpu(struct ring_buffer_per_cpu *cpu_buffer);
1189 rb_remove_pages(struct ring_buffer_per_cpu *cpu_buffer, unsigned nr_pages)
1191 struct buffer_page *bpage;
1192 struct list_head *p;
1195 atomic_inc(&cpu_buffer->record_disabled);
1196 synchronize_sched();
1198 rb_head_page_deactivate(cpu_buffer);
1200 for (i = 0; i < nr_pages; i++) {
1201 if (RB_WARN_ON(cpu_buffer, list_empty(cpu_buffer->pages)))
1203 p = cpu_buffer->pages->next;
1204 bpage = list_entry(p, struct buffer_page, list);
1205 list_del_init(&bpage->list);
1206 free_buffer_page(bpage);
1208 if (RB_WARN_ON(cpu_buffer, list_empty(cpu_buffer->pages)))
1211 rb_reset_cpu(cpu_buffer);
1213 rb_check_pages(cpu_buffer);
1215 atomic_dec(&cpu_buffer->record_disabled);
1220 rb_insert_pages(struct ring_buffer_per_cpu *cpu_buffer,
1221 struct list_head *pages, unsigned nr_pages)
1223 struct buffer_page *bpage;
1224 struct list_head *p;
1227 atomic_inc(&cpu_buffer->record_disabled);
1228 synchronize_sched();
1230 spin_lock_irq(&cpu_buffer->reader_lock);
1231 rb_head_page_deactivate(cpu_buffer);
1233 for (i = 0; i < nr_pages; i++) {
1234 if (RB_WARN_ON(cpu_buffer, list_empty(pages)))
1237 bpage = list_entry(p, struct buffer_page, list);
1238 list_del_init(&bpage->list);
1239 list_add_tail(&bpage->list, cpu_buffer->pages);
1241 rb_reset_cpu(cpu_buffer);
1242 spin_unlock_irq(&cpu_buffer->reader_lock);
1244 rb_check_pages(cpu_buffer);
1246 atomic_dec(&cpu_buffer->record_disabled);
1250 * ring_buffer_resize - resize the ring buffer
1251 * @buffer: the buffer to resize.
1252 * @size: the new size.
1254 * The tracer is responsible for making sure that the buffer is
1255 * not being used while changing the size.
1256 * Note: We may be able to change the above requirement by using
1257 * RCU synchronizations.
1259 * Minimum size is 2 * BUF_PAGE_SIZE.
1261 * Returns -1 on failure.
1263 int ring_buffer_resize(struct ring_buffer *buffer, unsigned long size)
1265 struct ring_buffer_per_cpu *cpu_buffer;
1266 unsigned nr_pages, rm_pages, new_pages;
1267 struct buffer_page *bpage, *tmp;
1268 unsigned long buffer_size;
1274 * Always succeed at resizing a non-existent buffer:
1279 size = DIV_ROUND_UP(size, BUF_PAGE_SIZE);
1280 size *= BUF_PAGE_SIZE;
1281 buffer_size = buffer->pages * BUF_PAGE_SIZE;
1283 /* we need a minimum of two pages */
1284 if (size < BUF_PAGE_SIZE * 2)
1285 size = BUF_PAGE_SIZE * 2;
1287 if (size == buffer_size)
1290 mutex_lock(&buffer->mutex);
1293 nr_pages = DIV_ROUND_UP(size, BUF_PAGE_SIZE);
1295 if (size < buffer_size) {
1297 /* easy case, just free pages */
1298 if (RB_WARN_ON(buffer, nr_pages >= buffer->pages))
1301 rm_pages = buffer->pages - nr_pages;
1303 for_each_buffer_cpu(buffer, cpu) {
1304 cpu_buffer = buffer->buffers[cpu];
1305 rb_remove_pages(cpu_buffer, rm_pages);
1311 * This is a bit more difficult. We only want to add pages
1312 * when we can allocate enough for all CPUs. We do this
1313 * by allocating all the pages and storing them on a local
1314 * link list. If we succeed in our allocation, then we
1315 * add these pages to the cpu_buffers. Otherwise we just free
1316 * them all and return -ENOMEM;
1318 if (RB_WARN_ON(buffer, nr_pages <= buffer->pages))
1321 new_pages = nr_pages - buffer->pages;
1323 for_each_buffer_cpu(buffer, cpu) {
1324 for (i = 0; i < new_pages; i++) {
1325 bpage = kzalloc_node(ALIGN(sizeof(*bpage),
1327 GFP_KERNEL, cpu_to_node(cpu));
1330 list_add(&bpage->list, &pages);
1331 addr = __get_free_page(GFP_KERNEL);
1334 bpage->page = (void *)addr;
1335 rb_init_page(bpage->page);
1339 for_each_buffer_cpu(buffer, cpu) {
1340 cpu_buffer = buffer->buffers[cpu];
1341 rb_insert_pages(cpu_buffer, &pages, new_pages);
1344 if (RB_WARN_ON(buffer, !list_empty(&pages)))
1348 buffer->pages = nr_pages;
1350 mutex_unlock(&buffer->mutex);
1355 list_for_each_entry_safe(bpage, tmp, &pages, list) {
1356 list_del_init(&bpage->list);
1357 free_buffer_page(bpage);
1360 mutex_unlock(&buffer->mutex);
1364 * Something went totally wrong, and we are too paranoid
1365 * to even clean up the mess.
1369 mutex_unlock(&buffer->mutex);
1372 EXPORT_SYMBOL_GPL(ring_buffer_resize);
1374 static inline void *
1375 __rb_data_page_index(struct buffer_data_page *bpage, unsigned index)
1377 return bpage->data + index;
1380 static inline void *__rb_page_index(struct buffer_page *bpage, unsigned index)
1382 return bpage->page->data + index;
1385 static inline struct ring_buffer_event *
1386 rb_reader_event(struct ring_buffer_per_cpu *cpu_buffer)
1388 return __rb_page_index(cpu_buffer->reader_page,
1389 cpu_buffer->reader_page->read);
1392 static inline struct ring_buffer_event *
1393 rb_iter_head_event(struct ring_buffer_iter *iter)
1395 return __rb_page_index(iter->head_page, iter->head);
1398 static inline unsigned long rb_page_write(struct buffer_page *bpage)
1400 return local_read(&bpage->write) & RB_WRITE_MASK;
1403 static inline unsigned rb_page_commit(struct buffer_page *bpage)
1405 return local_read(&bpage->page->commit);
1408 static inline unsigned long rb_page_entries(struct buffer_page *bpage)
1410 return local_read(&bpage->entries) & RB_WRITE_MASK;
1413 /* Size is determined by what has been commited */
1414 static inline unsigned rb_page_size(struct buffer_page *bpage)
1416 return rb_page_commit(bpage);
1419 static inline unsigned
1420 rb_commit_index(struct ring_buffer_per_cpu *cpu_buffer)
1422 return rb_page_commit(cpu_buffer->commit_page);
1425 static inline unsigned
1426 rb_event_index(struct ring_buffer_event *event)
1428 unsigned long addr = (unsigned long)event;
1430 return (addr & ~PAGE_MASK) - BUF_PAGE_HDR_SIZE;
1434 rb_event_is_commit(struct ring_buffer_per_cpu *cpu_buffer,
1435 struct ring_buffer_event *event)
1437 unsigned long addr = (unsigned long)event;
1438 unsigned long index;
1440 index = rb_event_index(event);
1443 return cpu_buffer->commit_page->page == (void *)addr &&
1444 rb_commit_index(cpu_buffer) == index;
1448 rb_set_commit_to_write(struct ring_buffer_per_cpu *cpu_buffer)
1450 unsigned long max_count;
1453 * We only race with interrupts and NMIs on this CPU.
1454 * If we own the commit event, then we can commit
1455 * all others that interrupted us, since the interruptions
1456 * are in stack format (they finish before they come
1457 * back to us). This allows us to do a simple loop to
1458 * assign the commit to the tail.
1461 max_count = cpu_buffer->buffer->pages * 100;
1463 while (cpu_buffer->commit_page != cpu_buffer->tail_page) {
1464 if (RB_WARN_ON(cpu_buffer, !(--max_count)))
1466 if (RB_WARN_ON(cpu_buffer,
1467 rb_is_reader_page(cpu_buffer->tail_page)))
1469 local_set(&cpu_buffer->commit_page->page->commit,
1470 rb_page_write(cpu_buffer->commit_page));
1471 rb_inc_page(cpu_buffer, &cpu_buffer->commit_page);
1472 cpu_buffer->write_stamp =
1473 cpu_buffer->commit_page->page->time_stamp;
1474 /* add barrier to keep gcc from optimizing too much */
1477 while (rb_commit_index(cpu_buffer) !=
1478 rb_page_write(cpu_buffer->commit_page)) {
1480 local_set(&cpu_buffer->commit_page->page->commit,
1481 rb_page_write(cpu_buffer->commit_page));
1482 RB_WARN_ON(cpu_buffer,
1483 local_read(&cpu_buffer->commit_page->page->commit) &
1488 /* again, keep gcc from optimizing */
1492 * If an interrupt came in just after the first while loop
1493 * and pushed the tail page forward, we will be left with
1494 * a dangling commit that will never go forward.
1496 if (unlikely(cpu_buffer->commit_page != cpu_buffer->tail_page))
1500 static void rb_reset_reader_page(struct ring_buffer_per_cpu *cpu_buffer)
1502 cpu_buffer->read_stamp = cpu_buffer->reader_page->page->time_stamp;
1503 cpu_buffer->reader_page->read = 0;
1506 static void rb_inc_iter(struct ring_buffer_iter *iter)
1508 struct ring_buffer_per_cpu *cpu_buffer = iter->cpu_buffer;
1511 * The iterator could be on the reader page (it starts there).
1512 * But the head could have moved, since the reader was
1513 * found. Check for this case and assign the iterator
1514 * to the head page instead of next.
1516 if (iter->head_page == cpu_buffer->reader_page)
1517 iter->head_page = rb_set_head_page(cpu_buffer);
1519 rb_inc_page(cpu_buffer, &iter->head_page);
1521 iter->read_stamp = iter->head_page->page->time_stamp;
1526 * ring_buffer_update_event - update event type and data
1527 * @event: the even to update
1528 * @type: the type of event
1529 * @length: the size of the event field in the ring buffer
1531 * Update the type and data fields of the event. The length
1532 * is the actual size that is written to the ring buffer,
1533 * and with this, we can determine what to place into the
1537 rb_update_event(struct ring_buffer_event *event,
1538 unsigned type, unsigned length)
1540 event->type_len = type;
1544 case RINGBUF_TYPE_PADDING:
1545 case RINGBUF_TYPE_TIME_EXTEND:
1546 case RINGBUF_TYPE_TIME_STAMP:
1550 length -= RB_EVNT_HDR_SIZE;
1551 if (length > RB_MAX_SMALL_DATA)
1552 event->array[0] = length;
1554 event->type_len = DIV_ROUND_UP(length, RB_ALIGNMENT);
1562 * rb_handle_head_page - writer hit the head page
1564 * Returns: +1 to retry page
1569 rb_handle_head_page(struct ring_buffer_per_cpu *cpu_buffer,
1570 struct buffer_page *tail_page,
1571 struct buffer_page *next_page)
1573 struct buffer_page *new_head;
1578 entries = rb_page_entries(next_page);
1581 * The hard part is here. We need to move the head
1582 * forward, and protect against both readers on
1583 * other CPUs and writers coming in via interrupts.
1585 type = rb_head_page_set_update(cpu_buffer, next_page, tail_page,
1589 * type can be one of four:
1590 * NORMAL - an interrupt already moved it for us
1591 * HEAD - we are the first to get here.
1592 * UPDATE - we are the interrupt interrupting
1594 * MOVED - a reader on another CPU moved the next
1595 * pointer to its reader page. Give up
1602 * We changed the head to UPDATE, thus
1603 * it is our responsibility to update
1606 local_add(entries, &cpu_buffer->overrun);
1609 * The entries will be zeroed out when we move the
1613 /* still more to do */
1616 case RB_PAGE_UPDATE:
1618 * This is an interrupt that interrupt the
1619 * previous update. Still more to do.
1622 case RB_PAGE_NORMAL:
1624 * An interrupt came in before the update
1625 * and processed this for us.
1626 * Nothing left to do.
1631 * The reader is on another CPU and just did
1632 * a swap with our next_page.
1637 RB_WARN_ON(cpu_buffer, 1); /* WTF??? */
1642 * Now that we are here, the old head pointer is
1643 * set to UPDATE. This will keep the reader from
1644 * swapping the head page with the reader page.
1645 * The reader (on another CPU) will spin till
1648 * We just need to protect against interrupts
1649 * doing the job. We will set the next pointer
1650 * to HEAD. After that, we set the old pointer
1651 * to NORMAL, but only if it was HEAD before.
1652 * otherwise we are an interrupt, and only
1653 * want the outer most commit to reset it.
1655 new_head = next_page;
1656 rb_inc_page(cpu_buffer, &new_head);
1658 ret = rb_head_page_set_head(cpu_buffer, new_head, next_page,
1662 * Valid returns are:
1663 * HEAD - an interrupt came in and already set it.
1664 * NORMAL - One of two things:
1665 * 1) We really set it.
1666 * 2) A bunch of interrupts came in and moved
1667 * the page forward again.
1671 case RB_PAGE_NORMAL:
1675 RB_WARN_ON(cpu_buffer, 1);
1680 * It is possible that an interrupt came in,
1681 * set the head up, then more interrupts came in
1682 * and moved it again. When we get back here,
1683 * the page would have been set to NORMAL but we
1684 * just set it back to HEAD.
1686 * How do you detect this? Well, if that happened
1687 * the tail page would have moved.
1689 if (ret == RB_PAGE_NORMAL) {
1691 * If the tail had moved passed next, then we need
1692 * to reset the pointer.
1694 if (cpu_buffer->tail_page != tail_page &&
1695 cpu_buffer->tail_page != next_page)
1696 rb_head_page_set_normal(cpu_buffer, new_head,
1702 * If this was the outer most commit (the one that
1703 * changed the original pointer from HEAD to UPDATE),
1704 * then it is up to us to reset it to NORMAL.
1706 if (type == RB_PAGE_HEAD) {
1707 ret = rb_head_page_set_normal(cpu_buffer, next_page,
1710 if (RB_WARN_ON(cpu_buffer,
1711 ret != RB_PAGE_UPDATE))
1718 static unsigned rb_calculate_event_length(unsigned length)
1720 struct ring_buffer_event event; /* Used only for sizeof array */
1722 /* zero length can cause confusions */
1726 if (length > RB_MAX_SMALL_DATA)
1727 length += sizeof(event.array[0]);
1729 length += RB_EVNT_HDR_SIZE;
1730 length = ALIGN(length, RB_ALIGNMENT);
1736 rb_reset_tail(struct ring_buffer_per_cpu *cpu_buffer,
1737 struct buffer_page *tail_page,
1738 unsigned long tail, unsigned long length)
1740 struct ring_buffer_event *event;
1743 * Only the event that crossed the page boundary
1744 * must fill the old tail_page with padding.
1746 if (tail >= BUF_PAGE_SIZE) {
1747 local_sub(length, &tail_page->write);
1751 event = __rb_page_index(tail_page, tail);
1752 kmemcheck_annotate_bitfield(event, bitfield);
1755 * If this event is bigger than the minimum size, then
1756 * we need to be careful that we don't subtract the
1757 * write counter enough to allow another writer to slip
1759 * We put in a discarded commit instead, to make sure
1760 * that this space is not used again.
1762 * If we are less than the minimum size, we don't need to
1765 if (tail > (BUF_PAGE_SIZE - RB_EVNT_MIN_SIZE)) {
1766 /* No room for any events */
1768 /* Mark the rest of the page with padding */
1769 rb_event_set_padding(event);
1771 /* Set the write back to the previous setting */
1772 local_sub(length, &tail_page->write);
1776 /* Put in a discarded event */
1777 event->array[0] = (BUF_PAGE_SIZE - tail) - RB_EVNT_HDR_SIZE;
1778 event->type_len = RINGBUF_TYPE_PADDING;
1779 /* time delta must be non zero */
1780 event->time_delta = 1;
1782 /* Set write to end of buffer */
1783 length = (tail + length) - BUF_PAGE_SIZE;
1784 local_sub(length, &tail_page->write);
1787 static struct ring_buffer_event *
1788 rb_move_tail(struct ring_buffer_per_cpu *cpu_buffer,
1789 unsigned long length, unsigned long tail,
1790 struct buffer_page *commit_page,
1791 struct buffer_page *tail_page, u64 *ts)
1793 struct ring_buffer *buffer = cpu_buffer->buffer;
1794 struct buffer_page *next_page;
1797 next_page = tail_page;
1799 rb_inc_page(cpu_buffer, &next_page);
1802 * If for some reason, we had an interrupt storm that made
1803 * it all the way around the buffer, bail, and warn
1806 if (unlikely(next_page == commit_page)) {
1807 local_inc(&cpu_buffer->commit_overrun);
1812 * This is where the fun begins!
1814 * We are fighting against races between a reader that
1815 * could be on another CPU trying to swap its reader
1816 * page with the buffer head.
1818 * We are also fighting against interrupts coming in and
1819 * moving the head or tail on us as well.
1821 * If the next page is the head page then we have filled
1822 * the buffer, unless the commit page is still on the
1825 if (rb_is_head_page(cpu_buffer, next_page, &tail_page->list)) {
1828 * If the commit is not on the reader page, then
1829 * move the header page.
1831 if (!rb_is_reader_page(cpu_buffer->commit_page)) {
1833 * If we are not in overwrite mode,
1834 * this is easy, just stop here.
1836 if (!(buffer->flags & RB_FL_OVERWRITE))
1839 ret = rb_handle_head_page(cpu_buffer,
1848 * We need to be careful here too. The
1849 * commit page could still be on the reader
1850 * page. We could have a small buffer, and
1851 * have filled up the buffer with events
1852 * from interrupts and such, and wrapped.
1854 * Note, if the tail page is also the on the
1855 * reader_page, we let it move out.
1857 if (unlikely((cpu_buffer->commit_page !=
1858 cpu_buffer->tail_page) &&
1859 (cpu_buffer->commit_page ==
1860 cpu_buffer->reader_page))) {
1861 local_inc(&cpu_buffer->commit_overrun);
1867 ret = rb_tail_page_update(cpu_buffer, tail_page, next_page);
1870 * Nested commits always have zero deltas, so
1871 * just reread the time stamp
1873 *ts = rb_time_stamp(buffer, cpu_buffer->cpu);
1874 next_page->page->time_stamp = *ts;
1879 rb_reset_tail(cpu_buffer, tail_page, tail, length);
1881 /* fail and let the caller try again */
1882 return ERR_PTR(-EAGAIN);
1886 rb_reset_tail(cpu_buffer, tail_page, tail, length);
1891 static struct ring_buffer_event *
1892 __rb_reserve_next(struct ring_buffer_per_cpu *cpu_buffer,
1893 unsigned type, unsigned long length, u64 *ts)
1895 struct buffer_page *tail_page, *commit_page;
1896 struct ring_buffer_event *event;
1897 unsigned long tail, write;
1899 commit_page = cpu_buffer->commit_page;
1900 /* we just need to protect against interrupts */
1902 tail_page = cpu_buffer->tail_page;
1903 write = local_add_return(length, &tail_page->write);
1905 /* set write to only the index of the write */
1906 write &= RB_WRITE_MASK;
1907 tail = write - length;
1909 /* See if we shot pass the end of this buffer page */
1910 if (write > BUF_PAGE_SIZE)
1911 return rb_move_tail(cpu_buffer, length, tail,
1912 commit_page, tail_page, ts);
1914 /* We reserved something on the buffer */
1916 event = __rb_page_index(tail_page, tail);
1917 kmemcheck_annotate_bitfield(event, bitfield);
1918 rb_update_event(event, type, length);
1920 /* The passed in type is zero for DATA */
1922 local_inc(&tail_page->entries);
1925 * If this is the first commit on the page, then update
1929 tail_page->page->time_stamp = *ts;
1935 rb_try_to_discard(struct ring_buffer_per_cpu *cpu_buffer,
1936 struct ring_buffer_event *event)
1938 unsigned long new_index, old_index;
1939 struct buffer_page *bpage;
1940 unsigned long index;
1943 new_index = rb_event_index(event);
1944 old_index = new_index + rb_event_length(event);
1945 addr = (unsigned long)event;
1948 bpage = cpu_buffer->tail_page;
1950 if (bpage->page == (void *)addr && rb_page_write(bpage) == old_index) {
1951 unsigned long write_mask =
1952 local_read(&bpage->write) & ~RB_WRITE_MASK;
1954 * This is on the tail page. It is possible that
1955 * a write could come in and move the tail page
1956 * and write to the next page. That is fine
1957 * because we just shorten what is on this page.
1959 old_index += write_mask;
1960 new_index += write_mask;
1961 index = local_cmpxchg(&bpage->write, old_index, new_index);
1962 if (index == old_index)
1966 /* could not discard */
1971 rb_add_time_stamp(struct ring_buffer_per_cpu *cpu_buffer,
1972 u64 *ts, u64 *delta)
1974 struct ring_buffer_event *event;
1978 if (unlikely(*delta > (1ULL << 59) && !once++)) {
1979 printk(KERN_WARNING "Delta way too big! %llu"
1980 " ts=%llu write stamp = %llu\n",
1981 (unsigned long long)*delta,
1982 (unsigned long long)*ts,
1983 (unsigned long long)cpu_buffer->write_stamp);
1988 * The delta is too big, we to add a
1991 event = __rb_reserve_next(cpu_buffer,
1992 RINGBUF_TYPE_TIME_EXTEND,
1998 if (PTR_ERR(event) == -EAGAIN)
2001 /* Only a commited time event can update the write stamp */
2002 if (rb_event_is_commit(cpu_buffer, event)) {
2004 * If this is the first on the page, then it was
2005 * updated with the page itself. Try to discard it
2006 * and if we can't just make it zero.
2008 if (rb_event_index(event)) {
2009 event->time_delta = *delta & TS_MASK;
2010 event->array[0] = *delta >> TS_SHIFT;
2012 /* try to discard, since we do not need this */
2013 if (!rb_try_to_discard(cpu_buffer, event)) {
2014 /* nope, just zero it */
2015 event->time_delta = 0;
2016 event->array[0] = 0;
2019 cpu_buffer->write_stamp = *ts;
2020 /* let the caller know this was the commit */
2023 /* Try to discard the event */
2024 if (!rb_try_to_discard(cpu_buffer, event)) {
2025 /* Darn, this is just wasted space */
2026 event->time_delta = 0;
2027 event->array[0] = 0;
2037 static void rb_start_commit(struct ring_buffer_per_cpu *cpu_buffer)
2039 local_inc(&cpu_buffer->committing);
2040 local_inc(&cpu_buffer->commits);
2043 static void rb_end_commit(struct ring_buffer_per_cpu *cpu_buffer)
2045 unsigned long commits;
2047 if (RB_WARN_ON(cpu_buffer,
2048 !local_read(&cpu_buffer->committing)))
2052 commits = local_read(&cpu_buffer->commits);
2053 /* synchronize with interrupts */
2055 if (local_read(&cpu_buffer->committing) == 1)
2056 rb_set_commit_to_write(cpu_buffer);
2058 local_dec(&cpu_buffer->committing);
2060 /* synchronize with interrupts */
2064 * Need to account for interrupts coming in between the
2065 * updating of the commit page and the clearing of the
2066 * committing counter.
2068 if (unlikely(local_read(&cpu_buffer->commits) != commits) &&
2069 !local_read(&cpu_buffer->committing)) {
2070 local_inc(&cpu_buffer->committing);
2075 static struct ring_buffer_event *
2076 rb_reserve_next_event(struct ring_buffer *buffer,
2077 struct ring_buffer_per_cpu *cpu_buffer,
2078 unsigned long length)
2080 struct ring_buffer_event *event;
2085 rb_start_commit(cpu_buffer);
2088 * Due to the ability to swap a cpu buffer from a buffer
2089 * it is possible it was swapped before we committed.
2090 * (committing stops a swap). We check for it here and
2091 * if it happened, we have to fail the write.
2094 if (unlikely(ACCESS_ONCE(cpu_buffer->buffer) != buffer)) {
2095 local_dec(&cpu_buffer->committing);
2096 local_dec(&cpu_buffer->commits);
2100 length = rb_calculate_event_length(length);
2103 * We allow for interrupts to reenter here and do a trace.
2104 * If one does, it will cause this original code to loop
2105 * back here. Even with heavy interrupts happening, this
2106 * should only happen a few times in a row. If this happens
2107 * 1000 times in a row, there must be either an interrupt
2108 * storm or we have something buggy.
2111 if (RB_WARN_ON(cpu_buffer, ++nr_loops > 1000))
2114 ts = rb_time_stamp(cpu_buffer->buffer, cpu_buffer->cpu);
2117 * Only the first commit can update the timestamp.
2118 * Yes there is a race here. If an interrupt comes in
2119 * just after the conditional and it traces too, then it
2120 * will also check the deltas. More than one timestamp may
2121 * also be made. But only the entry that did the actual
2122 * commit will be something other than zero.
2124 if (likely(cpu_buffer->tail_page == cpu_buffer->commit_page &&
2125 rb_page_write(cpu_buffer->tail_page) ==
2126 rb_commit_index(cpu_buffer))) {
2129 diff = ts - cpu_buffer->write_stamp;
2131 /* make sure this diff is calculated here */
2134 /* Did the write stamp get updated already? */
2135 if (unlikely(ts < cpu_buffer->write_stamp))
2139 if (unlikely(test_time_stamp(delta))) {
2141 commit = rb_add_time_stamp(cpu_buffer, &ts, &delta);
2142 if (commit == -EBUSY)
2145 if (commit == -EAGAIN)
2148 RB_WARN_ON(cpu_buffer, commit < 0);
2153 event = __rb_reserve_next(cpu_buffer, 0, length, &ts);
2154 if (unlikely(PTR_ERR(event) == -EAGAIN))
2160 if (!rb_event_is_commit(cpu_buffer, event))
2163 event->time_delta = delta;
2168 rb_end_commit(cpu_buffer);
2172 #ifdef CONFIG_TRACING
2174 #define TRACE_RECURSIVE_DEPTH 16
2176 static int trace_recursive_lock(void)
2178 current->trace_recursion++;
2180 if (likely(current->trace_recursion < TRACE_RECURSIVE_DEPTH))
2183 /* Disable all tracing before we do anything else */
2184 tracing_off_permanent();
2186 printk_once(KERN_WARNING "Tracing recursion: depth[%ld]:"
2187 "HC[%lu]:SC[%lu]:NMI[%lu]\n",
2188 current->trace_recursion,
2189 hardirq_count() >> HARDIRQ_SHIFT,
2190 softirq_count() >> SOFTIRQ_SHIFT,
2197 static void trace_recursive_unlock(void)
2199 WARN_ON_ONCE(!current->trace_recursion);
2201 current->trace_recursion--;
2206 #define trace_recursive_lock() (0)
2207 #define trace_recursive_unlock() do { } while (0)
2211 static DEFINE_PER_CPU(int, rb_need_resched);
2214 * ring_buffer_lock_reserve - reserve a part of the buffer
2215 * @buffer: the ring buffer to reserve from
2216 * @length: the length of the data to reserve (excluding event header)
2218 * Returns a reseverd event on the ring buffer to copy directly to.
2219 * The user of this interface will need to get the body to write into
2220 * and can use the ring_buffer_event_data() interface.
2222 * The length is the length of the data needed, not the event length
2223 * which also includes the event header.
2225 * Must be paired with ring_buffer_unlock_commit, unless NULL is returned.
2226 * If NULL is returned, then nothing has been allocated or locked.
2228 struct ring_buffer_event *
2229 ring_buffer_lock_reserve(struct ring_buffer *buffer, unsigned long length)
2231 struct ring_buffer_per_cpu *cpu_buffer;
2232 struct ring_buffer_event *event;
2235 if (ring_buffer_flags != RB_BUFFERS_ON)
2238 if (atomic_read(&buffer->record_disabled))
2241 /* If we are tracing schedule, we don't want to recurse */
2242 resched = ftrace_preempt_disable();
2244 if (trace_recursive_lock())
2247 cpu = raw_smp_processor_id();
2249 if (!cpumask_test_cpu(cpu, buffer->cpumask))
2252 cpu_buffer = buffer->buffers[cpu];
2254 if (atomic_read(&cpu_buffer->record_disabled))
2257 if (length > BUF_MAX_DATA_SIZE)
2260 event = rb_reserve_next_event(buffer, cpu_buffer, length);
2265 * Need to store resched state on this cpu.
2266 * Only the first needs to.
2269 if (preempt_count() == 1)
2270 per_cpu(rb_need_resched, cpu) = resched;
2275 trace_recursive_unlock();
2278 ftrace_preempt_enable(resched);
2281 EXPORT_SYMBOL_GPL(ring_buffer_lock_reserve);
2284 rb_update_write_stamp(struct ring_buffer_per_cpu *cpu_buffer,
2285 struct ring_buffer_event *event)
2288 * The event first in the commit queue updates the
2291 if (rb_event_is_commit(cpu_buffer, event))
2292 cpu_buffer->write_stamp += event->time_delta;
2295 static void rb_commit(struct ring_buffer_per_cpu *cpu_buffer,
2296 struct ring_buffer_event *event)
2298 local_inc(&cpu_buffer->entries);
2299 rb_update_write_stamp(cpu_buffer, event);
2300 rb_end_commit(cpu_buffer);
2304 * ring_buffer_unlock_commit - commit a reserved
2305 * @buffer: The buffer to commit to
2306 * @event: The event pointer to commit.
2308 * This commits the data to the ring buffer, and releases any locks held.
2310 * Must be paired with ring_buffer_lock_reserve.
2312 int ring_buffer_unlock_commit(struct ring_buffer *buffer,
2313 struct ring_buffer_event *event)
2315 struct ring_buffer_per_cpu *cpu_buffer;
2316 int cpu = raw_smp_processor_id();
2318 cpu_buffer = buffer->buffers[cpu];
2320 rb_commit(cpu_buffer, event);
2322 trace_recursive_unlock();
2325 * Only the last preempt count needs to restore preemption.
2327 if (preempt_count() == 1)
2328 ftrace_preempt_enable(per_cpu(rb_need_resched, cpu));
2330 preempt_enable_no_resched_notrace();
2334 EXPORT_SYMBOL_GPL(ring_buffer_unlock_commit);
2336 static inline void rb_event_discard(struct ring_buffer_event *event)
2338 /* array[0] holds the actual length for the discarded event */
2339 event->array[0] = rb_event_data_length(event) - RB_EVNT_HDR_SIZE;
2340 event->type_len = RINGBUF_TYPE_PADDING;
2341 /* time delta must be non zero */
2342 if (!event->time_delta)
2343 event->time_delta = 1;
2347 * Decrement the entries to the page that an event is on.
2348 * The event does not even need to exist, only the pointer
2349 * to the page it is on. This may only be called before the commit
2353 rb_decrement_entry(struct ring_buffer_per_cpu *cpu_buffer,
2354 struct ring_buffer_event *event)
2356 unsigned long addr = (unsigned long)event;
2357 struct buffer_page *bpage = cpu_buffer->commit_page;
2358 struct buffer_page *start;
2362 /* Do the likely case first */
2363 if (likely(bpage->page == (void *)addr)) {
2364 local_dec(&bpage->entries);
2369 * Because the commit page may be on the reader page we
2370 * start with the next page and check the end loop there.
2372 rb_inc_page(cpu_buffer, &bpage);
2375 if (bpage->page == (void *)addr) {
2376 local_dec(&bpage->entries);
2379 rb_inc_page(cpu_buffer, &bpage);
2380 } while (bpage != start);
2382 /* commit not part of this buffer?? */
2383 RB_WARN_ON(cpu_buffer, 1);
2387 * ring_buffer_commit_discard - discard an event that has not been committed
2388 * @buffer: the ring buffer
2389 * @event: non committed event to discard
2391 * Sometimes an event that is in the ring buffer needs to be ignored.
2392 * This function lets the user discard an event in the ring buffer
2393 * and then that event will not be read later.
2395 * This function only works if it is called before the the item has been
2396 * committed. It will try to free the event from the ring buffer
2397 * if another event has not been added behind it.
2399 * If another event has been added behind it, it will set the event
2400 * up as discarded, and perform the commit.
2402 * If this function is called, do not call ring_buffer_unlock_commit on
2405 void ring_buffer_discard_commit(struct ring_buffer *buffer,
2406 struct ring_buffer_event *event)
2408 struct ring_buffer_per_cpu *cpu_buffer;
2411 /* The event is discarded regardless */
2412 rb_event_discard(event);
2414 cpu = smp_processor_id();
2415 cpu_buffer = buffer->buffers[cpu];
2418 * This must only be called if the event has not been
2419 * committed yet. Thus we can assume that preemption
2420 * is still disabled.
2422 RB_WARN_ON(buffer, !local_read(&cpu_buffer->committing));
2424 rb_decrement_entry(cpu_buffer, event);
2425 if (rb_try_to_discard(cpu_buffer, event))
2429 * The commit is still visible by the reader, so we
2430 * must still update the timestamp.
2432 rb_update_write_stamp(cpu_buffer, event);
2434 rb_end_commit(cpu_buffer);
2436 trace_recursive_unlock();
2439 * Only the last preempt count needs to restore preemption.
2441 if (preempt_count() == 1)
2442 ftrace_preempt_enable(per_cpu(rb_need_resched, cpu));
2444 preempt_enable_no_resched_notrace();
2447 EXPORT_SYMBOL_GPL(ring_buffer_discard_commit);
2450 * ring_buffer_write - write data to the buffer without reserving
2451 * @buffer: The ring buffer to write to.
2452 * @length: The length of the data being written (excluding the event header)
2453 * @data: The data to write to the buffer.
2455 * This is like ring_buffer_lock_reserve and ring_buffer_unlock_commit as
2456 * one function. If you already have the data to write to the buffer, it
2457 * may be easier to simply call this function.
2459 * Note, like ring_buffer_lock_reserve, the length is the length of the data
2460 * and not the length of the event which would hold the header.
2462 int ring_buffer_write(struct ring_buffer *buffer,
2463 unsigned long length,
2466 struct ring_buffer_per_cpu *cpu_buffer;
2467 struct ring_buffer_event *event;
2472 if (ring_buffer_flags != RB_BUFFERS_ON)
2475 if (atomic_read(&buffer->record_disabled))
2478 resched = ftrace_preempt_disable();
2480 cpu = raw_smp_processor_id();
2482 if (!cpumask_test_cpu(cpu, buffer->cpumask))
2485 cpu_buffer = buffer->buffers[cpu];
2487 if (atomic_read(&cpu_buffer->record_disabled))
2490 if (length > BUF_MAX_DATA_SIZE)
2493 event = rb_reserve_next_event(buffer, cpu_buffer, length);
2497 body = rb_event_data(event);
2499 memcpy(body, data, length);
2501 rb_commit(cpu_buffer, event);
2505 ftrace_preempt_enable(resched);
2509 EXPORT_SYMBOL_GPL(ring_buffer_write);
2511 static int rb_per_cpu_empty(struct ring_buffer_per_cpu *cpu_buffer)
2513 struct buffer_page *reader = cpu_buffer->reader_page;
2514 struct buffer_page *head = rb_set_head_page(cpu_buffer);
2515 struct buffer_page *commit = cpu_buffer->commit_page;
2517 /* In case of error, head will be NULL */
2518 if (unlikely(!head))
2521 return reader->read == rb_page_commit(reader) &&
2522 (commit == reader ||
2524 head->read == rb_page_commit(commit)));
2528 * ring_buffer_record_disable - stop all writes into the buffer
2529 * @buffer: The ring buffer to stop writes to.
2531 * This prevents all writes to the buffer. Any attempt to write
2532 * to the buffer after this will fail and return NULL.
2534 * The caller should call synchronize_sched() after this.
2536 void ring_buffer_record_disable(struct ring_buffer *buffer)
2538 atomic_inc(&buffer->record_disabled);
2540 EXPORT_SYMBOL_GPL(ring_buffer_record_disable);
2543 * ring_buffer_record_enable - enable writes to the buffer
2544 * @buffer: The ring buffer to enable writes
2546 * Note, multiple disables will need the same number of enables
2547 * to truely enable the writing (much like preempt_disable).
2549 void ring_buffer_record_enable(struct ring_buffer *buffer)
2551 atomic_dec(&buffer->record_disabled);
2553 EXPORT_SYMBOL_GPL(ring_buffer_record_enable);
2556 * ring_buffer_record_disable_cpu - stop all writes into the cpu_buffer
2557 * @buffer: The ring buffer to stop writes to.
2558 * @cpu: The CPU buffer to stop
2560 * This prevents all writes to the buffer. Any attempt to write
2561 * to the buffer after this will fail and return NULL.
2563 * The caller should call synchronize_sched() after this.
2565 void ring_buffer_record_disable_cpu(struct ring_buffer *buffer, int cpu)
2567 struct ring_buffer_per_cpu *cpu_buffer;
2569 if (!cpumask_test_cpu(cpu, buffer->cpumask))
2572 cpu_buffer = buffer->buffers[cpu];
2573 atomic_inc(&cpu_buffer->record_disabled);
2575 EXPORT_SYMBOL_GPL(ring_buffer_record_disable_cpu);
2578 * ring_buffer_record_enable_cpu - enable writes to the buffer
2579 * @buffer: The ring buffer to enable writes
2580 * @cpu: The CPU to enable.
2582 * Note, multiple disables will need the same number of enables
2583 * to truely enable the writing (much like preempt_disable).
2585 void ring_buffer_record_enable_cpu(struct ring_buffer *buffer, int cpu)
2587 struct ring_buffer_per_cpu *cpu_buffer;
2589 if (!cpumask_test_cpu(cpu, buffer->cpumask))
2592 cpu_buffer = buffer->buffers[cpu];
2593 atomic_dec(&cpu_buffer->record_disabled);
2595 EXPORT_SYMBOL_GPL(ring_buffer_record_enable_cpu);
2598 * ring_buffer_entries_cpu - get the number of entries in a cpu buffer
2599 * @buffer: The ring buffer
2600 * @cpu: The per CPU buffer to get the entries from.
2602 unsigned long ring_buffer_entries_cpu(struct ring_buffer *buffer, int cpu)
2604 struct ring_buffer_per_cpu *cpu_buffer;
2607 if (!cpumask_test_cpu(cpu, buffer->cpumask))
2610 cpu_buffer = buffer->buffers[cpu];
2611 ret = (local_read(&cpu_buffer->entries) - local_read(&cpu_buffer->overrun))
2616 EXPORT_SYMBOL_GPL(ring_buffer_entries_cpu);
2619 * ring_buffer_overrun_cpu - get the number of overruns in a cpu_buffer
2620 * @buffer: The ring buffer
2621 * @cpu: The per CPU buffer to get the number of overruns from
2623 unsigned long ring_buffer_overrun_cpu(struct ring_buffer *buffer, int cpu)
2625 struct ring_buffer_per_cpu *cpu_buffer;
2628 if (!cpumask_test_cpu(cpu, buffer->cpumask))
2631 cpu_buffer = buffer->buffers[cpu];
2632 ret = local_read(&cpu_buffer->overrun);
2636 EXPORT_SYMBOL_GPL(ring_buffer_overrun_cpu);
2639 * ring_buffer_commit_overrun_cpu - get the number of overruns caused by commits
2640 * @buffer: The ring buffer
2641 * @cpu: The per CPU buffer to get the number of overruns from
2644 ring_buffer_commit_overrun_cpu(struct ring_buffer *buffer, int cpu)
2646 struct ring_buffer_per_cpu *cpu_buffer;
2649 if (!cpumask_test_cpu(cpu, buffer->cpumask))
2652 cpu_buffer = buffer->buffers[cpu];
2653 ret = local_read(&cpu_buffer->commit_overrun);
2657 EXPORT_SYMBOL_GPL(ring_buffer_commit_overrun_cpu);
2660 * ring_buffer_entries - get the number of entries in a buffer
2661 * @buffer: The ring buffer
2663 * Returns the total number of entries in the ring buffer
2666 unsigned long ring_buffer_entries(struct ring_buffer *buffer)
2668 struct ring_buffer_per_cpu *cpu_buffer;
2669 unsigned long entries = 0;
2672 /* if you care about this being correct, lock the buffer */
2673 for_each_buffer_cpu(buffer, cpu) {
2674 cpu_buffer = buffer->buffers[cpu];
2675 entries += (local_read(&cpu_buffer->entries) -
2676 local_read(&cpu_buffer->overrun)) - cpu_buffer->read;
2681 EXPORT_SYMBOL_GPL(ring_buffer_entries);
2684 * ring_buffer_overrun_cpu - get the number of overruns in buffer
2685 * @buffer: The ring buffer
2687 * Returns the total number of overruns in the ring buffer
2690 unsigned long ring_buffer_overruns(struct ring_buffer *buffer)
2692 struct ring_buffer_per_cpu *cpu_buffer;
2693 unsigned long overruns = 0;
2696 /* if you care about this being correct, lock the buffer */
2697 for_each_buffer_cpu(buffer, cpu) {
2698 cpu_buffer = buffer->buffers[cpu];
2699 overruns += local_read(&cpu_buffer->overrun);
2704 EXPORT_SYMBOL_GPL(ring_buffer_overruns);
2706 static void rb_iter_reset(struct ring_buffer_iter *iter)
2708 struct ring_buffer_per_cpu *cpu_buffer = iter->cpu_buffer;
2710 /* Iterator usage is expected to have record disabled */
2711 if (list_empty(&cpu_buffer->reader_page->list)) {
2712 iter->head_page = rb_set_head_page(cpu_buffer);
2713 if (unlikely(!iter->head_page))
2715 iter->head = iter->head_page->read;
2717 iter->head_page = cpu_buffer->reader_page;
2718 iter->head = cpu_buffer->reader_page->read;
2721 iter->read_stamp = cpu_buffer->read_stamp;
2723 iter->read_stamp = iter->head_page->page->time_stamp;
2727 * ring_buffer_iter_reset - reset an iterator
2728 * @iter: The iterator to reset
2730 * Resets the iterator, so that it will start from the beginning
2733 void ring_buffer_iter_reset(struct ring_buffer_iter *iter)
2735 struct ring_buffer_per_cpu *cpu_buffer;
2736 unsigned long flags;
2741 cpu_buffer = iter->cpu_buffer;
2743 spin_lock_irqsave(&cpu_buffer->reader_lock, flags);
2744 rb_iter_reset(iter);
2745 spin_unlock_irqrestore(&cpu_buffer->reader_lock, flags);
2747 EXPORT_SYMBOL_GPL(ring_buffer_iter_reset);
2750 * ring_buffer_iter_empty - check if an iterator has no more to read
2751 * @iter: The iterator to check
2753 int ring_buffer_iter_empty(struct ring_buffer_iter *iter)
2755 struct ring_buffer_per_cpu *cpu_buffer;
2757 cpu_buffer = iter->cpu_buffer;
2759 return iter->head_page == cpu_buffer->commit_page &&
2760 iter->head == rb_commit_index(cpu_buffer);
2762 EXPORT_SYMBOL_GPL(ring_buffer_iter_empty);
2765 rb_update_read_stamp(struct ring_buffer_per_cpu *cpu_buffer,
2766 struct ring_buffer_event *event)
2770 switch (event->type_len) {
2771 case RINGBUF_TYPE_PADDING:
2774 case RINGBUF_TYPE_TIME_EXTEND:
2775 delta = event->array[0];
2777 delta += event->time_delta;
2778 cpu_buffer->read_stamp += delta;
2781 case RINGBUF_TYPE_TIME_STAMP:
2782 /* FIXME: not implemented */
2785 case RINGBUF_TYPE_DATA:
2786 cpu_buffer->read_stamp += event->time_delta;
2796 rb_update_iter_read_stamp(struct ring_buffer_iter *iter,
2797 struct ring_buffer_event *event)
2801 switch (event->type_len) {
2802 case RINGBUF_TYPE_PADDING:
2805 case RINGBUF_TYPE_TIME_EXTEND:
2806 delta = event->array[0];
2808 delta += event->time_delta;
2809 iter->read_stamp += delta;
2812 case RINGBUF_TYPE_TIME_STAMP:
2813 /* FIXME: not implemented */
2816 case RINGBUF_TYPE_DATA:
2817 iter->read_stamp += event->time_delta;
2826 static struct buffer_page *
2827 rb_get_reader_page(struct ring_buffer_per_cpu *cpu_buffer)
2829 struct buffer_page *reader = NULL;
2830 unsigned long flags;
2834 local_irq_save(flags);
2835 __raw_spin_lock(&cpu_buffer->lock);
2839 * This should normally only loop twice. But because the
2840 * start of the reader inserts an empty page, it causes
2841 * a case where we will loop three times. There should be no
2842 * reason to loop four times (that I know of).
2844 if (RB_WARN_ON(cpu_buffer, ++nr_loops > 3)) {
2849 reader = cpu_buffer->reader_page;
2851 /* If there's more to read, return this page */
2852 if (cpu_buffer->reader_page->read < rb_page_size(reader))
2855 /* Never should we have an index greater than the size */
2856 if (RB_WARN_ON(cpu_buffer,
2857 cpu_buffer->reader_page->read > rb_page_size(reader)))
2860 /* check if we caught up to the tail */
2862 if (cpu_buffer->commit_page == cpu_buffer->reader_page)
2866 * Reset the reader page to size zero.
2868 local_set(&cpu_buffer->reader_page->write, 0);
2869 local_set(&cpu_buffer->reader_page->entries, 0);
2870 local_set(&cpu_buffer->reader_page->page->commit, 0);
2874 * Splice the empty reader page into the list around the head.
2876 reader = rb_set_head_page(cpu_buffer);
2877 cpu_buffer->reader_page->list.next = reader->list.next;
2878 cpu_buffer->reader_page->list.prev = reader->list.prev;
2881 * cpu_buffer->pages just needs to point to the buffer, it
2882 * has no specific buffer page to point to. Lets move it out
2883 * of our way so we don't accidently swap it.
2885 cpu_buffer->pages = reader->list.prev;
2887 /* The reader page will be pointing to the new head */
2888 rb_set_list_to_head(cpu_buffer, &cpu_buffer->reader_page->list);
2891 * Here's the tricky part.
2893 * We need to move the pointer past the header page.
2894 * But we can only do that if a writer is not currently
2895 * moving it. The page before the header page has the
2896 * flag bit '1' set if it is pointing to the page we want.
2897 * but if the writer is in the process of moving it
2898 * than it will be '2' or already moved '0'.
2901 ret = rb_head_page_replace(reader, cpu_buffer->reader_page);
2904 * If we did not convert it, then we must try again.
2910 * Yeah! We succeeded in replacing the page.
2912 * Now make the new head point back to the reader page.
2914 reader->list.next->prev = &cpu_buffer->reader_page->list;
2915 rb_inc_page(cpu_buffer, &cpu_buffer->head_page);
2917 /* Finally update the reader page to the new head */
2918 cpu_buffer->reader_page = reader;
2919 rb_reset_reader_page(cpu_buffer);
2924 __raw_spin_unlock(&cpu_buffer->lock);
2925 local_irq_restore(flags);
2930 static void rb_advance_reader(struct ring_buffer_per_cpu *cpu_buffer)
2932 struct ring_buffer_event *event;
2933 struct buffer_page *reader;
2936 reader = rb_get_reader_page(cpu_buffer);
2938 /* This function should not be called when buffer is empty */
2939 if (RB_WARN_ON(cpu_buffer, !reader))
2942 event = rb_reader_event(cpu_buffer);
2944 if (event->type_len <= RINGBUF_TYPE_DATA_TYPE_LEN_MAX)
2947 rb_update_read_stamp(cpu_buffer, event);
2949 length = rb_event_length(event);
2950 cpu_buffer->reader_page->read += length;
2953 static void rb_advance_iter(struct ring_buffer_iter *iter)
2955 struct ring_buffer *buffer;
2956 struct ring_buffer_per_cpu *cpu_buffer;
2957 struct ring_buffer_event *event;
2960 cpu_buffer = iter->cpu_buffer;
2961 buffer = cpu_buffer->buffer;
2964 * Check if we are at the end of the buffer.
2966 if (iter->head >= rb_page_size(iter->head_page)) {
2967 /* discarded commits can make the page empty */
2968 if (iter->head_page == cpu_buffer->commit_page)
2974 event = rb_iter_head_event(iter);
2976 length = rb_event_length(event);
2979 * This should not be called to advance the header if we are
2980 * at the tail of the buffer.
2982 if (RB_WARN_ON(cpu_buffer,
2983 (iter->head_page == cpu_buffer->commit_page) &&
2984 (iter->head + length > rb_commit_index(cpu_buffer))))
2987 rb_update_iter_read_stamp(iter, event);
2989 iter->head += length;
2991 /* check for end of page padding */
2992 if ((iter->head >= rb_page_size(iter->head_page)) &&
2993 (iter->head_page != cpu_buffer->commit_page))
2994 rb_advance_iter(iter);
2997 static struct ring_buffer_event *
2998 rb_buffer_peek(struct ring_buffer *buffer, int cpu, u64 *ts)
3000 struct ring_buffer_per_cpu *cpu_buffer;
3001 struct ring_buffer_event *event;
3002 struct buffer_page *reader;
3005 cpu_buffer = buffer->buffers[cpu];
3009 * We repeat when a timestamp is encountered. It is possible
3010 * to get multiple timestamps from an interrupt entering just
3011 * as one timestamp is about to be written, or from discarded
3012 * commits. The most that we can have is the number on a single page.
3014 if (RB_WARN_ON(cpu_buffer, ++nr_loops > RB_TIMESTAMPS_PER_PAGE))
3017 reader = rb_get_reader_page(cpu_buffer);
3021 event = rb_reader_event(cpu_buffer);
3023 switch (event->type_len) {
3024 case RINGBUF_TYPE_PADDING:
3025 if (rb_null_event(event))
3026 RB_WARN_ON(cpu_buffer, 1);
3028 * Because the writer could be discarding every
3029 * event it creates (which would probably be bad)
3030 * if we were to go back to "again" then we may never
3031 * catch up, and will trigger the warn on, or lock
3032 * the box. Return the padding, and we will release
3033 * the current locks, and try again.
3037 case RINGBUF_TYPE_TIME_EXTEND:
3038 /* Internal data, OK to advance */
3039 rb_advance_reader(cpu_buffer);
3042 case RINGBUF_TYPE_TIME_STAMP:
3043 /* FIXME: not implemented */
3044 rb_advance_reader(cpu_buffer);
3047 case RINGBUF_TYPE_DATA:
3049 *ts = cpu_buffer->read_stamp + event->time_delta;
3050 ring_buffer_normalize_time_stamp(buffer,
3051 cpu_buffer->cpu, ts);
3061 EXPORT_SYMBOL_GPL(ring_buffer_peek);
3063 static struct ring_buffer_event *
3064 rb_iter_peek(struct ring_buffer_iter *iter, u64 *ts)
3066 struct ring_buffer *buffer;
3067 struct ring_buffer_per_cpu *cpu_buffer;
3068 struct ring_buffer_event *event;
3071 if (ring_buffer_iter_empty(iter))
3074 cpu_buffer = iter->cpu_buffer;
3075 buffer = cpu_buffer->buffer;
3079 * We repeat when a timestamp is encountered.
3080 * We can get multiple timestamps by nested interrupts or also
3081 * if filtering is on (discarding commits). Since discarding
3082 * commits can be frequent we can get a lot of timestamps.
3083 * But we limit them by not adding timestamps if they begin
3084 * at the start of a page.
3086 if (RB_WARN_ON(cpu_buffer, ++nr_loops > RB_TIMESTAMPS_PER_PAGE))
3089 if (rb_per_cpu_empty(cpu_buffer))
3092 event = rb_iter_head_event(iter);
3094 switch (event->type_len) {
3095 case RINGBUF_TYPE_PADDING:
3096 if (rb_null_event(event)) {
3100 rb_advance_iter(iter);
3103 case RINGBUF_TYPE_TIME_EXTEND:
3104 /* Internal data, OK to advance */
3105 rb_advance_iter(iter);
3108 case RINGBUF_TYPE_TIME_STAMP:
3109 /* FIXME: not implemented */
3110 rb_advance_iter(iter);
3113 case RINGBUF_TYPE_DATA:
3115 *ts = iter->read_stamp + event->time_delta;
3116 ring_buffer_normalize_time_stamp(buffer,
3117 cpu_buffer->cpu, ts);
3127 EXPORT_SYMBOL_GPL(ring_buffer_iter_peek);
3129 static inline int rb_ok_to_lock(void)
3132 * If an NMI die dumps out the content of the ring buffer
3133 * do not grab locks. We also permanently disable the ring
3134 * buffer too. A one time deal is all you get from reading
3135 * the ring buffer from an NMI.
3137 if (likely(!in_nmi()))
3140 tracing_off_permanent();
3145 * ring_buffer_peek - peek at the next event to be read
3146 * @buffer: The ring buffer to read
3147 * @cpu: The cpu to peak at
3148 * @ts: The timestamp counter of this event.
3150 * This will return the event that will be read next, but does
3151 * not consume the data.
3153 struct ring_buffer_event *
3154 ring_buffer_peek(struct ring_buffer *buffer, int cpu, u64 *ts)
3156 struct ring_buffer_per_cpu *cpu_buffer = buffer->buffers[cpu];
3157 struct ring_buffer_event *event;
3158 unsigned long flags;
3161 if (!cpumask_test_cpu(cpu, buffer->cpumask))
3164 dolock = rb_ok_to_lock();
3166 local_irq_save(flags);
3168 spin_lock(&cpu_buffer->reader_lock);
3169 event = rb_buffer_peek(buffer, cpu, ts);
3170 if (event && event->type_len == RINGBUF_TYPE_PADDING)
3171 rb_advance_reader(cpu_buffer);
3173 spin_unlock(&cpu_buffer->reader_lock);
3174 local_irq_restore(flags);
3176 if (event && event->type_len == RINGBUF_TYPE_PADDING)
3183 * ring_buffer_iter_peek - peek at the next event to be read
3184 * @iter: The ring buffer iterator
3185 * @ts: The timestamp counter of this event.
3187 * This will return the event that will be read next, but does
3188 * not increment the iterator.
3190 struct ring_buffer_event *
3191 ring_buffer_iter_peek(struct ring_buffer_iter *iter, u64 *ts)
3193 struct ring_buffer_per_cpu *cpu_buffer = iter->cpu_buffer;
3194 struct ring_buffer_event *event;
3195 unsigned long flags;
3198 spin_lock_irqsave(&cpu_buffer->reader_lock, flags);
3199 event = rb_iter_peek(iter, ts);
3200 spin_unlock_irqrestore(&cpu_buffer->reader_lock, flags);
3202 if (event && event->type_len == RINGBUF_TYPE_PADDING)
3209 * ring_buffer_consume - return an event and consume it
3210 * @buffer: The ring buffer to get the next event from
3212 * Returns the next event in the ring buffer, and that event is consumed.
3213 * Meaning, that sequential reads will keep returning a different event,
3214 * and eventually empty the ring buffer if the producer is slower.
3216 struct ring_buffer_event *
3217 ring_buffer_consume(struct ring_buffer *buffer, int cpu, u64 *ts)
3219 struct ring_buffer_per_cpu *cpu_buffer;
3220 struct ring_buffer_event *event = NULL;
3221 unsigned long flags;
3224 dolock = rb_ok_to_lock();
3227 /* might be called in atomic */
3230 if (!cpumask_test_cpu(cpu, buffer->cpumask))
3233 cpu_buffer = buffer->buffers[cpu];
3234 local_irq_save(flags);
3236 spin_lock(&cpu_buffer->reader_lock);
3238 event = rb_buffer_peek(buffer, cpu, ts);
3240 rb_advance_reader(cpu_buffer);
3243 spin_unlock(&cpu_buffer->reader_lock);
3244 local_irq_restore(flags);
3249 if (event && event->type_len == RINGBUF_TYPE_PADDING)
3254 EXPORT_SYMBOL_GPL(ring_buffer_consume);
3257 * ring_buffer_read_start - start a non consuming read of the buffer
3258 * @buffer: The ring buffer to read from
3259 * @cpu: The cpu buffer to iterate over
3261 * This starts up an iteration through the buffer. It also disables
3262 * the recording to the buffer until the reading is finished.
3263 * This prevents the reading from being corrupted. This is not
3264 * a consuming read, so a producer is not expected.
3266 * Must be paired with ring_buffer_finish.
3268 struct ring_buffer_iter *
3269 ring_buffer_read_start(struct ring_buffer *buffer, int cpu)
3271 struct ring_buffer_per_cpu *cpu_buffer;
3272 struct ring_buffer_iter *iter;
3273 unsigned long flags;
3275 if (!cpumask_test_cpu(cpu, buffer->cpumask))
3278 iter = kmalloc(sizeof(*iter), GFP_KERNEL);
3282 cpu_buffer = buffer->buffers[cpu];
3284 iter->cpu_buffer = cpu_buffer;
3286 atomic_inc(&cpu_buffer->record_disabled);
3287 synchronize_sched();
3289 spin_lock_irqsave(&cpu_buffer->reader_lock, flags);
3290 __raw_spin_lock(&cpu_buffer->lock);
3291 rb_iter_reset(iter);
3292 __raw_spin_unlock(&cpu_buffer->lock);
3293 spin_unlock_irqrestore(&cpu_buffer->reader_lock, flags);
3297 EXPORT_SYMBOL_GPL(ring_buffer_read_start);
3300 * ring_buffer_finish - finish reading the iterator of the buffer
3301 * @iter: The iterator retrieved by ring_buffer_start
3303 * This re-enables the recording to the buffer, and frees the
3307 ring_buffer_read_finish(struct ring_buffer_iter *iter)
3309 struct ring_buffer_per_cpu *cpu_buffer = iter->cpu_buffer;
3311 atomic_dec(&cpu_buffer->record_disabled);
3314 EXPORT_SYMBOL_GPL(ring_buffer_read_finish);
3317 * ring_buffer_read - read the next item in the ring buffer by the iterator
3318 * @iter: The ring buffer iterator
3319 * @ts: The time stamp of the event read.
3321 * This reads the next event in the ring buffer and increments the iterator.
3323 struct ring_buffer_event *
3324 ring_buffer_read(struct ring_buffer_iter *iter, u64 *ts)
3326 struct ring_buffer_event *event;
3327 struct ring_buffer_per_cpu *cpu_buffer = iter->cpu_buffer;
3328 unsigned long flags;
3330 spin_lock_irqsave(&cpu_buffer->reader_lock, flags);
3332 event = rb_iter_peek(iter, ts);
3336 if (event->type_len == RINGBUF_TYPE_PADDING)
3339 rb_advance_iter(iter);
3341 spin_unlock_irqrestore(&cpu_buffer->reader_lock, flags);
3345 EXPORT_SYMBOL_GPL(ring_buffer_read);
3348 * ring_buffer_size - return the size of the ring buffer (in bytes)
3349 * @buffer: The ring buffer.
3351 unsigned long ring_buffer_size(struct ring_buffer *buffer)
3353 return BUF_PAGE_SIZE * buffer->pages;
3355 EXPORT_SYMBOL_GPL(ring_buffer_size);
3358 rb_reset_cpu(struct ring_buffer_per_cpu *cpu_buffer)
3360 rb_head_page_deactivate(cpu_buffer);
3362 cpu_buffer->head_page
3363 = list_entry(cpu_buffer->pages, struct buffer_page, list);
3364 local_set(&cpu_buffer->head_page->write, 0);
3365 local_set(&cpu_buffer->head_page->entries, 0);
3366 local_set(&cpu_buffer->head_page->page->commit, 0);
3368 cpu_buffer->head_page->read = 0;
3370 cpu_buffer->tail_page = cpu_buffer->head_page;
3371 cpu_buffer->commit_page = cpu_buffer->head_page;
3373 INIT_LIST_HEAD(&cpu_buffer->reader_page->list);
3374 local_set(&cpu_buffer->reader_page->write, 0);
3375 local_set(&cpu_buffer->reader_page->entries, 0);
3376 local_set(&cpu_buffer->reader_page->page->commit, 0);
3377 cpu_buffer->reader_page->read = 0;
3379 local_set(&cpu_buffer->commit_overrun, 0);
3380 local_set(&cpu_buffer->overrun, 0);
3381 local_set(&cpu_buffer->entries, 0);
3382 local_set(&cpu_buffer->committing, 0);
3383 local_set(&cpu_buffer->commits, 0);
3384 cpu_buffer->read = 0;
3386 cpu_buffer->write_stamp = 0;
3387 cpu_buffer->read_stamp = 0;
3389 rb_head_page_activate(cpu_buffer);
3393 * ring_buffer_reset_cpu - reset a ring buffer per CPU buffer
3394 * @buffer: The ring buffer to reset a per cpu buffer of
3395 * @cpu: The CPU buffer to be reset
3397 void ring_buffer_reset_cpu(struct ring_buffer *buffer, int cpu)
3399 struct ring_buffer_per_cpu *cpu_buffer = buffer->buffers[cpu];
3400 unsigned long flags;
3402 if (!cpumask_test_cpu(cpu, buffer->cpumask))
3405 atomic_inc(&cpu_buffer->record_disabled);
3407 spin_lock_irqsave(&cpu_buffer->reader_lock, flags);
3409 if (RB_WARN_ON(cpu_buffer, local_read(&cpu_buffer->committing)))
3412 __raw_spin_lock(&cpu_buffer->lock);
3414 rb_reset_cpu(cpu_buffer);
3416 __raw_spin_unlock(&cpu_buffer->lock);
3419 spin_unlock_irqrestore(&cpu_buffer->reader_lock, flags);
3421 atomic_dec(&cpu_buffer->record_disabled);
3423 EXPORT_SYMBOL_GPL(ring_buffer_reset_cpu);
3426 * ring_buffer_reset - reset a ring buffer
3427 * @buffer: The ring buffer to reset all cpu buffers
3429 void ring_buffer_reset(struct ring_buffer *buffer)
3433 for_each_buffer_cpu(buffer, cpu)
3434 ring_buffer_reset_cpu(buffer, cpu);
3436 EXPORT_SYMBOL_GPL(ring_buffer_reset);
3439 * rind_buffer_empty - is the ring buffer empty?
3440 * @buffer: The ring buffer to test
3442 int ring_buffer_empty(struct ring_buffer *buffer)
3444 struct ring_buffer_per_cpu *cpu_buffer;
3445 unsigned long flags;
3450 dolock = rb_ok_to_lock();
3452 /* yes this is racy, but if you don't like the race, lock the buffer */
3453 for_each_buffer_cpu(buffer, cpu) {
3454 cpu_buffer = buffer->buffers[cpu];
3455 local_irq_save(flags);
3457 spin_lock(&cpu_buffer->reader_lock);
3458 ret = rb_per_cpu_empty(cpu_buffer);
3460 spin_unlock(&cpu_buffer->reader_lock);
3461 local_irq_restore(flags);
3469 EXPORT_SYMBOL_GPL(ring_buffer_empty);
3472 * ring_buffer_empty_cpu - is a cpu buffer of a ring buffer empty?
3473 * @buffer: The ring buffer
3474 * @cpu: The CPU buffer to test
3476 int ring_buffer_empty_cpu(struct ring_buffer *buffer, int cpu)
3478 struct ring_buffer_per_cpu *cpu_buffer;
3479 unsigned long flags;
3483 if (!cpumask_test_cpu(cpu, buffer->cpumask))
3486 dolock = rb_ok_to_lock();
3488 cpu_buffer = buffer->buffers[cpu];
3489 local_irq_save(flags);
3491 spin_lock(&cpu_buffer->reader_lock);
3492 ret = rb_per_cpu_empty(cpu_buffer);
3494 spin_unlock(&cpu_buffer->reader_lock);
3495 local_irq_restore(flags);
3499 EXPORT_SYMBOL_GPL(ring_buffer_empty_cpu);
3502 * ring_buffer_swap_cpu - swap a CPU buffer between two ring buffers
3503 * @buffer_a: One buffer to swap with
3504 * @buffer_b: The other buffer to swap with
3506 * This function is useful for tracers that want to take a "snapshot"
3507 * of a CPU buffer and has another back up buffer lying around.
3508 * it is expected that the tracer handles the cpu buffer not being
3509 * used at the moment.
3511 int ring_buffer_swap_cpu(struct ring_buffer *buffer_a,
3512 struct ring_buffer *buffer_b, int cpu)
3514 struct ring_buffer_per_cpu *cpu_buffer_a;
3515 struct ring_buffer_per_cpu *cpu_buffer_b;
3518 if (!cpumask_test_cpu(cpu, buffer_a->cpumask) ||
3519 !cpumask_test_cpu(cpu, buffer_b->cpumask))
3522 /* At least make sure the two buffers are somewhat the same */
3523 if (buffer_a->pages != buffer_b->pages)
3528 if (ring_buffer_flags != RB_BUFFERS_ON)
3531 if (atomic_read(&buffer_a->record_disabled))
3534 if (atomic_read(&buffer_b->record_disabled))
3537 cpu_buffer_a = buffer_a->buffers[cpu];
3538 cpu_buffer_b = buffer_b->buffers[cpu];
3540 if (atomic_read(&cpu_buffer_a->record_disabled))
3543 if (atomic_read(&cpu_buffer_b->record_disabled))
3547 * We can't do a synchronize_sched here because this
3548 * function can be called in atomic context.
3549 * Normally this will be called from the same CPU as cpu.
3550 * If not it's up to the caller to protect this.
3552 atomic_inc(&cpu_buffer_a->record_disabled);
3553 atomic_inc(&cpu_buffer_b->record_disabled);
3556 if (local_read(&cpu_buffer_a->committing))
3558 if (local_read(&cpu_buffer_b->committing))
3561 buffer_a->buffers[cpu] = cpu_buffer_b;
3562 buffer_b->buffers[cpu] = cpu_buffer_a;
3564 cpu_buffer_b->buffer = buffer_a;
3565 cpu_buffer_a->buffer = buffer_b;
3570 atomic_dec(&cpu_buffer_a->record_disabled);
3571 atomic_dec(&cpu_buffer_b->record_disabled);
3575 EXPORT_SYMBOL_GPL(ring_buffer_swap_cpu);
3578 * ring_buffer_alloc_read_page - allocate a page to read from buffer
3579 * @buffer: the buffer to allocate for.
3581 * This function is used in conjunction with ring_buffer_read_page.
3582 * When reading a full page from the ring buffer, these functions
3583 * can be used to speed up the process. The calling function should
3584 * allocate a few pages first with this function. Then when it
3585 * needs to get pages from the ring buffer, it passes the result
3586 * of this function into ring_buffer_read_page, which will swap
3587 * the page that was allocated, with the read page of the buffer.
3590 * The page allocated, or NULL on error.
3592 void *ring_buffer_alloc_read_page(struct ring_buffer *buffer)
3594 struct buffer_data_page *bpage;
3597 addr = __get_free_page(GFP_KERNEL);
3601 bpage = (void *)addr;
3603 rb_init_page(bpage);
3607 EXPORT_SYMBOL_GPL(ring_buffer_alloc_read_page);
3610 * ring_buffer_free_read_page - free an allocated read page
3611 * @buffer: the buffer the page was allocate for
3612 * @data: the page to free
3614 * Free a page allocated from ring_buffer_alloc_read_page.
3616 void ring_buffer_free_read_page(struct ring_buffer *buffer, void *data)
3618 free_page((unsigned long)data);
3620 EXPORT_SYMBOL_GPL(ring_buffer_free_read_page);
3623 * ring_buffer_read_page - extract a page from the ring buffer
3624 * @buffer: buffer to extract from
3625 * @data_page: the page to use allocated from ring_buffer_alloc_read_page
3626 * @len: amount to extract
3627 * @cpu: the cpu of the buffer to extract
3628 * @full: should the extraction only happen when the page is full.
3630 * This function will pull out a page from the ring buffer and consume it.
3631 * @data_page must be the address of the variable that was returned
3632 * from ring_buffer_alloc_read_page. This is because the page might be used
3633 * to swap with a page in the ring buffer.
3636 * rpage = ring_buffer_alloc_read_page(buffer);
3639 * ret = ring_buffer_read_page(buffer, &rpage, len, cpu, 0);
3641 * process_page(rpage, ret);
3643 * When @full is set, the function will not return true unless
3644 * the writer is off the reader page.
3646 * Note: it is up to the calling functions to handle sleeps and wakeups.
3647 * The ring buffer can be used anywhere in the kernel and can not
3648 * blindly call wake_up. The layer that uses the ring buffer must be
3649 * responsible for that.
3652 * >=0 if data has been transferred, returns the offset of consumed data.
3653 * <0 if no data has been transferred.
3655 int ring_buffer_read_page(struct ring_buffer *buffer,
3656 void **data_page, size_t len, int cpu, int full)
3658 struct ring_buffer_per_cpu *cpu_buffer = buffer->buffers[cpu];
3659 struct ring_buffer_event *event;
3660 struct buffer_data_page *bpage;
3661 struct buffer_page *reader;
3662 unsigned long flags;
3663 unsigned int commit;
3668 if (!cpumask_test_cpu(cpu, buffer->cpumask))
3672 * If len is not big enough to hold the page header, then
3673 * we can not copy anything.
3675 if (len <= BUF_PAGE_HDR_SIZE)
3678 len -= BUF_PAGE_HDR_SIZE;
3687 spin_lock_irqsave(&cpu_buffer->reader_lock, flags);
3689 reader = rb_get_reader_page(cpu_buffer);
3693 event = rb_reader_event(cpu_buffer);
3695 read = reader->read;
3696 commit = rb_page_commit(reader);
3699 * If this page has been partially read or
3700 * if len is not big enough to read the rest of the page or
3701 * a writer is still on the page, then
3702 * we must copy the data from the page to the buffer.
3703 * Otherwise, we can simply swap the page with the one passed in.
3705 if (read || (len < (commit - read)) ||
3706 cpu_buffer->reader_page == cpu_buffer->commit_page) {
3707 struct buffer_data_page *rpage = cpu_buffer->reader_page->page;
3708 unsigned int rpos = read;
3709 unsigned int pos = 0;
3715 if (len > (commit - read))
3716 len = (commit - read);
3718 size = rb_event_length(event);
3723 /* save the current timestamp, since the user will need it */
3724 save_timestamp = cpu_buffer->read_stamp;
3726 /* Need to copy one event at a time */
3728 memcpy(bpage->data + pos, rpage->data + rpos, size);
3732 rb_advance_reader(cpu_buffer);
3733 rpos = reader->read;
3736 event = rb_reader_event(cpu_buffer);
3737 size = rb_event_length(event);
3738 } while (len > size);
3741 local_set(&bpage->commit, pos);
3742 bpage->time_stamp = save_timestamp;
3744 /* we copied everything to the beginning */
3747 /* update the entry counter */
3748 cpu_buffer->read += rb_page_entries(reader);
3750 /* swap the pages */
3751 rb_init_page(bpage);
3752 bpage = reader->page;
3753 reader->page = *data_page;
3754 local_set(&reader->write, 0);
3755 local_set(&reader->entries, 0);
3762 spin_unlock_irqrestore(&cpu_buffer->reader_lock, flags);
3767 EXPORT_SYMBOL_GPL(ring_buffer_read_page);
3769 #ifdef CONFIG_TRACING
3771 rb_simple_read(struct file *filp, char __user *ubuf,
3772 size_t cnt, loff_t *ppos)
3774 unsigned long *p = filp->private_data;
3778 if (test_bit(RB_BUFFERS_DISABLED_BIT, p))
3779 r = sprintf(buf, "permanently disabled\n");
3781 r = sprintf(buf, "%d\n", test_bit(RB_BUFFERS_ON_BIT, p));
3783 return simple_read_from_buffer(ubuf, cnt, ppos, buf, r);
3787 rb_simple_write(struct file *filp, const char __user *ubuf,
3788 size_t cnt, loff_t *ppos)
3790 unsigned long *p = filp->private_data;
3795 if (cnt >= sizeof(buf))
3798 if (copy_from_user(&buf, ubuf, cnt))
3803 ret = strict_strtoul(buf, 10, &val);
3808 set_bit(RB_BUFFERS_ON_BIT, p);
3810 clear_bit(RB_BUFFERS_ON_BIT, p);
3817 static const struct file_operations rb_simple_fops = {
3818 .open = tracing_open_generic,
3819 .read = rb_simple_read,
3820 .write = rb_simple_write,
3824 static __init int rb_init_debugfs(void)
3826 struct dentry *d_tracer;
3828 d_tracer = tracing_init_dentry();
3830 trace_create_file("tracing_on", 0644, d_tracer,
3831 &ring_buffer_flags, &rb_simple_fops);
3836 fs_initcall(rb_init_debugfs);
3839 #ifdef CONFIG_HOTPLUG_CPU
3840 static int rb_cpu_notify(struct notifier_block *self,
3841 unsigned long action, void *hcpu)
3843 struct ring_buffer *buffer =
3844 container_of(self, struct ring_buffer, cpu_notify);
3845 long cpu = (long)hcpu;
3848 case CPU_UP_PREPARE:
3849 case CPU_UP_PREPARE_FROZEN:
3850 if (cpumask_test_cpu(cpu, buffer->cpumask))
3853 buffer->buffers[cpu] =
3854 rb_allocate_cpu_buffer(buffer, cpu);
3855 if (!buffer->buffers[cpu]) {
3856 WARN(1, "failed to allocate ring buffer on CPU %ld\n",
3861 cpumask_set_cpu(cpu, buffer->cpumask);
3863 case CPU_DOWN_PREPARE:
3864 case CPU_DOWN_PREPARE_FROZEN:
3867 * If we were to free the buffer, then the user would
3868 * lose any trace that was in the buffer.