4 * Copyright (C) 2008 Steven Rostedt <srostedt@redhat.com>
6 #include <linux/ftrace_event.h>
7 #include <linux/ring_buffer.h>
8 #include <linux/trace_clock.h>
9 #include <linux/trace_seq.h>
10 #include <linux/spinlock.h>
11 #include <linux/irq_work.h>
12 #include <linux/debugfs.h>
13 #include <linux/uaccess.h>
14 #include <linux/hardirq.h>
15 #include <linux/kthread.h> /* for self test */
16 #include <linux/kmemcheck.h>
17 #include <linux/module.h>
18 #include <linux/percpu.h>
19 #include <linux/mutex.h>
20 #include <linux/delay.h>
21 #include <linux/slab.h>
22 #include <linux/init.h>
23 #include <linux/hash.h>
24 #include <linux/list.h>
25 #include <linux/cpu.h>
28 #include <asm/local.h>
30 static void update_pages_handler(struct work_struct
*work
);
33 * The ring buffer header is special. We must manually up keep it.
35 int ring_buffer_print_entry_header(struct trace_seq
*s
)
39 ret
= trace_seq_printf(s
, "# compressed entry header\n");
40 ret
= trace_seq_printf(s
, "\ttype_len : 5 bits\n");
41 ret
= trace_seq_printf(s
, "\ttime_delta : 27 bits\n");
42 ret
= trace_seq_printf(s
, "\tarray : 32 bits\n");
43 ret
= trace_seq_printf(s
, "\n");
44 ret
= trace_seq_printf(s
, "\tpadding : type == %d\n",
45 RINGBUF_TYPE_PADDING
);
46 ret
= trace_seq_printf(s
, "\ttime_extend : type == %d\n",
47 RINGBUF_TYPE_TIME_EXTEND
);
48 ret
= trace_seq_printf(s
, "\tdata max type_len == %d\n",
49 RINGBUF_TYPE_DATA_TYPE_LEN_MAX
);
55 * The ring buffer is made up of a list of pages. A separate list of pages is
56 * allocated for each CPU. A writer may only write to a buffer that is
57 * associated with the CPU it is currently executing on. A reader may read
58 * from any per cpu buffer.
60 * The reader is special. For each per cpu buffer, the reader has its own
61 * reader page. When a reader has read the entire reader page, this reader
62 * page is swapped with another page in the ring buffer.
64 * Now, as long as the writer is off the reader page, the reader can do what
65 * ever it wants with that page. The writer will never write to that page
66 * again (as long as it is out of the ring buffer).
68 * Here's some silly ASCII art.
71 * |reader| RING BUFFER
73 * +------+ +---+ +---+ +---+
82 * |reader| RING BUFFER
83 * |page |------------------v
84 * +------+ +---+ +---+ +---+
93 * |reader| RING BUFFER
94 * |page |------------------v
95 * +------+ +---+ +---+ +---+
100 * +------------------------------+
104 * |buffer| RING BUFFER
105 * |page |------------------v
106 * +------+ +---+ +---+ +---+
108 * | New +---+ +---+ +---+
111 * +------------------------------+
114 * After we make this swap, the reader can hand this page off to the splice
115 * code and be done with it. It can even allocate a new page if it needs to
116 * and swap that into the ring buffer.
118 * We will be using cmpxchg soon to make all this lockless.
123 * A fast way to enable or disable all ring buffers is to
124 * call tracing_on or tracing_off. Turning off the ring buffers
125 * prevents all ring buffers from being recorded to.
126 * Turning this switch on, makes it OK to write to the
127 * ring buffer, if the ring buffer is enabled itself.
129 * There's three layers that must be on in order to write
130 * to the ring buffer.
132 * 1) This global flag must be set.
133 * 2) The ring buffer must be enabled for recording.
134 * 3) The per cpu buffer must be enabled for recording.
136 * In case of an anomaly, this global flag has a bit set that
137 * will permantly disable all ring buffers.
141 * Global flag to disable all recording to ring buffers
142 * This has two bits: ON, DISABLED
146 * 0 0 : ring buffers are off
147 * 1 0 : ring buffers are on
148 * X 1 : ring buffers are permanently disabled
152 RB_BUFFERS_ON_BIT
= 0,
153 RB_BUFFERS_DISABLED_BIT
= 1,
157 RB_BUFFERS_ON
= 1 << RB_BUFFERS_ON_BIT
,
158 RB_BUFFERS_DISABLED
= 1 << RB_BUFFERS_DISABLED_BIT
,
161 static unsigned long ring_buffer_flags __read_mostly
= RB_BUFFERS_ON
;
163 /* Used for individual buffers (after the counter) */
164 #define RB_BUFFER_OFF (1 << 20)
166 #define BUF_PAGE_HDR_SIZE offsetof(struct buffer_data_page, data)
169 * tracing_off_permanent - permanently disable ring buffers
171 * This function, once called, will disable all ring buffers
174 void tracing_off_permanent(void)
176 set_bit(RB_BUFFERS_DISABLED_BIT
, &ring_buffer_flags
);
179 #define RB_EVNT_HDR_SIZE (offsetof(struct ring_buffer_event, array))
180 #define RB_ALIGNMENT 4U
181 #define RB_MAX_SMALL_DATA (RB_ALIGNMENT * RINGBUF_TYPE_DATA_TYPE_LEN_MAX)
182 #define RB_EVNT_MIN_SIZE 8U /* two 32bit words */
184 #ifndef CONFIG_HAVE_64BIT_ALIGNED_ACCESS
185 # define RB_FORCE_8BYTE_ALIGNMENT 0
186 # define RB_ARCH_ALIGNMENT RB_ALIGNMENT
188 # define RB_FORCE_8BYTE_ALIGNMENT 1
189 # define RB_ARCH_ALIGNMENT 8U
192 #define RB_ALIGN_DATA __aligned(RB_ARCH_ALIGNMENT)
194 /* define RINGBUF_TYPE_DATA for 'case RINGBUF_TYPE_DATA:' */
195 #define RINGBUF_TYPE_DATA 0 ... RINGBUF_TYPE_DATA_TYPE_LEN_MAX
198 RB_LEN_TIME_EXTEND
= 8,
199 RB_LEN_TIME_STAMP
= 16,
202 #define skip_time_extend(event) \
203 ((struct ring_buffer_event *)((char *)event + RB_LEN_TIME_EXTEND))
205 static inline int rb_null_event(struct ring_buffer_event
*event
)
207 return event
->type_len
== RINGBUF_TYPE_PADDING
&& !event
->time_delta
;
210 static void rb_event_set_padding(struct ring_buffer_event
*event
)
212 /* padding has a NULL time_delta */
213 event
->type_len
= RINGBUF_TYPE_PADDING
;
214 event
->time_delta
= 0;
218 rb_event_data_length(struct ring_buffer_event
*event
)
223 length
= event
->type_len
* RB_ALIGNMENT
;
225 length
= event
->array
[0];
226 return length
+ RB_EVNT_HDR_SIZE
;
230 * Return the length of the given event. Will return
231 * the length of the time extend if the event is a
234 static inline unsigned
235 rb_event_length(struct ring_buffer_event
*event
)
237 switch (event
->type_len
) {
238 case RINGBUF_TYPE_PADDING
:
239 if (rb_null_event(event
))
242 return event
->array
[0] + RB_EVNT_HDR_SIZE
;
244 case RINGBUF_TYPE_TIME_EXTEND
:
245 return RB_LEN_TIME_EXTEND
;
247 case RINGBUF_TYPE_TIME_STAMP
:
248 return RB_LEN_TIME_STAMP
;
250 case RINGBUF_TYPE_DATA
:
251 return rb_event_data_length(event
);
260 * Return total length of time extend and data,
261 * or just the event length for all other events.
263 static inline unsigned
264 rb_event_ts_length(struct ring_buffer_event
*event
)
268 if (event
->type_len
== RINGBUF_TYPE_TIME_EXTEND
) {
269 /* time extends include the data event after it */
270 len
= RB_LEN_TIME_EXTEND
;
271 event
= skip_time_extend(event
);
273 return len
+ rb_event_length(event
);
277 * ring_buffer_event_length - return the length of the event
278 * @event: the event to get the length of
280 * Returns the size of the data load of a data event.
281 * If the event is something other than a data event, it
282 * returns the size of the event itself. With the exception
283 * of a TIME EXTEND, where it still returns the size of the
284 * data load of the data event after it.
286 unsigned ring_buffer_event_length(struct ring_buffer_event
*event
)
290 if (event
->type_len
== RINGBUF_TYPE_TIME_EXTEND
)
291 event
= skip_time_extend(event
);
293 length
= rb_event_length(event
);
294 if (event
->type_len
> RINGBUF_TYPE_DATA_TYPE_LEN_MAX
)
296 length
-= RB_EVNT_HDR_SIZE
;
297 if (length
> RB_MAX_SMALL_DATA
+ sizeof(event
->array
[0]))
298 length
-= sizeof(event
->array
[0]);
301 EXPORT_SYMBOL_GPL(ring_buffer_event_length
);
303 /* inline for ring buffer fast paths */
305 rb_event_data(struct ring_buffer_event
*event
)
307 if (event
->type_len
== RINGBUF_TYPE_TIME_EXTEND
)
308 event
= skip_time_extend(event
);
309 BUG_ON(event
->type_len
> RINGBUF_TYPE_DATA_TYPE_LEN_MAX
);
310 /* If length is in len field, then array[0] has the data */
312 return (void *)&event
->array
[0];
313 /* Otherwise length is in array[0] and array[1] has the data */
314 return (void *)&event
->array
[1];
318 * ring_buffer_event_data - return the data of the event
319 * @event: the event to get the data from
321 void *ring_buffer_event_data(struct ring_buffer_event
*event
)
323 return rb_event_data(event
);
325 EXPORT_SYMBOL_GPL(ring_buffer_event_data
);
327 #define for_each_buffer_cpu(buffer, cpu) \
328 for_each_cpu(cpu, buffer->cpumask)
331 #define TS_MASK ((1ULL << TS_SHIFT) - 1)
332 #define TS_DELTA_TEST (~TS_MASK)
334 /* Flag when events were overwritten */
335 #define RB_MISSED_EVENTS (1 << 31)
336 /* Missed count stored at end */
337 #define RB_MISSED_STORED (1 << 30)
339 struct buffer_data_page
{
340 u64 time_stamp
; /* page time stamp */
341 local_t commit
; /* write committed index */
342 unsigned char data
[] RB_ALIGN_DATA
; /* data of buffer page */
346 * Note, the buffer_page list must be first. The buffer pages
347 * are allocated in cache lines, which means that each buffer
348 * page will be at the beginning of a cache line, and thus
349 * the least significant bits will be zero. We use this to
350 * add flags in the list struct pointers, to make the ring buffer
354 struct list_head list
; /* list of buffer pages */
355 local_t write
; /* index for next write */
356 unsigned read
; /* index for next read */
357 local_t entries
; /* entries on this page */
358 unsigned long real_end
; /* real end of data */
359 struct buffer_data_page
*page
; /* Actual data page */
363 * The buffer page counters, write and entries, must be reset
364 * atomically when crossing page boundaries. To synchronize this
365 * update, two counters are inserted into the number. One is
366 * the actual counter for the write position or count on the page.
368 * The other is a counter of updaters. Before an update happens
369 * the update partition of the counter is incremented. This will
370 * allow the updater to update the counter atomically.
372 * The counter is 20 bits, and the state data is 12.
374 #define RB_WRITE_MASK 0xfffff
375 #define RB_WRITE_INTCNT (1 << 20)
377 static void rb_init_page(struct buffer_data_page
*bpage
)
379 local_set(&bpage
->commit
, 0);
383 * ring_buffer_page_len - the size of data on the page.
384 * @page: The page to read
386 * Returns the amount of data on the page, including buffer page header.
388 size_t ring_buffer_page_len(void *page
)
390 return local_read(&((struct buffer_data_page
*)page
)->commit
)
395 * Also stolen from mm/slob.c. Thanks to Mathieu Desnoyers for pointing
398 static void free_buffer_page(struct buffer_page
*bpage
)
400 free_page((unsigned long)bpage
->page
);
405 * We need to fit the time_stamp delta into 27 bits.
407 static inline int test_time_stamp(u64 delta
)
409 if (delta
& TS_DELTA_TEST
)
414 #define BUF_PAGE_SIZE (PAGE_SIZE - BUF_PAGE_HDR_SIZE)
416 /* Max payload is BUF_PAGE_SIZE - header (8bytes) */
417 #define BUF_MAX_DATA_SIZE (BUF_PAGE_SIZE - (sizeof(u32) * 2))
419 int ring_buffer_print_page_header(struct trace_seq
*s
)
421 struct buffer_data_page field
;
424 ret
= trace_seq_printf(s
, "\tfield: u64 timestamp;\t"
425 "offset:0;\tsize:%u;\tsigned:%u;\n",
426 (unsigned int)sizeof(field
.time_stamp
),
427 (unsigned int)is_signed_type(u64
));
429 ret
= trace_seq_printf(s
, "\tfield: local_t commit;\t"
430 "offset:%u;\tsize:%u;\tsigned:%u;\n",
431 (unsigned int)offsetof(typeof(field
), commit
),
432 (unsigned int)sizeof(field
.commit
),
433 (unsigned int)is_signed_type(long));
435 ret
= trace_seq_printf(s
, "\tfield: int overwrite;\t"
436 "offset:%u;\tsize:%u;\tsigned:%u;\n",
437 (unsigned int)offsetof(typeof(field
), commit
),
439 (unsigned int)is_signed_type(long));
441 ret
= trace_seq_printf(s
, "\tfield: char data;\t"
442 "offset:%u;\tsize:%u;\tsigned:%u;\n",
443 (unsigned int)offsetof(typeof(field
), data
),
444 (unsigned int)BUF_PAGE_SIZE
,
445 (unsigned int)is_signed_type(char));
451 struct irq_work work
;
452 wait_queue_head_t waiters
;
453 bool waiters_pending
;
457 * head_page == tail_page && head == tail then buffer is empty.
459 struct ring_buffer_per_cpu
{
461 atomic_t record_disabled
;
462 struct ring_buffer
*buffer
;
463 raw_spinlock_t reader_lock
; /* serialize readers */
464 arch_spinlock_t lock
;
465 struct lock_class_key lock_key
;
466 unsigned int nr_pages
;
467 struct list_head
*pages
;
468 struct buffer_page
*head_page
; /* read from head */
469 struct buffer_page
*tail_page
; /* write to tail */
470 struct buffer_page
*commit_page
; /* committed pages */
471 struct buffer_page
*reader_page
;
472 unsigned long lost_events
;
473 unsigned long last_overrun
;
474 local_t entries_bytes
;
477 local_t commit_overrun
;
478 local_t dropped_events
;
482 unsigned long read_bytes
;
485 /* ring buffer pages to update, > 0 to add, < 0 to remove */
486 int nr_pages_to_update
;
487 struct list_head new_pages
; /* new pages to add */
488 struct work_struct update_pages_work
;
489 struct completion update_done
;
491 struct rb_irq_work irq_work
;
497 atomic_t record_disabled
;
498 atomic_t resize_disabled
;
499 cpumask_var_t cpumask
;
501 struct lock_class_key
*reader_lock_key
;
505 struct ring_buffer_per_cpu
**buffers
;
507 #ifdef CONFIG_HOTPLUG_CPU
508 struct notifier_block cpu_notify
;
512 struct rb_irq_work irq_work
;
515 struct ring_buffer_iter
{
516 struct ring_buffer_per_cpu
*cpu_buffer
;
518 struct buffer_page
*head_page
;
519 struct buffer_page
*cache_reader_page
;
520 unsigned long cache_read
;
525 * rb_wake_up_waiters - wake up tasks waiting for ring buffer input
527 * Schedules a delayed work to wake up any task that is blocked on the
528 * ring buffer waiters queue.
530 static void rb_wake_up_waiters(struct irq_work
*work
)
532 struct rb_irq_work
*rbwork
= container_of(work
, struct rb_irq_work
, work
);
534 wake_up_all(&rbwork
->waiters
);
538 * ring_buffer_wait - wait for input to the ring buffer
539 * @buffer: buffer to wait on
540 * @cpu: the cpu buffer to wait on
542 * If @cpu == RING_BUFFER_ALL_CPUS then the task will wake up as soon
543 * as data is added to any of the @buffer's cpu buffers. Otherwise
544 * it will wait for data to be added to a specific cpu buffer.
546 int ring_buffer_wait(struct ring_buffer
*buffer
, int cpu
)
548 struct ring_buffer_per_cpu
*cpu_buffer
;
550 struct rb_irq_work
*work
;
553 * Depending on what the caller is waiting for, either any
554 * data in any cpu buffer, or a specific buffer, put the
555 * caller on the appropriate wait queue.
557 if (cpu
== RING_BUFFER_ALL_CPUS
)
558 work
= &buffer
->irq_work
;
560 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
562 cpu_buffer
= buffer
->buffers
[cpu
];
563 work
= &cpu_buffer
->irq_work
;
567 prepare_to_wait(&work
->waiters
, &wait
, TASK_INTERRUPTIBLE
);
570 * The events can happen in critical sections where
571 * checking a work queue can cause deadlocks.
572 * After adding a task to the queue, this flag is set
573 * only to notify events to try to wake up the queue
576 * We don't clear it even if the buffer is no longer
577 * empty. The flag only causes the next event to run
578 * irq_work to do the work queue wake up. The worse
579 * that can happen if we race with !trace_empty() is that
580 * an event will cause an irq_work to try to wake up
583 * There's no reason to protect this flag either, as
584 * the work queue and irq_work logic will do the necessary
585 * synchronization for the wake ups. The only thing
586 * that is necessary is that the wake up happens after
587 * a task has been queued. It's OK for spurious wake ups.
589 work
->waiters_pending
= true;
591 if ((cpu
== RING_BUFFER_ALL_CPUS
&& ring_buffer_empty(buffer
)) ||
592 (cpu
!= RING_BUFFER_ALL_CPUS
&& ring_buffer_empty_cpu(buffer
, cpu
)))
595 finish_wait(&work
->waiters
, &wait
);
600 * ring_buffer_poll_wait - poll on buffer input
601 * @buffer: buffer to wait on
602 * @cpu: the cpu buffer to wait on
603 * @filp: the file descriptor
604 * @poll_table: The poll descriptor
606 * If @cpu == RING_BUFFER_ALL_CPUS then the task will wake up as soon
607 * as data is added to any of the @buffer's cpu buffers. Otherwise
608 * it will wait for data to be added to a specific cpu buffer.
610 * Returns POLLIN | POLLRDNORM if data exists in the buffers,
613 int ring_buffer_poll_wait(struct ring_buffer
*buffer
, int cpu
,
614 struct file
*filp
, poll_table
*poll_table
)
616 struct ring_buffer_per_cpu
*cpu_buffer
;
617 struct rb_irq_work
*work
;
619 if (cpu
== RING_BUFFER_ALL_CPUS
)
620 work
= &buffer
->irq_work
;
622 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
625 cpu_buffer
= buffer
->buffers
[cpu
];
626 work
= &cpu_buffer
->irq_work
;
629 work
->waiters_pending
= true;
630 poll_wait(filp
, &work
->waiters
, poll_table
);
632 if ((cpu
== RING_BUFFER_ALL_CPUS
&& !ring_buffer_empty(buffer
)) ||
633 (cpu
!= RING_BUFFER_ALL_CPUS
&& !ring_buffer_empty_cpu(buffer
, cpu
)))
634 return POLLIN
| POLLRDNORM
;
638 /* buffer may be either ring_buffer or ring_buffer_per_cpu */
639 #define RB_WARN_ON(b, cond) \
641 int _____ret = unlikely(cond); \
643 if (__same_type(*(b), struct ring_buffer_per_cpu)) { \
644 struct ring_buffer_per_cpu *__b = \
646 atomic_inc(&__b->buffer->record_disabled); \
648 atomic_inc(&b->record_disabled); \
654 /* Up this if you want to test the TIME_EXTENTS and normalization */
655 #define DEBUG_SHIFT 0
657 static inline u64
rb_time_stamp(struct ring_buffer
*buffer
)
659 /* shift to debug/test normalization and TIME_EXTENTS */
660 return buffer
->clock() << DEBUG_SHIFT
;
663 u64
ring_buffer_time_stamp(struct ring_buffer
*buffer
, int cpu
)
667 preempt_disable_notrace();
668 time
= rb_time_stamp(buffer
);
669 preempt_enable_no_resched_notrace();
673 EXPORT_SYMBOL_GPL(ring_buffer_time_stamp
);
675 void ring_buffer_normalize_time_stamp(struct ring_buffer
*buffer
,
678 /* Just stupid testing the normalize function and deltas */
681 EXPORT_SYMBOL_GPL(ring_buffer_normalize_time_stamp
);
684 * Making the ring buffer lockless makes things tricky.
685 * Although writes only happen on the CPU that they are on,
686 * and they only need to worry about interrupts. Reads can
689 * The reader page is always off the ring buffer, but when the
690 * reader finishes with a page, it needs to swap its page with
691 * a new one from the buffer. The reader needs to take from
692 * the head (writes go to the tail). But if a writer is in overwrite
693 * mode and wraps, it must push the head page forward.
695 * Here lies the problem.
697 * The reader must be careful to replace only the head page, and
698 * not another one. As described at the top of the file in the
699 * ASCII art, the reader sets its old page to point to the next
700 * page after head. It then sets the page after head to point to
701 * the old reader page. But if the writer moves the head page
702 * during this operation, the reader could end up with the tail.
704 * We use cmpxchg to help prevent this race. We also do something
705 * special with the page before head. We set the LSB to 1.
707 * When the writer must push the page forward, it will clear the
708 * bit that points to the head page, move the head, and then set
709 * the bit that points to the new head page.
711 * We also don't want an interrupt coming in and moving the head
712 * page on another writer. Thus we use the second LSB to catch
715 * head->list->prev->next bit 1 bit 0
718 * Points to head page 0 1
721 * Note we can not trust the prev pointer of the head page, because:
723 * +----+ +-----+ +-----+
724 * | |------>| T |---X--->| N |
726 * +----+ +-----+ +-----+
729 * +----------| R |----------+ |
733 * Key: ---X--> HEAD flag set in pointer
738 * (see __rb_reserve_next() to see where this happens)
740 * What the above shows is that the reader just swapped out
741 * the reader page with a page in the buffer, but before it
742 * could make the new header point back to the new page added
743 * it was preempted by a writer. The writer moved forward onto
744 * the new page added by the reader and is about to move forward
747 * You can see, it is legitimate for the previous pointer of
748 * the head (or any page) not to point back to itself. But only
752 #define RB_PAGE_NORMAL 0UL
753 #define RB_PAGE_HEAD 1UL
754 #define RB_PAGE_UPDATE 2UL
757 #define RB_FLAG_MASK 3UL
759 /* PAGE_MOVED is not part of the mask */
760 #define RB_PAGE_MOVED 4UL
763 * rb_list_head - remove any bit
765 static struct list_head
*rb_list_head(struct list_head
*list
)
767 unsigned long val
= (unsigned long)list
;
769 return (struct list_head
*)(val
& ~RB_FLAG_MASK
);
773 * rb_is_head_page - test if the given page is the head page
775 * Because the reader may move the head_page pointer, we can
776 * not trust what the head page is (it may be pointing to
777 * the reader page). But if the next page is a header page,
778 * its flags will be non zero.
781 rb_is_head_page(struct ring_buffer_per_cpu
*cpu_buffer
,
782 struct buffer_page
*page
, struct list_head
*list
)
786 val
= (unsigned long)list
->next
;
788 if ((val
& ~RB_FLAG_MASK
) != (unsigned long)&page
->list
)
789 return RB_PAGE_MOVED
;
791 return val
& RB_FLAG_MASK
;
797 * The unique thing about the reader page, is that, if the
798 * writer is ever on it, the previous pointer never points
799 * back to the reader page.
801 static int rb_is_reader_page(struct buffer_page
*page
)
803 struct list_head
*list
= page
->list
.prev
;
805 return rb_list_head(list
->next
) != &page
->list
;
809 * rb_set_list_to_head - set a list_head to be pointing to head.
811 static void rb_set_list_to_head(struct ring_buffer_per_cpu
*cpu_buffer
,
812 struct list_head
*list
)
816 ptr
= (unsigned long *)&list
->next
;
817 *ptr
|= RB_PAGE_HEAD
;
818 *ptr
&= ~RB_PAGE_UPDATE
;
822 * rb_head_page_activate - sets up head page
824 static void rb_head_page_activate(struct ring_buffer_per_cpu
*cpu_buffer
)
826 struct buffer_page
*head
;
828 head
= cpu_buffer
->head_page
;
833 * Set the previous list pointer to have the HEAD flag.
835 rb_set_list_to_head(cpu_buffer
, head
->list
.prev
);
838 static void rb_list_head_clear(struct list_head
*list
)
840 unsigned long *ptr
= (unsigned long *)&list
->next
;
842 *ptr
&= ~RB_FLAG_MASK
;
846 * rb_head_page_dactivate - clears head page ptr (for free list)
849 rb_head_page_deactivate(struct ring_buffer_per_cpu
*cpu_buffer
)
851 struct list_head
*hd
;
853 /* Go through the whole list and clear any pointers found. */
854 rb_list_head_clear(cpu_buffer
->pages
);
856 list_for_each(hd
, cpu_buffer
->pages
)
857 rb_list_head_clear(hd
);
860 static int rb_head_page_set(struct ring_buffer_per_cpu
*cpu_buffer
,
861 struct buffer_page
*head
,
862 struct buffer_page
*prev
,
863 int old_flag
, int new_flag
)
865 struct list_head
*list
;
866 unsigned long val
= (unsigned long)&head
->list
;
871 val
&= ~RB_FLAG_MASK
;
873 ret
= cmpxchg((unsigned long *)&list
->next
,
874 val
| old_flag
, val
| new_flag
);
876 /* check if the reader took the page */
877 if ((ret
& ~RB_FLAG_MASK
) != val
)
878 return RB_PAGE_MOVED
;
880 return ret
& RB_FLAG_MASK
;
883 static int rb_head_page_set_update(struct ring_buffer_per_cpu
*cpu_buffer
,
884 struct buffer_page
*head
,
885 struct buffer_page
*prev
,
888 return rb_head_page_set(cpu_buffer
, head
, prev
,
889 old_flag
, RB_PAGE_UPDATE
);
892 static int rb_head_page_set_head(struct ring_buffer_per_cpu
*cpu_buffer
,
893 struct buffer_page
*head
,
894 struct buffer_page
*prev
,
897 return rb_head_page_set(cpu_buffer
, head
, prev
,
898 old_flag
, RB_PAGE_HEAD
);
901 static int rb_head_page_set_normal(struct ring_buffer_per_cpu
*cpu_buffer
,
902 struct buffer_page
*head
,
903 struct buffer_page
*prev
,
906 return rb_head_page_set(cpu_buffer
, head
, prev
,
907 old_flag
, RB_PAGE_NORMAL
);
910 static inline void rb_inc_page(struct ring_buffer_per_cpu
*cpu_buffer
,
911 struct buffer_page
**bpage
)
913 struct list_head
*p
= rb_list_head((*bpage
)->list
.next
);
915 *bpage
= list_entry(p
, struct buffer_page
, list
);
918 static struct buffer_page
*
919 rb_set_head_page(struct ring_buffer_per_cpu
*cpu_buffer
)
921 struct buffer_page
*head
;
922 struct buffer_page
*page
;
923 struct list_head
*list
;
926 if (RB_WARN_ON(cpu_buffer
, !cpu_buffer
->head_page
))
930 list
= cpu_buffer
->pages
;
931 if (RB_WARN_ON(cpu_buffer
, rb_list_head(list
->prev
->next
) != list
))
934 page
= head
= cpu_buffer
->head_page
;
936 * It is possible that the writer moves the header behind
937 * where we started, and we miss in one loop.
938 * A second loop should grab the header, but we'll do
939 * three loops just because I'm paranoid.
941 for (i
= 0; i
< 3; i
++) {
943 if (rb_is_head_page(cpu_buffer
, page
, page
->list
.prev
)) {
944 cpu_buffer
->head_page
= page
;
947 rb_inc_page(cpu_buffer
, &page
);
948 } while (page
!= head
);
951 RB_WARN_ON(cpu_buffer
, 1);
956 static int rb_head_page_replace(struct buffer_page
*old
,
957 struct buffer_page
*new)
959 unsigned long *ptr
= (unsigned long *)&old
->list
.prev
->next
;
963 val
= *ptr
& ~RB_FLAG_MASK
;
966 ret
= cmpxchg(ptr
, val
, (unsigned long)&new->list
);
972 * rb_tail_page_update - move the tail page forward
974 * Returns 1 if moved tail page, 0 if someone else did.
976 static int rb_tail_page_update(struct ring_buffer_per_cpu
*cpu_buffer
,
977 struct buffer_page
*tail_page
,
978 struct buffer_page
*next_page
)
980 struct buffer_page
*old_tail
;
981 unsigned long old_entries
;
982 unsigned long old_write
;
986 * The tail page now needs to be moved forward.
988 * We need to reset the tail page, but without messing
989 * with possible erasing of data brought in by interrupts
990 * that have moved the tail page and are currently on it.
992 * We add a counter to the write field to denote this.
994 old_write
= local_add_return(RB_WRITE_INTCNT
, &next_page
->write
);
995 old_entries
= local_add_return(RB_WRITE_INTCNT
, &next_page
->entries
);
998 * Just make sure we have seen our old_write and synchronize
999 * with any interrupts that come in.
1004 * If the tail page is still the same as what we think
1005 * it is, then it is up to us to update the tail
1008 if (tail_page
== cpu_buffer
->tail_page
) {
1009 /* Zero the write counter */
1010 unsigned long val
= old_write
& ~RB_WRITE_MASK
;
1011 unsigned long eval
= old_entries
& ~RB_WRITE_MASK
;
1014 * This will only succeed if an interrupt did
1015 * not come in and change it. In which case, we
1016 * do not want to modify it.
1018 * We add (void) to let the compiler know that we do not care
1019 * about the return value of these functions. We use the
1020 * cmpxchg to only update if an interrupt did not already
1021 * do it for us. If the cmpxchg fails, we don't care.
1023 (void)local_cmpxchg(&next_page
->write
, old_write
, val
);
1024 (void)local_cmpxchg(&next_page
->entries
, old_entries
, eval
);
1027 * No need to worry about races with clearing out the commit.
1028 * it only can increment when a commit takes place. But that
1029 * only happens in the outer most nested commit.
1031 local_set(&next_page
->page
->commit
, 0);
1033 old_tail
= cmpxchg(&cpu_buffer
->tail_page
,
1034 tail_page
, next_page
);
1036 if (old_tail
== tail_page
)
1043 static int rb_check_bpage(struct ring_buffer_per_cpu
*cpu_buffer
,
1044 struct buffer_page
*bpage
)
1046 unsigned long val
= (unsigned long)bpage
;
1048 if (RB_WARN_ON(cpu_buffer
, val
& RB_FLAG_MASK
))
1055 * rb_check_list - make sure a pointer to a list has the last bits zero
1057 static int rb_check_list(struct ring_buffer_per_cpu
*cpu_buffer
,
1058 struct list_head
*list
)
1060 if (RB_WARN_ON(cpu_buffer
, rb_list_head(list
->prev
) != list
->prev
))
1062 if (RB_WARN_ON(cpu_buffer
, rb_list_head(list
->next
) != list
->next
))
1068 * check_pages - integrity check of buffer pages
1069 * @cpu_buffer: CPU buffer with pages to test
1071 * As a safety measure we check to make sure the data pages have not
1074 static int rb_check_pages(struct ring_buffer_per_cpu
*cpu_buffer
)
1076 struct list_head
*head
= cpu_buffer
->pages
;
1077 struct buffer_page
*bpage
, *tmp
;
1079 /* Reset the head page if it exists */
1080 if (cpu_buffer
->head_page
)
1081 rb_set_head_page(cpu_buffer
);
1083 rb_head_page_deactivate(cpu_buffer
);
1085 if (RB_WARN_ON(cpu_buffer
, head
->next
->prev
!= head
))
1087 if (RB_WARN_ON(cpu_buffer
, head
->prev
->next
!= head
))
1090 if (rb_check_list(cpu_buffer
, head
))
1093 list_for_each_entry_safe(bpage
, tmp
, head
, list
) {
1094 if (RB_WARN_ON(cpu_buffer
,
1095 bpage
->list
.next
->prev
!= &bpage
->list
))
1097 if (RB_WARN_ON(cpu_buffer
,
1098 bpage
->list
.prev
->next
!= &bpage
->list
))
1100 if (rb_check_list(cpu_buffer
, &bpage
->list
))
1104 rb_head_page_activate(cpu_buffer
);
1109 static int __rb_allocate_pages(int nr_pages
, struct list_head
*pages
, int cpu
)
1112 struct buffer_page
*bpage
, *tmp
;
1114 for (i
= 0; i
< nr_pages
; i
++) {
1117 * __GFP_NORETRY flag makes sure that the allocation fails
1118 * gracefully without invoking oom-killer and the system is
1121 bpage
= kzalloc_node(ALIGN(sizeof(*bpage
), cache_line_size()),
1122 GFP_KERNEL
| __GFP_NORETRY
,
1127 list_add(&bpage
->list
, pages
);
1129 page
= alloc_pages_node(cpu_to_node(cpu
),
1130 GFP_KERNEL
| __GFP_NORETRY
, 0);
1133 bpage
->page
= page_address(page
);
1134 rb_init_page(bpage
->page
);
1140 list_for_each_entry_safe(bpage
, tmp
, pages
, list
) {
1141 list_del_init(&bpage
->list
);
1142 free_buffer_page(bpage
);
1148 static int rb_allocate_pages(struct ring_buffer_per_cpu
*cpu_buffer
,
1155 if (__rb_allocate_pages(nr_pages
, &pages
, cpu_buffer
->cpu
))
1159 * The ring buffer page list is a circular list that does not
1160 * start and end with a list head. All page list items point to
1163 cpu_buffer
->pages
= pages
.next
;
1166 cpu_buffer
->nr_pages
= nr_pages
;
1168 rb_check_pages(cpu_buffer
);
1173 static struct ring_buffer_per_cpu
*
1174 rb_allocate_cpu_buffer(struct ring_buffer
*buffer
, int nr_pages
, int cpu
)
1176 struct ring_buffer_per_cpu
*cpu_buffer
;
1177 struct buffer_page
*bpage
;
1181 cpu_buffer
= kzalloc_node(ALIGN(sizeof(*cpu_buffer
), cache_line_size()),
1182 GFP_KERNEL
, cpu_to_node(cpu
));
1186 cpu_buffer
->cpu
= cpu
;
1187 cpu_buffer
->buffer
= buffer
;
1188 raw_spin_lock_init(&cpu_buffer
->reader_lock
);
1189 lockdep_set_class(&cpu_buffer
->reader_lock
, buffer
->reader_lock_key
);
1190 cpu_buffer
->lock
= (arch_spinlock_t
)__ARCH_SPIN_LOCK_UNLOCKED
;
1191 INIT_WORK(&cpu_buffer
->update_pages_work
, update_pages_handler
);
1192 init_completion(&cpu_buffer
->update_done
);
1193 init_irq_work(&cpu_buffer
->irq_work
.work
, rb_wake_up_waiters
);
1194 init_waitqueue_head(&cpu_buffer
->irq_work
.waiters
);
1196 bpage
= kzalloc_node(ALIGN(sizeof(*bpage
), cache_line_size()),
1197 GFP_KERNEL
, cpu_to_node(cpu
));
1199 goto fail_free_buffer
;
1201 rb_check_bpage(cpu_buffer
, bpage
);
1203 cpu_buffer
->reader_page
= bpage
;
1204 page
= alloc_pages_node(cpu_to_node(cpu
), GFP_KERNEL
, 0);
1206 goto fail_free_reader
;
1207 bpage
->page
= page_address(page
);
1208 rb_init_page(bpage
->page
);
1210 INIT_LIST_HEAD(&cpu_buffer
->reader_page
->list
);
1211 INIT_LIST_HEAD(&cpu_buffer
->new_pages
);
1213 ret
= rb_allocate_pages(cpu_buffer
, nr_pages
);
1215 goto fail_free_reader
;
1217 cpu_buffer
->head_page
1218 = list_entry(cpu_buffer
->pages
, struct buffer_page
, list
);
1219 cpu_buffer
->tail_page
= cpu_buffer
->commit_page
= cpu_buffer
->head_page
;
1221 rb_head_page_activate(cpu_buffer
);
1226 free_buffer_page(cpu_buffer
->reader_page
);
1233 static void rb_free_cpu_buffer(struct ring_buffer_per_cpu
*cpu_buffer
)
1235 struct list_head
*head
= cpu_buffer
->pages
;
1236 struct buffer_page
*bpage
, *tmp
;
1238 free_buffer_page(cpu_buffer
->reader_page
);
1240 rb_head_page_deactivate(cpu_buffer
);
1243 list_for_each_entry_safe(bpage
, tmp
, head
, list
) {
1244 list_del_init(&bpage
->list
);
1245 free_buffer_page(bpage
);
1247 bpage
= list_entry(head
, struct buffer_page
, list
);
1248 free_buffer_page(bpage
);
1254 #ifdef CONFIG_HOTPLUG_CPU
1255 static int rb_cpu_notify(struct notifier_block
*self
,
1256 unsigned long action
, void *hcpu
);
1260 * ring_buffer_alloc - allocate a new ring_buffer
1261 * @size: the size in bytes per cpu that is needed.
1262 * @flags: attributes to set for the ring buffer.
1264 * Currently the only flag that is available is the RB_FL_OVERWRITE
1265 * flag. This flag means that the buffer will overwrite old data
1266 * when the buffer wraps. If this flag is not set, the buffer will
1267 * drop data when the tail hits the head.
1269 struct ring_buffer
*__ring_buffer_alloc(unsigned long size
, unsigned flags
,
1270 struct lock_class_key
*key
)
1272 struct ring_buffer
*buffer
;
1276 /* keep it in its own cache line */
1277 buffer
= kzalloc(ALIGN(sizeof(*buffer
), cache_line_size()),
1282 if (!alloc_cpumask_var(&buffer
->cpumask
, GFP_KERNEL
))
1283 goto fail_free_buffer
;
1285 nr_pages
= DIV_ROUND_UP(size
, BUF_PAGE_SIZE
);
1286 buffer
->flags
= flags
;
1287 buffer
->clock
= trace_clock_local
;
1288 buffer
->reader_lock_key
= key
;
1290 init_irq_work(&buffer
->irq_work
.work
, rb_wake_up_waiters
);
1291 init_waitqueue_head(&buffer
->irq_work
.waiters
);
1293 /* need at least two pages */
1298 * In case of non-hotplug cpu, if the ring-buffer is allocated
1299 * in early initcall, it will not be notified of secondary cpus.
1300 * In that off case, we need to allocate for all possible cpus.
1302 #ifdef CONFIG_HOTPLUG_CPU
1304 cpumask_copy(buffer
->cpumask
, cpu_online_mask
);
1306 cpumask_copy(buffer
->cpumask
, cpu_possible_mask
);
1308 buffer
->cpus
= nr_cpu_ids
;
1310 bsize
= sizeof(void *) * nr_cpu_ids
;
1311 buffer
->buffers
= kzalloc(ALIGN(bsize
, cache_line_size()),
1313 if (!buffer
->buffers
)
1314 goto fail_free_cpumask
;
1316 for_each_buffer_cpu(buffer
, cpu
) {
1317 buffer
->buffers
[cpu
] =
1318 rb_allocate_cpu_buffer(buffer
, nr_pages
, cpu
);
1319 if (!buffer
->buffers
[cpu
])
1320 goto fail_free_buffers
;
1323 #ifdef CONFIG_HOTPLUG_CPU
1324 buffer
->cpu_notify
.notifier_call
= rb_cpu_notify
;
1325 buffer
->cpu_notify
.priority
= 0;
1326 register_cpu_notifier(&buffer
->cpu_notify
);
1330 mutex_init(&buffer
->mutex
);
1335 for_each_buffer_cpu(buffer
, cpu
) {
1336 if (buffer
->buffers
[cpu
])
1337 rb_free_cpu_buffer(buffer
->buffers
[cpu
]);
1339 kfree(buffer
->buffers
);
1342 free_cpumask_var(buffer
->cpumask
);
1349 EXPORT_SYMBOL_GPL(__ring_buffer_alloc
);
1352 * ring_buffer_free - free a ring buffer.
1353 * @buffer: the buffer to free.
1356 ring_buffer_free(struct ring_buffer
*buffer
)
1362 #ifdef CONFIG_HOTPLUG_CPU
1363 unregister_cpu_notifier(&buffer
->cpu_notify
);
1366 for_each_buffer_cpu(buffer
, cpu
)
1367 rb_free_cpu_buffer(buffer
->buffers
[cpu
]);
1371 kfree(buffer
->buffers
);
1372 free_cpumask_var(buffer
->cpumask
);
1376 EXPORT_SYMBOL_GPL(ring_buffer_free
);
1378 void ring_buffer_set_clock(struct ring_buffer
*buffer
,
1381 buffer
->clock
= clock
;
1384 static void rb_reset_cpu(struct ring_buffer_per_cpu
*cpu_buffer
);
1386 static inline unsigned long rb_page_entries(struct buffer_page
*bpage
)
1388 return local_read(&bpage
->entries
) & RB_WRITE_MASK
;
1391 static inline unsigned long rb_page_write(struct buffer_page
*bpage
)
1393 return local_read(&bpage
->write
) & RB_WRITE_MASK
;
1397 rb_remove_pages(struct ring_buffer_per_cpu
*cpu_buffer
, unsigned int nr_pages
)
1399 struct list_head
*tail_page
, *to_remove
, *next_page
;
1400 struct buffer_page
*to_remove_page
, *tmp_iter_page
;
1401 struct buffer_page
*last_page
, *first_page
;
1402 unsigned int nr_removed
;
1403 unsigned long head_bit
;
1408 raw_spin_lock_irq(&cpu_buffer
->reader_lock
);
1409 atomic_inc(&cpu_buffer
->record_disabled
);
1411 * We don't race with the readers since we have acquired the reader
1412 * lock. We also don't race with writers after disabling recording.
1413 * This makes it easy to figure out the first and the last page to be
1414 * removed from the list. We unlink all the pages in between including
1415 * the first and last pages. This is done in a busy loop so that we
1416 * lose the least number of traces.
1417 * The pages are freed after we restart recording and unlock readers.
1419 tail_page
= &cpu_buffer
->tail_page
->list
;
1422 * tail page might be on reader page, we remove the next page
1423 * from the ring buffer
1425 if (cpu_buffer
->tail_page
== cpu_buffer
->reader_page
)
1426 tail_page
= rb_list_head(tail_page
->next
);
1427 to_remove
= tail_page
;
1429 /* start of pages to remove */
1430 first_page
= list_entry(rb_list_head(to_remove
->next
),
1431 struct buffer_page
, list
);
1433 for (nr_removed
= 0; nr_removed
< nr_pages
; nr_removed
++) {
1434 to_remove
= rb_list_head(to_remove
)->next
;
1435 head_bit
|= (unsigned long)to_remove
& RB_PAGE_HEAD
;
1438 next_page
= rb_list_head(to_remove
)->next
;
1441 * Now we remove all pages between tail_page and next_page.
1442 * Make sure that we have head_bit value preserved for the
1445 tail_page
->next
= (struct list_head
*)((unsigned long)next_page
|
1447 next_page
= rb_list_head(next_page
);
1448 next_page
->prev
= tail_page
;
1450 /* make sure pages points to a valid page in the ring buffer */
1451 cpu_buffer
->pages
= next_page
;
1453 /* update head page */
1455 cpu_buffer
->head_page
= list_entry(next_page
,
1456 struct buffer_page
, list
);
1459 * change read pointer to make sure any read iterators reset
1462 cpu_buffer
->read
= 0;
1464 /* pages are removed, resume tracing and then free the pages */
1465 atomic_dec(&cpu_buffer
->record_disabled
);
1466 raw_spin_unlock_irq(&cpu_buffer
->reader_lock
);
1468 RB_WARN_ON(cpu_buffer
, list_empty(cpu_buffer
->pages
));
1470 /* last buffer page to remove */
1471 last_page
= list_entry(rb_list_head(to_remove
), struct buffer_page
,
1473 tmp_iter_page
= first_page
;
1476 to_remove_page
= tmp_iter_page
;
1477 rb_inc_page(cpu_buffer
, &tmp_iter_page
);
1479 /* update the counters */
1480 page_entries
= rb_page_entries(to_remove_page
);
1483 * If something was added to this page, it was full
1484 * since it is not the tail page. So we deduct the
1485 * bytes consumed in ring buffer from here.
1486 * Increment overrun to account for the lost events.
1488 local_add(page_entries
, &cpu_buffer
->overrun
);
1489 local_sub(BUF_PAGE_SIZE
, &cpu_buffer
->entries_bytes
);
1493 * We have already removed references to this list item, just
1494 * free up the buffer_page and its page
1496 free_buffer_page(to_remove_page
);
1499 } while (to_remove_page
!= last_page
);
1501 RB_WARN_ON(cpu_buffer
, nr_removed
);
1503 return nr_removed
== 0;
1507 rb_insert_pages(struct ring_buffer_per_cpu
*cpu_buffer
)
1509 struct list_head
*pages
= &cpu_buffer
->new_pages
;
1510 int retries
, success
;
1512 raw_spin_lock_irq(&cpu_buffer
->reader_lock
);
1514 * We are holding the reader lock, so the reader page won't be swapped
1515 * in the ring buffer. Now we are racing with the writer trying to
1516 * move head page and the tail page.
1517 * We are going to adapt the reader page update process where:
1518 * 1. We first splice the start and end of list of new pages between
1519 * the head page and its previous page.
1520 * 2. We cmpxchg the prev_page->next to point from head page to the
1521 * start of new pages list.
1522 * 3. Finally, we update the head->prev to the end of new list.
1524 * We will try this process 10 times, to make sure that we don't keep
1530 struct list_head
*head_page
, *prev_page
, *r
;
1531 struct list_head
*last_page
, *first_page
;
1532 struct list_head
*head_page_with_bit
;
1534 head_page
= &rb_set_head_page(cpu_buffer
)->list
;
1537 prev_page
= head_page
->prev
;
1539 first_page
= pages
->next
;
1540 last_page
= pages
->prev
;
1542 head_page_with_bit
= (struct list_head
*)
1543 ((unsigned long)head_page
| RB_PAGE_HEAD
);
1545 last_page
->next
= head_page_with_bit
;
1546 first_page
->prev
= prev_page
;
1548 r
= cmpxchg(&prev_page
->next
, head_page_with_bit
, first_page
);
1550 if (r
== head_page_with_bit
) {
1552 * yay, we replaced the page pointer to our new list,
1553 * now, we just have to update to head page's prev
1554 * pointer to point to end of list
1556 head_page
->prev
= last_page
;
1563 INIT_LIST_HEAD(pages
);
1565 * If we weren't successful in adding in new pages, warn and stop
1568 RB_WARN_ON(cpu_buffer
, !success
);
1569 raw_spin_unlock_irq(&cpu_buffer
->reader_lock
);
1571 /* free pages if they weren't inserted */
1573 struct buffer_page
*bpage
, *tmp
;
1574 list_for_each_entry_safe(bpage
, tmp
, &cpu_buffer
->new_pages
,
1576 list_del_init(&bpage
->list
);
1577 free_buffer_page(bpage
);
1583 static void rb_update_pages(struct ring_buffer_per_cpu
*cpu_buffer
)
1587 if (cpu_buffer
->nr_pages_to_update
> 0)
1588 success
= rb_insert_pages(cpu_buffer
);
1590 success
= rb_remove_pages(cpu_buffer
,
1591 -cpu_buffer
->nr_pages_to_update
);
1594 cpu_buffer
->nr_pages
+= cpu_buffer
->nr_pages_to_update
;
1597 static void update_pages_handler(struct work_struct
*work
)
1599 struct ring_buffer_per_cpu
*cpu_buffer
= container_of(work
,
1600 struct ring_buffer_per_cpu
, update_pages_work
);
1601 rb_update_pages(cpu_buffer
);
1602 complete(&cpu_buffer
->update_done
);
1606 * ring_buffer_resize - resize the ring buffer
1607 * @buffer: the buffer to resize.
1608 * @size: the new size.
1610 * Minimum size is 2 * BUF_PAGE_SIZE.
1612 * Returns 0 on success and < 0 on failure.
1614 int ring_buffer_resize(struct ring_buffer
*buffer
, unsigned long size
,
1617 struct ring_buffer_per_cpu
*cpu_buffer
;
1622 * Always succeed at resizing a non-existent buffer:
1627 /* Make sure the requested buffer exists */
1628 if (cpu_id
!= RING_BUFFER_ALL_CPUS
&&
1629 !cpumask_test_cpu(cpu_id
, buffer
->cpumask
))
1632 size
= DIV_ROUND_UP(size
, BUF_PAGE_SIZE
);
1633 size
*= BUF_PAGE_SIZE
;
1635 /* we need a minimum of two pages */
1636 if (size
< BUF_PAGE_SIZE
* 2)
1637 size
= BUF_PAGE_SIZE
* 2;
1639 nr_pages
= DIV_ROUND_UP(size
, BUF_PAGE_SIZE
);
1642 * Don't succeed if resizing is disabled, as a reader might be
1643 * manipulating the ring buffer and is expecting a sane state while
1646 if (atomic_read(&buffer
->resize_disabled
))
1649 /* prevent another thread from changing buffer sizes */
1650 mutex_lock(&buffer
->mutex
);
1652 if (cpu_id
== RING_BUFFER_ALL_CPUS
) {
1653 /* calculate the pages to update */
1654 for_each_buffer_cpu(buffer
, cpu
) {
1655 cpu_buffer
= buffer
->buffers
[cpu
];
1657 cpu_buffer
->nr_pages_to_update
= nr_pages
-
1658 cpu_buffer
->nr_pages
;
1660 * nothing more to do for removing pages or no update
1662 if (cpu_buffer
->nr_pages_to_update
<= 0)
1665 * to add pages, make sure all new pages can be
1666 * allocated without receiving ENOMEM
1668 INIT_LIST_HEAD(&cpu_buffer
->new_pages
);
1669 if (__rb_allocate_pages(cpu_buffer
->nr_pages_to_update
,
1670 &cpu_buffer
->new_pages
, cpu
)) {
1671 /* not enough memory for new pages */
1679 * Fire off all the required work handlers
1680 * We can't schedule on offline CPUs, but it's not necessary
1681 * since we can change their buffer sizes without any race.
1683 for_each_buffer_cpu(buffer
, cpu
) {
1684 cpu_buffer
= buffer
->buffers
[cpu
];
1685 if (!cpu_buffer
->nr_pages_to_update
)
1688 /* The update must run on the CPU that is being updated. */
1690 if (cpu
== smp_processor_id() || !cpu_online(cpu
)) {
1691 rb_update_pages(cpu_buffer
);
1692 cpu_buffer
->nr_pages_to_update
= 0;
1695 * Can not disable preemption for schedule_work_on()
1699 schedule_work_on(cpu
,
1700 &cpu_buffer
->update_pages_work
);
1706 /* wait for all the updates to complete */
1707 for_each_buffer_cpu(buffer
, cpu
) {
1708 cpu_buffer
= buffer
->buffers
[cpu
];
1709 if (!cpu_buffer
->nr_pages_to_update
)
1712 if (cpu_online(cpu
))
1713 wait_for_completion(&cpu_buffer
->update_done
);
1714 cpu_buffer
->nr_pages_to_update
= 0;
1719 /* Make sure this CPU has been intitialized */
1720 if (!cpumask_test_cpu(cpu_id
, buffer
->cpumask
))
1723 cpu_buffer
= buffer
->buffers
[cpu_id
];
1725 if (nr_pages
== cpu_buffer
->nr_pages
)
1728 cpu_buffer
->nr_pages_to_update
= nr_pages
-
1729 cpu_buffer
->nr_pages
;
1731 INIT_LIST_HEAD(&cpu_buffer
->new_pages
);
1732 if (cpu_buffer
->nr_pages_to_update
> 0 &&
1733 __rb_allocate_pages(cpu_buffer
->nr_pages_to_update
,
1734 &cpu_buffer
->new_pages
, cpu_id
)) {
1742 /* The update must run on the CPU that is being updated. */
1743 if (cpu_id
== smp_processor_id() || !cpu_online(cpu_id
))
1744 rb_update_pages(cpu_buffer
);
1747 * Can not disable preemption for schedule_work_on()
1751 schedule_work_on(cpu_id
,
1752 &cpu_buffer
->update_pages_work
);
1753 wait_for_completion(&cpu_buffer
->update_done
);
1758 cpu_buffer
->nr_pages_to_update
= 0;
1764 * The ring buffer resize can happen with the ring buffer
1765 * enabled, so that the update disturbs the tracing as little
1766 * as possible. But if the buffer is disabled, we do not need
1767 * to worry about that, and we can take the time to verify
1768 * that the buffer is not corrupt.
1770 if (atomic_read(&buffer
->record_disabled
)) {
1771 atomic_inc(&buffer
->record_disabled
);
1773 * Even though the buffer was disabled, we must make sure
1774 * that it is truly disabled before calling rb_check_pages.
1775 * There could have been a race between checking
1776 * record_disable and incrementing it.
1778 synchronize_sched();
1779 for_each_buffer_cpu(buffer
, cpu
) {
1780 cpu_buffer
= buffer
->buffers
[cpu
];
1781 rb_check_pages(cpu_buffer
);
1783 atomic_dec(&buffer
->record_disabled
);
1786 mutex_unlock(&buffer
->mutex
);
1790 for_each_buffer_cpu(buffer
, cpu
) {
1791 struct buffer_page
*bpage
, *tmp
;
1793 cpu_buffer
= buffer
->buffers
[cpu
];
1794 cpu_buffer
->nr_pages_to_update
= 0;
1796 if (list_empty(&cpu_buffer
->new_pages
))
1799 list_for_each_entry_safe(bpage
, tmp
, &cpu_buffer
->new_pages
,
1801 list_del_init(&bpage
->list
);
1802 free_buffer_page(bpage
);
1805 mutex_unlock(&buffer
->mutex
);
1808 EXPORT_SYMBOL_GPL(ring_buffer_resize
);
1810 void ring_buffer_change_overwrite(struct ring_buffer
*buffer
, int val
)
1812 mutex_lock(&buffer
->mutex
);
1814 buffer
->flags
|= RB_FL_OVERWRITE
;
1816 buffer
->flags
&= ~RB_FL_OVERWRITE
;
1817 mutex_unlock(&buffer
->mutex
);
1819 EXPORT_SYMBOL_GPL(ring_buffer_change_overwrite
);
1821 static inline void *
1822 __rb_data_page_index(struct buffer_data_page
*bpage
, unsigned index
)
1824 return bpage
->data
+ index
;
1827 static inline void *__rb_page_index(struct buffer_page
*bpage
, unsigned index
)
1829 return bpage
->page
->data
+ index
;
1832 static inline struct ring_buffer_event
*
1833 rb_reader_event(struct ring_buffer_per_cpu
*cpu_buffer
)
1835 return __rb_page_index(cpu_buffer
->reader_page
,
1836 cpu_buffer
->reader_page
->read
);
1839 static inline struct ring_buffer_event
*
1840 rb_iter_head_event(struct ring_buffer_iter
*iter
)
1842 return __rb_page_index(iter
->head_page
, iter
->head
);
1845 static inline unsigned rb_page_commit(struct buffer_page
*bpage
)
1847 return local_read(&bpage
->page
->commit
);
1850 /* Size is determined by what has been committed */
1851 static inline unsigned rb_page_size(struct buffer_page
*bpage
)
1853 return rb_page_commit(bpage
);
1856 static inline unsigned
1857 rb_commit_index(struct ring_buffer_per_cpu
*cpu_buffer
)
1859 return rb_page_commit(cpu_buffer
->commit_page
);
1862 static inline unsigned
1863 rb_event_index(struct ring_buffer_event
*event
)
1865 unsigned long addr
= (unsigned long)event
;
1867 return (addr
& ~PAGE_MASK
) - BUF_PAGE_HDR_SIZE
;
1871 rb_event_is_commit(struct ring_buffer_per_cpu
*cpu_buffer
,
1872 struct ring_buffer_event
*event
)
1874 unsigned long addr
= (unsigned long)event
;
1875 unsigned long index
;
1877 index
= rb_event_index(event
);
1880 return cpu_buffer
->commit_page
->page
== (void *)addr
&&
1881 rb_commit_index(cpu_buffer
) == index
;
1885 rb_set_commit_to_write(struct ring_buffer_per_cpu
*cpu_buffer
)
1887 unsigned long max_count
;
1890 * We only race with interrupts and NMIs on this CPU.
1891 * If we own the commit event, then we can commit
1892 * all others that interrupted us, since the interruptions
1893 * are in stack format (they finish before they come
1894 * back to us). This allows us to do a simple loop to
1895 * assign the commit to the tail.
1898 max_count
= cpu_buffer
->nr_pages
* 100;
1900 while (cpu_buffer
->commit_page
!= cpu_buffer
->tail_page
) {
1901 if (RB_WARN_ON(cpu_buffer
, !(--max_count
)))
1903 if (RB_WARN_ON(cpu_buffer
,
1904 rb_is_reader_page(cpu_buffer
->tail_page
)))
1906 local_set(&cpu_buffer
->commit_page
->page
->commit
,
1907 rb_page_write(cpu_buffer
->commit_page
));
1908 rb_inc_page(cpu_buffer
, &cpu_buffer
->commit_page
);
1909 cpu_buffer
->write_stamp
=
1910 cpu_buffer
->commit_page
->page
->time_stamp
;
1911 /* add barrier to keep gcc from optimizing too much */
1914 while (rb_commit_index(cpu_buffer
) !=
1915 rb_page_write(cpu_buffer
->commit_page
)) {
1917 local_set(&cpu_buffer
->commit_page
->page
->commit
,
1918 rb_page_write(cpu_buffer
->commit_page
));
1919 RB_WARN_ON(cpu_buffer
,
1920 local_read(&cpu_buffer
->commit_page
->page
->commit
) &
1925 /* again, keep gcc from optimizing */
1929 * If an interrupt came in just after the first while loop
1930 * and pushed the tail page forward, we will be left with
1931 * a dangling commit that will never go forward.
1933 if (unlikely(cpu_buffer
->commit_page
!= cpu_buffer
->tail_page
))
1937 static void rb_reset_reader_page(struct ring_buffer_per_cpu
*cpu_buffer
)
1939 cpu_buffer
->read_stamp
= cpu_buffer
->reader_page
->page
->time_stamp
;
1940 cpu_buffer
->reader_page
->read
= 0;
1943 static void rb_inc_iter(struct ring_buffer_iter
*iter
)
1945 struct ring_buffer_per_cpu
*cpu_buffer
= iter
->cpu_buffer
;
1948 * The iterator could be on the reader page (it starts there).
1949 * But the head could have moved, since the reader was
1950 * found. Check for this case and assign the iterator
1951 * to the head page instead of next.
1953 if (iter
->head_page
== cpu_buffer
->reader_page
)
1954 iter
->head_page
= rb_set_head_page(cpu_buffer
);
1956 rb_inc_page(cpu_buffer
, &iter
->head_page
);
1958 iter
->read_stamp
= iter
->head_page
->page
->time_stamp
;
1962 /* Slow path, do not inline */
1963 static noinline
struct ring_buffer_event
*
1964 rb_add_time_stamp(struct ring_buffer_event
*event
, u64 delta
)
1966 event
->type_len
= RINGBUF_TYPE_TIME_EXTEND
;
1968 /* Not the first event on the page? */
1969 if (rb_event_index(event
)) {
1970 event
->time_delta
= delta
& TS_MASK
;
1971 event
->array
[0] = delta
>> TS_SHIFT
;
1973 /* nope, just zero it */
1974 event
->time_delta
= 0;
1975 event
->array
[0] = 0;
1978 return skip_time_extend(event
);
1982 * rb_update_event - update event type and data
1983 * @event: the event to update
1984 * @type: the type of event
1985 * @length: the size of the event field in the ring buffer
1987 * Update the type and data fields of the event. The length
1988 * is the actual size that is written to the ring buffer,
1989 * and with this, we can determine what to place into the
1993 rb_update_event(struct ring_buffer_per_cpu
*cpu_buffer
,
1994 struct ring_buffer_event
*event
, unsigned length
,
1995 int add_timestamp
, u64 delta
)
1997 /* Only a commit updates the timestamp */
1998 if (unlikely(!rb_event_is_commit(cpu_buffer
, event
)))
2002 * If we need to add a timestamp, then we
2003 * add it to the start of the resevered space.
2005 if (unlikely(add_timestamp
)) {
2006 event
= rb_add_time_stamp(event
, delta
);
2007 length
-= RB_LEN_TIME_EXTEND
;
2011 event
->time_delta
= delta
;
2012 length
-= RB_EVNT_HDR_SIZE
;
2013 if (length
> RB_MAX_SMALL_DATA
|| RB_FORCE_8BYTE_ALIGNMENT
) {
2014 event
->type_len
= 0;
2015 event
->array
[0] = length
;
2017 event
->type_len
= DIV_ROUND_UP(length
, RB_ALIGNMENT
);
2021 * rb_handle_head_page - writer hit the head page
2023 * Returns: +1 to retry page
2028 rb_handle_head_page(struct ring_buffer_per_cpu
*cpu_buffer
,
2029 struct buffer_page
*tail_page
,
2030 struct buffer_page
*next_page
)
2032 struct buffer_page
*new_head
;
2037 entries
= rb_page_entries(next_page
);
2040 * The hard part is here. We need to move the head
2041 * forward, and protect against both readers on
2042 * other CPUs and writers coming in via interrupts.
2044 type
= rb_head_page_set_update(cpu_buffer
, next_page
, tail_page
,
2048 * type can be one of four:
2049 * NORMAL - an interrupt already moved it for us
2050 * HEAD - we are the first to get here.
2051 * UPDATE - we are the interrupt interrupting
2053 * MOVED - a reader on another CPU moved the next
2054 * pointer to its reader page. Give up
2061 * We changed the head to UPDATE, thus
2062 * it is our responsibility to update
2065 local_add(entries
, &cpu_buffer
->overrun
);
2066 local_sub(BUF_PAGE_SIZE
, &cpu_buffer
->entries_bytes
);
2069 * The entries will be zeroed out when we move the
2073 /* still more to do */
2076 case RB_PAGE_UPDATE
:
2078 * This is an interrupt that interrupt the
2079 * previous update. Still more to do.
2082 case RB_PAGE_NORMAL
:
2084 * An interrupt came in before the update
2085 * and processed this for us.
2086 * Nothing left to do.
2091 * The reader is on another CPU and just did
2092 * a swap with our next_page.
2097 RB_WARN_ON(cpu_buffer
, 1); /* WTF??? */
2102 * Now that we are here, the old head pointer is
2103 * set to UPDATE. This will keep the reader from
2104 * swapping the head page with the reader page.
2105 * The reader (on another CPU) will spin till
2108 * We just need to protect against interrupts
2109 * doing the job. We will set the next pointer
2110 * to HEAD. After that, we set the old pointer
2111 * to NORMAL, but only if it was HEAD before.
2112 * otherwise we are an interrupt, and only
2113 * want the outer most commit to reset it.
2115 new_head
= next_page
;
2116 rb_inc_page(cpu_buffer
, &new_head
);
2118 ret
= rb_head_page_set_head(cpu_buffer
, new_head
, next_page
,
2122 * Valid returns are:
2123 * HEAD - an interrupt came in and already set it.
2124 * NORMAL - One of two things:
2125 * 1) We really set it.
2126 * 2) A bunch of interrupts came in and moved
2127 * the page forward again.
2131 case RB_PAGE_NORMAL
:
2135 RB_WARN_ON(cpu_buffer
, 1);
2140 * It is possible that an interrupt came in,
2141 * set the head up, then more interrupts came in
2142 * and moved it again. When we get back here,
2143 * the page would have been set to NORMAL but we
2144 * just set it back to HEAD.
2146 * How do you detect this? Well, if that happened
2147 * the tail page would have moved.
2149 if (ret
== RB_PAGE_NORMAL
) {
2151 * If the tail had moved passed next, then we need
2152 * to reset the pointer.
2154 if (cpu_buffer
->tail_page
!= tail_page
&&
2155 cpu_buffer
->tail_page
!= next_page
)
2156 rb_head_page_set_normal(cpu_buffer
, new_head
,
2162 * If this was the outer most commit (the one that
2163 * changed the original pointer from HEAD to UPDATE),
2164 * then it is up to us to reset it to NORMAL.
2166 if (type
== RB_PAGE_HEAD
) {
2167 ret
= rb_head_page_set_normal(cpu_buffer
, next_page
,
2170 if (RB_WARN_ON(cpu_buffer
,
2171 ret
!= RB_PAGE_UPDATE
))
2178 static unsigned rb_calculate_event_length(unsigned length
)
2180 struct ring_buffer_event event
; /* Used only for sizeof array */
2182 /* zero length can cause confusions */
2186 if (length
> RB_MAX_SMALL_DATA
|| RB_FORCE_8BYTE_ALIGNMENT
)
2187 length
+= sizeof(event
.array
[0]);
2189 length
+= RB_EVNT_HDR_SIZE
;
2190 length
= ALIGN(length
, RB_ARCH_ALIGNMENT
);
2196 rb_reset_tail(struct ring_buffer_per_cpu
*cpu_buffer
,
2197 struct buffer_page
*tail_page
,
2198 unsigned long tail
, unsigned long length
)
2200 struct ring_buffer_event
*event
;
2203 * Only the event that crossed the page boundary
2204 * must fill the old tail_page with padding.
2206 if (tail
>= BUF_PAGE_SIZE
) {
2208 * If the page was filled, then we still need
2209 * to update the real_end. Reset it to zero
2210 * and the reader will ignore it.
2212 if (tail
== BUF_PAGE_SIZE
)
2213 tail_page
->real_end
= 0;
2215 local_sub(length
, &tail_page
->write
);
2219 event
= __rb_page_index(tail_page
, tail
);
2220 kmemcheck_annotate_bitfield(event
, bitfield
);
2222 /* account for padding bytes */
2223 local_add(BUF_PAGE_SIZE
- tail
, &cpu_buffer
->entries_bytes
);
2226 * Save the original length to the meta data.
2227 * This will be used by the reader to add lost event
2230 tail_page
->real_end
= tail
;
2233 * If this event is bigger than the minimum size, then
2234 * we need to be careful that we don't subtract the
2235 * write counter enough to allow another writer to slip
2237 * We put in a discarded commit instead, to make sure
2238 * that this space is not used again.
2240 * If we are less than the minimum size, we don't need to
2243 if (tail
> (BUF_PAGE_SIZE
- RB_EVNT_MIN_SIZE
)) {
2244 /* No room for any events */
2246 /* Mark the rest of the page with padding */
2247 rb_event_set_padding(event
);
2249 /* Set the write back to the previous setting */
2250 local_sub(length
, &tail_page
->write
);
2254 /* Put in a discarded event */
2255 event
->array
[0] = (BUF_PAGE_SIZE
- tail
) - RB_EVNT_HDR_SIZE
;
2256 event
->type_len
= RINGBUF_TYPE_PADDING
;
2257 /* time delta must be non zero */
2258 event
->time_delta
= 1;
2260 /* Set write to end of buffer */
2261 length
= (tail
+ length
) - BUF_PAGE_SIZE
;
2262 local_sub(length
, &tail_page
->write
);
2266 * This is the slow path, force gcc not to inline it.
2268 static noinline
struct ring_buffer_event
*
2269 rb_move_tail(struct ring_buffer_per_cpu
*cpu_buffer
,
2270 unsigned long length
, unsigned long tail
,
2271 struct buffer_page
*tail_page
, u64 ts
)
2273 struct buffer_page
*commit_page
= cpu_buffer
->commit_page
;
2274 struct ring_buffer
*buffer
= cpu_buffer
->buffer
;
2275 struct buffer_page
*next_page
;
2278 next_page
= tail_page
;
2280 rb_inc_page(cpu_buffer
, &next_page
);
2283 * If for some reason, we had an interrupt storm that made
2284 * it all the way around the buffer, bail, and warn
2287 if (unlikely(next_page
== commit_page
)) {
2288 local_inc(&cpu_buffer
->commit_overrun
);
2293 * This is where the fun begins!
2295 * We are fighting against races between a reader that
2296 * could be on another CPU trying to swap its reader
2297 * page with the buffer head.
2299 * We are also fighting against interrupts coming in and
2300 * moving the head or tail on us as well.
2302 * If the next page is the head page then we have filled
2303 * the buffer, unless the commit page is still on the
2306 if (rb_is_head_page(cpu_buffer
, next_page
, &tail_page
->list
)) {
2309 * If the commit is not on the reader page, then
2310 * move the header page.
2312 if (!rb_is_reader_page(cpu_buffer
->commit_page
)) {
2314 * If we are not in overwrite mode,
2315 * this is easy, just stop here.
2317 if (!(buffer
->flags
& RB_FL_OVERWRITE
)) {
2318 local_inc(&cpu_buffer
->dropped_events
);
2322 ret
= rb_handle_head_page(cpu_buffer
,
2331 * We need to be careful here too. The
2332 * commit page could still be on the reader
2333 * page. We could have a small buffer, and
2334 * have filled up the buffer with events
2335 * from interrupts and such, and wrapped.
2337 * Note, if the tail page is also the on the
2338 * reader_page, we let it move out.
2340 if (unlikely((cpu_buffer
->commit_page
!=
2341 cpu_buffer
->tail_page
) &&
2342 (cpu_buffer
->commit_page
==
2343 cpu_buffer
->reader_page
))) {
2344 local_inc(&cpu_buffer
->commit_overrun
);
2350 ret
= rb_tail_page_update(cpu_buffer
, tail_page
, next_page
);
2353 * Nested commits always have zero deltas, so
2354 * just reread the time stamp
2356 ts
= rb_time_stamp(buffer
);
2357 next_page
->page
->time_stamp
= ts
;
2362 rb_reset_tail(cpu_buffer
, tail_page
, tail
, length
);
2364 /* fail and let the caller try again */
2365 return ERR_PTR(-EAGAIN
);
2369 rb_reset_tail(cpu_buffer
, tail_page
, tail
, length
);
2374 static struct ring_buffer_event
*
2375 __rb_reserve_next(struct ring_buffer_per_cpu
*cpu_buffer
,
2376 unsigned long length
, u64 ts
,
2377 u64 delta
, int add_timestamp
)
2379 struct buffer_page
*tail_page
;
2380 struct ring_buffer_event
*event
;
2381 unsigned long tail
, write
;
2384 * If the time delta since the last event is too big to
2385 * hold in the time field of the event, then we append a
2386 * TIME EXTEND event ahead of the data event.
2388 if (unlikely(add_timestamp
))
2389 length
+= RB_LEN_TIME_EXTEND
;
2391 tail_page
= cpu_buffer
->tail_page
;
2392 write
= local_add_return(length
, &tail_page
->write
);
2394 /* set write to only the index of the write */
2395 write
&= RB_WRITE_MASK
;
2396 tail
= write
- length
;
2399 * If this is the first commit on the page, then it has the same
2400 * timestamp as the page itself.
2405 /* See if we shot pass the end of this buffer page */
2406 if (unlikely(write
> BUF_PAGE_SIZE
))
2407 return rb_move_tail(cpu_buffer
, length
, tail
,
2410 /* We reserved something on the buffer */
2412 event
= __rb_page_index(tail_page
, tail
);
2413 kmemcheck_annotate_bitfield(event
, bitfield
);
2414 rb_update_event(cpu_buffer
, event
, length
, add_timestamp
, delta
);
2416 local_inc(&tail_page
->entries
);
2419 * If this is the first commit on the page, then update
2423 tail_page
->page
->time_stamp
= ts
;
2425 /* account for these added bytes */
2426 local_add(length
, &cpu_buffer
->entries_bytes
);
2432 rb_try_to_discard(struct ring_buffer_per_cpu
*cpu_buffer
,
2433 struct ring_buffer_event
*event
)
2435 unsigned long new_index
, old_index
;
2436 struct buffer_page
*bpage
;
2437 unsigned long index
;
2440 new_index
= rb_event_index(event
);
2441 old_index
= new_index
+ rb_event_ts_length(event
);
2442 addr
= (unsigned long)event
;
2445 bpage
= cpu_buffer
->tail_page
;
2447 if (bpage
->page
== (void *)addr
&& rb_page_write(bpage
) == old_index
) {
2448 unsigned long write_mask
=
2449 local_read(&bpage
->write
) & ~RB_WRITE_MASK
;
2450 unsigned long event_length
= rb_event_length(event
);
2452 * This is on the tail page. It is possible that
2453 * a write could come in and move the tail page
2454 * and write to the next page. That is fine
2455 * because we just shorten what is on this page.
2457 old_index
+= write_mask
;
2458 new_index
+= write_mask
;
2459 index
= local_cmpxchg(&bpage
->write
, old_index
, new_index
);
2460 if (index
== old_index
) {
2461 /* update counters */
2462 local_sub(event_length
, &cpu_buffer
->entries_bytes
);
2467 /* could not discard */
2471 static void rb_start_commit(struct ring_buffer_per_cpu
*cpu_buffer
)
2473 local_inc(&cpu_buffer
->committing
);
2474 local_inc(&cpu_buffer
->commits
);
2477 static inline void rb_end_commit(struct ring_buffer_per_cpu
*cpu_buffer
)
2479 unsigned long commits
;
2481 if (RB_WARN_ON(cpu_buffer
,
2482 !local_read(&cpu_buffer
->committing
)))
2486 commits
= local_read(&cpu_buffer
->commits
);
2487 /* synchronize with interrupts */
2489 if (local_read(&cpu_buffer
->committing
) == 1)
2490 rb_set_commit_to_write(cpu_buffer
);
2492 local_dec(&cpu_buffer
->committing
);
2494 /* synchronize with interrupts */
2498 * Need to account for interrupts coming in between the
2499 * updating of the commit page and the clearing of the
2500 * committing counter.
2502 if (unlikely(local_read(&cpu_buffer
->commits
) != commits
) &&
2503 !local_read(&cpu_buffer
->committing
)) {
2504 local_inc(&cpu_buffer
->committing
);
2509 static struct ring_buffer_event
*
2510 rb_reserve_next_event(struct ring_buffer
*buffer
,
2511 struct ring_buffer_per_cpu
*cpu_buffer
,
2512 unsigned long length
)
2514 struct ring_buffer_event
*event
;
2520 rb_start_commit(cpu_buffer
);
2522 #ifdef CONFIG_RING_BUFFER_ALLOW_SWAP
2524 * Due to the ability to swap a cpu buffer from a buffer
2525 * it is possible it was swapped before we committed.
2526 * (committing stops a swap). We check for it here and
2527 * if it happened, we have to fail the write.
2530 if (unlikely(ACCESS_ONCE(cpu_buffer
->buffer
) != buffer
)) {
2531 local_dec(&cpu_buffer
->committing
);
2532 local_dec(&cpu_buffer
->commits
);
2537 length
= rb_calculate_event_length(length
);
2543 * We allow for interrupts to reenter here and do a trace.
2544 * If one does, it will cause this original code to loop
2545 * back here. Even with heavy interrupts happening, this
2546 * should only happen a few times in a row. If this happens
2547 * 1000 times in a row, there must be either an interrupt
2548 * storm or we have something buggy.
2551 if (RB_WARN_ON(cpu_buffer
, ++nr_loops
> 1000))
2554 ts
= rb_time_stamp(cpu_buffer
->buffer
);
2555 diff
= ts
- cpu_buffer
->write_stamp
;
2557 /* make sure this diff is calculated here */
2560 /* Did the write stamp get updated already? */
2561 if (likely(ts
>= cpu_buffer
->write_stamp
)) {
2563 if (unlikely(test_time_stamp(delta
))) {
2564 int local_clock_stable
= 1;
2565 #ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK
2566 local_clock_stable
= sched_clock_stable
;
2568 WARN_ONCE(delta
> (1ULL << 59),
2569 KERN_WARNING
"Delta way too big! %llu ts=%llu write stamp = %llu\n%s",
2570 (unsigned long long)delta
,
2571 (unsigned long long)ts
,
2572 (unsigned long long)cpu_buffer
->write_stamp
,
2573 local_clock_stable
? "" :
2574 "If you just came from a suspend/resume,\n"
2575 "please switch to the trace global clock:\n"
2576 " echo global > /sys/kernel/debug/tracing/trace_clock\n");
2581 event
= __rb_reserve_next(cpu_buffer
, length
, ts
,
2582 delta
, add_timestamp
);
2583 if (unlikely(PTR_ERR(event
) == -EAGAIN
))
2592 rb_end_commit(cpu_buffer
);
2596 #ifdef CONFIG_TRACING
2599 * The lock and unlock are done within a preempt disable section.
2600 * The current_context per_cpu variable can only be modified
2601 * by the current task between lock and unlock. But it can
2602 * be modified more than once via an interrupt. To pass this
2603 * information from the lock to the unlock without having to
2604 * access the 'in_interrupt()' functions again (which do show
2605 * a bit of overhead in something as critical as function tracing,
2606 * we use a bitmask trick.
2608 * bit 0 = NMI context
2609 * bit 1 = IRQ context
2610 * bit 2 = SoftIRQ context
2611 * bit 3 = normal context.
2613 * This works because this is the order of contexts that can
2614 * preempt other contexts. A SoftIRQ never preempts an IRQ
2617 * When the context is determined, the corresponding bit is
2618 * checked and set (if it was set, then a recursion of that context
2621 * On unlock, we need to clear this bit. To do so, just subtract
2622 * 1 from the current_context and AND it to itself.
2626 * 101 & 100 = 100 (clearing bit zero)
2629 * 1010 & 1001 = 1000 (clearing bit 1)
2631 * The least significant bit can be cleared this way, and it
2632 * just so happens that it is the same bit corresponding to
2633 * the current context.
2635 static DEFINE_PER_CPU(unsigned int, current_context
);
2637 static __always_inline
int trace_recursive_lock(void)
2639 unsigned int val
= this_cpu_read(current_context
);
2642 if (in_interrupt()) {
2652 if (unlikely(val
& (1 << bit
)))
2656 this_cpu_write(current_context
, val
);
2661 static __always_inline
void trace_recursive_unlock(void)
2663 unsigned int val
= this_cpu_read(current_context
);
2666 val
&= this_cpu_read(current_context
);
2667 this_cpu_write(current_context
, val
);
2672 #define trace_recursive_lock() (0)
2673 #define trace_recursive_unlock() do { } while (0)
2678 * ring_buffer_lock_reserve - reserve a part of the buffer
2679 * @buffer: the ring buffer to reserve from
2680 * @length: the length of the data to reserve (excluding event header)
2682 * Returns a reseverd event on the ring buffer to copy directly to.
2683 * The user of this interface will need to get the body to write into
2684 * and can use the ring_buffer_event_data() interface.
2686 * The length is the length of the data needed, not the event length
2687 * which also includes the event header.
2689 * Must be paired with ring_buffer_unlock_commit, unless NULL is returned.
2690 * If NULL is returned, then nothing has been allocated or locked.
2692 struct ring_buffer_event
*
2693 ring_buffer_lock_reserve(struct ring_buffer
*buffer
, unsigned long length
)
2695 struct ring_buffer_per_cpu
*cpu_buffer
;
2696 struct ring_buffer_event
*event
;
2699 if (ring_buffer_flags
!= RB_BUFFERS_ON
)
2702 /* If we are tracing schedule, we don't want to recurse */
2703 preempt_disable_notrace();
2705 if (atomic_read(&buffer
->record_disabled
))
2708 if (trace_recursive_lock())
2711 cpu
= raw_smp_processor_id();
2713 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
2716 cpu_buffer
= buffer
->buffers
[cpu
];
2718 if (atomic_read(&cpu_buffer
->record_disabled
))
2721 if (length
> BUF_MAX_DATA_SIZE
)
2724 event
= rb_reserve_next_event(buffer
, cpu_buffer
, length
);
2731 trace_recursive_unlock();
2734 preempt_enable_notrace();
2737 EXPORT_SYMBOL_GPL(ring_buffer_lock_reserve
);
2740 rb_update_write_stamp(struct ring_buffer_per_cpu
*cpu_buffer
,
2741 struct ring_buffer_event
*event
)
2746 * The event first in the commit queue updates the
2749 if (rb_event_is_commit(cpu_buffer
, event
)) {
2751 * A commit event that is first on a page
2752 * updates the write timestamp with the page stamp
2754 if (!rb_event_index(event
))
2755 cpu_buffer
->write_stamp
=
2756 cpu_buffer
->commit_page
->page
->time_stamp
;
2757 else if (event
->type_len
== RINGBUF_TYPE_TIME_EXTEND
) {
2758 delta
= event
->array
[0];
2760 delta
+= event
->time_delta
;
2761 cpu_buffer
->write_stamp
+= delta
;
2763 cpu_buffer
->write_stamp
+= event
->time_delta
;
2767 static void rb_commit(struct ring_buffer_per_cpu
*cpu_buffer
,
2768 struct ring_buffer_event
*event
)
2770 local_inc(&cpu_buffer
->entries
);
2771 rb_update_write_stamp(cpu_buffer
, event
);
2772 rb_end_commit(cpu_buffer
);
2775 static __always_inline
void
2776 rb_wakeups(struct ring_buffer
*buffer
, struct ring_buffer_per_cpu
*cpu_buffer
)
2778 if (buffer
->irq_work
.waiters_pending
) {
2779 buffer
->irq_work
.waiters_pending
= false;
2780 /* irq_work_queue() supplies it's own memory barriers */
2781 irq_work_queue(&buffer
->irq_work
.work
);
2784 if (cpu_buffer
->irq_work
.waiters_pending
) {
2785 cpu_buffer
->irq_work
.waiters_pending
= false;
2786 /* irq_work_queue() supplies it's own memory barriers */
2787 irq_work_queue(&cpu_buffer
->irq_work
.work
);
2792 * ring_buffer_unlock_commit - commit a reserved
2793 * @buffer: The buffer to commit to
2794 * @event: The event pointer to commit.
2796 * This commits the data to the ring buffer, and releases any locks held.
2798 * Must be paired with ring_buffer_lock_reserve.
2800 int ring_buffer_unlock_commit(struct ring_buffer
*buffer
,
2801 struct ring_buffer_event
*event
)
2803 struct ring_buffer_per_cpu
*cpu_buffer
;
2804 int cpu
= raw_smp_processor_id();
2806 cpu_buffer
= buffer
->buffers
[cpu
];
2808 rb_commit(cpu_buffer
, event
);
2810 rb_wakeups(buffer
, cpu_buffer
);
2812 trace_recursive_unlock();
2814 preempt_enable_notrace();
2818 EXPORT_SYMBOL_GPL(ring_buffer_unlock_commit
);
2820 static inline void rb_event_discard(struct ring_buffer_event
*event
)
2822 if (event
->type_len
== RINGBUF_TYPE_TIME_EXTEND
)
2823 event
= skip_time_extend(event
);
2825 /* array[0] holds the actual length for the discarded event */
2826 event
->array
[0] = rb_event_data_length(event
) - RB_EVNT_HDR_SIZE
;
2827 event
->type_len
= RINGBUF_TYPE_PADDING
;
2828 /* time delta must be non zero */
2829 if (!event
->time_delta
)
2830 event
->time_delta
= 1;
2834 * Decrement the entries to the page that an event is on.
2835 * The event does not even need to exist, only the pointer
2836 * to the page it is on. This may only be called before the commit
2840 rb_decrement_entry(struct ring_buffer_per_cpu
*cpu_buffer
,
2841 struct ring_buffer_event
*event
)
2843 unsigned long addr
= (unsigned long)event
;
2844 struct buffer_page
*bpage
= cpu_buffer
->commit_page
;
2845 struct buffer_page
*start
;
2849 /* Do the likely case first */
2850 if (likely(bpage
->page
== (void *)addr
)) {
2851 local_dec(&bpage
->entries
);
2856 * Because the commit page may be on the reader page we
2857 * start with the next page and check the end loop there.
2859 rb_inc_page(cpu_buffer
, &bpage
);
2862 if (bpage
->page
== (void *)addr
) {
2863 local_dec(&bpage
->entries
);
2866 rb_inc_page(cpu_buffer
, &bpage
);
2867 } while (bpage
!= start
);
2869 /* commit not part of this buffer?? */
2870 RB_WARN_ON(cpu_buffer
, 1);
2874 * ring_buffer_commit_discard - discard an event that has not been committed
2875 * @buffer: the ring buffer
2876 * @event: non committed event to discard
2878 * Sometimes an event that is in the ring buffer needs to be ignored.
2879 * This function lets the user discard an event in the ring buffer
2880 * and then that event will not be read later.
2882 * This function only works if it is called before the the item has been
2883 * committed. It will try to free the event from the ring buffer
2884 * if another event has not been added behind it.
2886 * If another event has been added behind it, it will set the event
2887 * up as discarded, and perform the commit.
2889 * If this function is called, do not call ring_buffer_unlock_commit on
2892 void ring_buffer_discard_commit(struct ring_buffer
*buffer
,
2893 struct ring_buffer_event
*event
)
2895 struct ring_buffer_per_cpu
*cpu_buffer
;
2898 /* The event is discarded regardless */
2899 rb_event_discard(event
);
2901 cpu
= smp_processor_id();
2902 cpu_buffer
= buffer
->buffers
[cpu
];
2905 * This must only be called if the event has not been
2906 * committed yet. Thus we can assume that preemption
2907 * is still disabled.
2909 RB_WARN_ON(buffer
, !local_read(&cpu_buffer
->committing
));
2911 rb_decrement_entry(cpu_buffer
, event
);
2912 if (rb_try_to_discard(cpu_buffer
, event
))
2916 * The commit is still visible by the reader, so we
2917 * must still update the timestamp.
2919 rb_update_write_stamp(cpu_buffer
, event
);
2921 rb_end_commit(cpu_buffer
);
2923 trace_recursive_unlock();
2925 preempt_enable_notrace();
2928 EXPORT_SYMBOL_GPL(ring_buffer_discard_commit
);
2931 * ring_buffer_write - write data to the buffer without reserving
2932 * @buffer: The ring buffer to write to.
2933 * @length: The length of the data being written (excluding the event header)
2934 * @data: The data to write to the buffer.
2936 * This is like ring_buffer_lock_reserve and ring_buffer_unlock_commit as
2937 * one function. If you already have the data to write to the buffer, it
2938 * may be easier to simply call this function.
2940 * Note, like ring_buffer_lock_reserve, the length is the length of the data
2941 * and not the length of the event which would hold the header.
2943 int ring_buffer_write(struct ring_buffer
*buffer
,
2944 unsigned long length
,
2947 struct ring_buffer_per_cpu
*cpu_buffer
;
2948 struct ring_buffer_event
*event
;
2953 if (ring_buffer_flags
!= RB_BUFFERS_ON
)
2956 preempt_disable_notrace();
2958 if (atomic_read(&buffer
->record_disabled
))
2961 cpu
= raw_smp_processor_id();
2963 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
2966 cpu_buffer
= buffer
->buffers
[cpu
];
2968 if (atomic_read(&cpu_buffer
->record_disabled
))
2971 if (length
> BUF_MAX_DATA_SIZE
)
2974 event
= rb_reserve_next_event(buffer
, cpu_buffer
, length
);
2978 body
= rb_event_data(event
);
2980 memcpy(body
, data
, length
);
2982 rb_commit(cpu_buffer
, event
);
2984 rb_wakeups(buffer
, cpu_buffer
);
2988 preempt_enable_notrace();
2992 EXPORT_SYMBOL_GPL(ring_buffer_write
);
2994 static int rb_per_cpu_empty(struct ring_buffer_per_cpu
*cpu_buffer
)
2996 struct buffer_page
*reader
= cpu_buffer
->reader_page
;
2997 struct buffer_page
*head
= rb_set_head_page(cpu_buffer
);
2998 struct buffer_page
*commit
= cpu_buffer
->commit_page
;
3000 /* In case of error, head will be NULL */
3001 if (unlikely(!head
))
3004 return reader
->read
== rb_page_commit(reader
) &&
3005 (commit
== reader
||
3007 head
->read
== rb_page_commit(commit
)));
3011 * ring_buffer_record_disable - stop all writes into the buffer
3012 * @buffer: The ring buffer to stop writes to.
3014 * This prevents all writes to the buffer. Any attempt to write
3015 * to the buffer after this will fail and return NULL.
3017 * The caller should call synchronize_sched() after this.
3019 void ring_buffer_record_disable(struct ring_buffer
*buffer
)
3021 atomic_inc(&buffer
->record_disabled
);
3023 EXPORT_SYMBOL_GPL(ring_buffer_record_disable
);
3026 * ring_buffer_record_enable - enable writes to the buffer
3027 * @buffer: The ring buffer to enable writes
3029 * Note, multiple disables will need the same number of enables
3030 * to truly enable the writing (much like preempt_disable).
3032 void ring_buffer_record_enable(struct ring_buffer
*buffer
)
3034 atomic_dec(&buffer
->record_disabled
);
3036 EXPORT_SYMBOL_GPL(ring_buffer_record_enable
);
3039 * ring_buffer_record_off - stop all writes into the buffer
3040 * @buffer: The ring buffer to stop writes to.
3042 * This prevents all writes to the buffer. Any attempt to write
3043 * to the buffer after this will fail and return NULL.
3045 * This is different than ring_buffer_record_disable() as
3046 * it works like an on/off switch, where as the disable() version
3047 * must be paired with a enable().
3049 void ring_buffer_record_off(struct ring_buffer
*buffer
)
3052 unsigned int new_rd
;
3055 rd
= atomic_read(&buffer
->record_disabled
);
3056 new_rd
= rd
| RB_BUFFER_OFF
;
3057 } while (atomic_cmpxchg(&buffer
->record_disabled
, rd
, new_rd
) != rd
);
3059 EXPORT_SYMBOL_GPL(ring_buffer_record_off
);
3062 * ring_buffer_record_on - restart writes into the buffer
3063 * @buffer: The ring buffer to start writes to.
3065 * This enables all writes to the buffer that was disabled by
3066 * ring_buffer_record_off().
3068 * This is different than ring_buffer_record_enable() as
3069 * it works like an on/off switch, where as the enable() version
3070 * must be paired with a disable().
3072 void ring_buffer_record_on(struct ring_buffer
*buffer
)
3075 unsigned int new_rd
;
3078 rd
= atomic_read(&buffer
->record_disabled
);
3079 new_rd
= rd
& ~RB_BUFFER_OFF
;
3080 } while (atomic_cmpxchg(&buffer
->record_disabled
, rd
, new_rd
) != rd
);
3082 EXPORT_SYMBOL_GPL(ring_buffer_record_on
);
3085 * ring_buffer_record_is_on - return true if the ring buffer can write
3086 * @buffer: The ring buffer to see if write is enabled
3088 * Returns true if the ring buffer is in a state that it accepts writes.
3090 int ring_buffer_record_is_on(struct ring_buffer
*buffer
)
3092 return !atomic_read(&buffer
->record_disabled
);
3096 * ring_buffer_record_disable_cpu - stop all writes into the cpu_buffer
3097 * @buffer: The ring buffer to stop writes to.
3098 * @cpu: The CPU buffer to stop
3100 * This prevents all writes to the buffer. Any attempt to write
3101 * to the buffer after this will fail and return NULL.
3103 * The caller should call synchronize_sched() after this.
3105 void ring_buffer_record_disable_cpu(struct ring_buffer
*buffer
, int cpu
)
3107 struct ring_buffer_per_cpu
*cpu_buffer
;
3109 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
3112 cpu_buffer
= buffer
->buffers
[cpu
];
3113 atomic_inc(&cpu_buffer
->record_disabled
);
3115 EXPORT_SYMBOL_GPL(ring_buffer_record_disable_cpu
);
3118 * ring_buffer_record_enable_cpu - enable writes to the buffer
3119 * @buffer: The ring buffer to enable writes
3120 * @cpu: The CPU to enable.
3122 * Note, multiple disables will need the same number of enables
3123 * to truly enable the writing (much like preempt_disable).
3125 void ring_buffer_record_enable_cpu(struct ring_buffer
*buffer
, int cpu
)
3127 struct ring_buffer_per_cpu
*cpu_buffer
;
3129 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
3132 cpu_buffer
= buffer
->buffers
[cpu
];
3133 atomic_dec(&cpu_buffer
->record_disabled
);
3135 EXPORT_SYMBOL_GPL(ring_buffer_record_enable_cpu
);
3138 * The total entries in the ring buffer is the running counter
3139 * of entries entered into the ring buffer, minus the sum of
3140 * the entries read from the ring buffer and the number of
3141 * entries that were overwritten.
3143 static inline unsigned long
3144 rb_num_of_entries(struct ring_buffer_per_cpu
*cpu_buffer
)
3146 return local_read(&cpu_buffer
->entries
) -
3147 (local_read(&cpu_buffer
->overrun
) + cpu_buffer
->read
);
3151 * ring_buffer_oldest_event_ts - get the oldest event timestamp from the buffer
3152 * @buffer: The ring buffer
3153 * @cpu: The per CPU buffer to read from.
3155 u64
ring_buffer_oldest_event_ts(struct ring_buffer
*buffer
, int cpu
)
3157 unsigned long flags
;
3158 struct ring_buffer_per_cpu
*cpu_buffer
;
3159 struct buffer_page
*bpage
;
3162 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
3165 cpu_buffer
= buffer
->buffers
[cpu
];
3166 raw_spin_lock_irqsave(&cpu_buffer
->reader_lock
, flags
);
3168 * if the tail is on reader_page, oldest time stamp is on the reader
3171 if (cpu_buffer
->tail_page
== cpu_buffer
->reader_page
)
3172 bpage
= cpu_buffer
->reader_page
;
3174 bpage
= rb_set_head_page(cpu_buffer
);
3176 ret
= bpage
->page
->time_stamp
;
3177 raw_spin_unlock_irqrestore(&cpu_buffer
->reader_lock
, flags
);
3181 EXPORT_SYMBOL_GPL(ring_buffer_oldest_event_ts
);
3184 * ring_buffer_bytes_cpu - get the number of bytes consumed in a cpu buffer
3185 * @buffer: The ring buffer
3186 * @cpu: The per CPU buffer to read from.
3188 unsigned long ring_buffer_bytes_cpu(struct ring_buffer
*buffer
, int cpu
)
3190 struct ring_buffer_per_cpu
*cpu_buffer
;
3193 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
3196 cpu_buffer
= buffer
->buffers
[cpu
];
3197 ret
= local_read(&cpu_buffer
->entries_bytes
) - cpu_buffer
->read_bytes
;
3201 EXPORT_SYMBOL_GPL(ring_buffer_bytes_cpu
);
3204 * ring_buffer_entries_cpu - get the number of entries in a cpu buffer
3205 * @buffer: The ring buffer
3206 * @cpu: The per CPU buffer to get the entries from.
3208 unsigned long ring_buffer_entries_cpu(struct ring_buffer
*buffer
, int cpu
)
3210 struct ring_buffer_per_cpu
*cpu_buffer
;
3212 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
3215 cpu_buffer
= buffer
->buffers
[cpu
];
3217 return rb_num_of_entries(cpu_buffer
);
3219 EXPORT_SYMBOL_GPL(ring_buffer_entries_cpu
);
3222 * ring_buffer_overrun_cpu - get the number of overruns caused by the ring
3223 * buffer wrapping around (only if RB_FL_OVERWRITE is on).
3224 * @buffer: The ring buffer
3225 * @cpu: The per CPU buffer to get the number of overruns from
3227 unsigned long ring_buffer_overrun_cpu(struct ring_buffer
*buffer
, int cpu
)
3229 struct ring_buffer_per_cpu
*cpu_buffer
;
3232 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
3235 cpu_buffer
= buffer
->buffers
[cpu
];
3236 ret
= local_read(&cpu_buffer
->overrun
);
3240 EXPORT_SYMBOL_GPL(ring_buffer_overrun_cpu
);
3243 * ring_buffer_commit_overrun_cpu - get the number of overruns caused by
3244 * commits failing due to the buffer wrapping around while there are uncommitted
3245 * events, such as during an interrupt storm.
3246 * @buffer: The ring buffer
3247 * @cpu: The per CPU buffer to get the number of overruns from
3250 ring_buffer_commit_overrun_cpu(struct ring_buffer
*buffer
, int cpu
)
3252 struct ring_buffer_per_cpu
*cpu_buffer
;
3255 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
3258 cpu_buffer
= buffer
->buffers
[cpu
];
3259 ret
= local_read(&cpu_buffer
->commit_overrun
);
3263 EXPORT_SYMBOL_GPL(ring_buffer_commit_overrun_cpu
);
3266 * ring_buffer_dropped_events_cpu - get the number of dropped events caused by
3267 * the ring buffer filling up (only if RB_FL_OVERWRITE is off).
3268 * @buffer: The ring buffer
3269 * @cpu: The per CPU buffer to get the number of overruns from
3272 ring_buffer_dropped_events_cpu(struct ring_buffer
*buffer
, int cpu
)
3274 struct ring_buffer_per_cpu
*cpu_buffer
;
3277 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
3280 cpu_buffer
= buffer
->buffers
[cpu
];
3281 ret
= local_read(&cpu_buffer
->dropped_events
);
3285 EXPORT_SYMBOL_GPL(ring_buffer_dropped_events_cpu
);
3288 * ring_buffer_read_events_cpu - get the number of events successfully read
3289 * @buffer: The ring buffer
3290 * @cpu: The per CPU buffer to get the number of events read
3293 ring_buffer_read_events_cpu(struct ring_buffer
*buffer
, int cpu
)
3295 struct ring_buffer_per_cpu
*cpu_buffer
;
3297 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
3300 cpu_buffer
= buffer
->buffers
[cpu
];
3301 return cpu_buffer
->read
;
3303 EXPORT_SYMBOL_GPL(ring_buffer_read_events_cpu
);
3306 * ring_buffer_entries - get the number of entries in a buffer
3307 * @buffer: The ring buffer
3309 * Returns the total number of entries in the ring buffer
3312 unsigned long ring_buffer_entries(struct ring_buffer
*buffer
)
3314 struct ring_buffer_per_cpu
*cpu_buffer
;
3315 unsigned long entries
= 0;
3318 /* if you care about this being correct, lock the buffer */
3319 for_each_buffer_cpu(buffer
, cpu
) {
3320 cpu_buffer
= buffer
->buffers
[cpu
];
3321 entries
+= rb_num_of_entries(cpu_buffer
);
3326 EXPORT_SYMBOL_GPL(ring_buffer_entries
);
3329 * ring_buffer_overruns - get the number of overruns in buffer
3330 * @buffer: The ring buffer
3332 * Returns the total number of overruns in the ring buffer
3335 unsigned long ring_buffer_overruns(struct ring_buffer
*buffer
)
3337 struct ring_buffer_per_cpu
*cpu_buffer
;
3338 unsigned long overruns
= 0;
3341 /* if you care about this being correct, lock the buffer */
3342 for_each_buffer_cpu(buffer
, cpu
) {
3343 cpu_buffer
= buffer
->buffers
[cpu
];
3344 overruns
+= local_read(&cpu_buffer
->overrun
);
3349 EXPORT_SYMBOL_GPL(ring_buffer_overruns
);
3351 static void rb_iter_reset(struct ring_buffer_iter
*iter
)
3353 struct ring_buffer_per_cpu
*cpu_buffer
= iter
->cpu_buffer
;
3355 /* Iterator usage is expected to have record disabled */
3356 iter
->head_page
= cpu_buffer
->reader_page
;
3357 iter
->head
= cpu_buffer
->reader_page
->read
;
3359 iter
->cache_reader_page
= iter
->head_page
;
3360 iter
->cache_read
= iter
->head
;
3363 iter
->read_stamp
= cpu_buffer
->read_stamp
;
3365 iter
->read_stamp
= iter
->head_page
->page
->time_stamp
;
3369 * ring_buffer_iter_reset - reset an iterator
3370 * @iter: The iterator to reset
3372 * Resets the iterator, so that it will start from the beginning
3375 void ring_buffer_iter_reset(struct ring_buffer_iter
*iter
)
3377 struct ring_buffer_per_cpu
*cpu_buffer
;
3378 unsigned long flags
;
3383 cpu_buffer
= iter
->cpu_buffer
;
3385 raw_spin_lock_irqsave(&cpu_buffer
->reader_lock
, flags
);
3386 rb_iter_reset(iter
);
3387 raw_spin_unlock_irqrestore(&cpu_buffer
->reader_lock
, flags
);
3389 EXPORT_SYMBOL_GPL(ring_buffer_iter_reset
);
3392 * ring_buffer_iter_empty - check if an iterator has no more to read
3393 * @iter: The iterator to check
3395 int ring_buffer_iter_empty(struct ring_buffer_iter
*iter
)
3397 struct ring_buffer_per_cpu
*cpu_buffer
;
3399 cpu_buffer
= iter
->cpu_buffer
;
3401 return iter
->head_page
== cpu_buffer
->commit_page
&&
3402 iter
->head
== rb_commit_index(cpu_buffer
);
3404 EXPORT_SYMBOL_GPL(ring_buffer_iter_empty
);
3407 rb_update_read_stamp(struct ring_buffer_per_cpu
*cpu_buffer
,
3408 struct ring_buffer_event
*event
)
3412 switch (event
->type_len
) {
3413 case RINGBUF_TYPE_PADDING
:
3416 case RINGBUF_TYPE_TIME_EXTEND
:
3417 delta
= event
->array
[0];
3419 delta
+= event
->time_delta
;
3420 cpu_buffer
->read_stamp
+= delta
;
3423 case RINGBUF_TYPE_TIME_STAMP
:
3424 /* FIXME: not implemented */
3427 case RINGBUF_TYPE_DATA
:
3428 cpu_buffer
->read_stamp
+= event
->time_delta
;
3438 rb_update_iter_read_stamp(struct ring_buffer_iter
*iter
,
3439 struct ring_buffer_event
*event
)
3443 switch (event
->type_len
) {
3444 case RINGBUF_TYPE_PADDING
:
3447 case RINGBUF_TYPE_TIME_EXTEND
:
3448 delta
= event
->array
[0];
3450 delta
+= event
->time_delta
;
3451 iter
->read_stamp
+= delta
;
3454 case RINGBUF_TYPE_TIME_STAMP
:
3455 /* FIXME: not implemented */
3458 case RINGBUF_TYPE_DATA
:
3459 iter
->read_stamp
+= event
->time_delta
;
3468 static struct buffer_page
*
3469 rb_get_reader_page(struct ring_buffer_per_cpu
*cpu_buffer
)
3471 struct buffer_page
*reader
= NULL
;
3472 unsigned long overwrite
;
3473 unsigned long flags
;
3477 local_irq_save(flags
);
3478 arch_spin_lock(&cpu_buffer
->lock
);
3482 * This should normally only loop twice. But because the
3483 * start of the reader inserts an empty page, it causes
3484 * a case where we will loop three times. There should be no
3485 * reason to loop four times (that I know of).
3487 if (RB_WARN_ON(cpu_buffer
, ++nr_loops
> 3)) {
3492 reader
= cpu_buffer
->reader_page
;
3494 /* If there's more to read, return this page */
3495 if (cpu_buffer
->reader_page
->read
< rb_page_size(reader
))
3498 /* Never should we have an index greater than the size */
3499 if (RB_WARN_ON(cpu_buffer
,
3500 cpu_buffer
->reader_page
->read
> rb_page_size(reader
)))
3503 /* check if we caught up to the tail */
3505 if (cpu_buffer
->commit_page
== cpu_buffer
->reader_page
)
3508 /* Don't bother swapping if the ring buffer is empty */
3509 if (rb_num_of_entries(cpu_buffer
) == 0)
3513 * Reset the reader page to size zero.
3515 local_set(&cpu_buffer
->reader_page
->write
, 0);
3516 local_set(&cpu_buffer
->reader_page
->entries
, 0);
3517 local_set(&cpu_buffer
->reader_page
->page
->commit
, 0);
3518 cpu_buffer
->reader_page
->real_end
= 0;
3522 * Splice the empty reader page into the list around the head.
3524 reader
= rb_set_head_page(cpu_buffer
);
3527 cpu_buffer
->reader_page
->list
.next
= rb_list_head(reader
->list
.next
);
3528 cpu_buffer
->reader_page
->list
.prev
= reader
->list
.prev
;
3531 * cpu_buffer->pages just needs to point to the buffer, it
3532 * has no specific buffer page to point to. Lets move it out
3533 * of our way so we don't accidentally swap it.
3535 cpu_buffer
->pages
= reader
->list
.prev
;
3537 /* The reader page will be pointing to the new head */
3538 rb_set_list_to_head(cpu_buffer
, &cpu_buffer
->reader_page
->list
);
3541 * We want to make sure we read the overruns after we set up our
3542 * pointers to the next object. The writer side does a
3543 * cmpxchg to cross pages which acts as the mb on the writer
3544 * side. Note, the reader will constantly fail the swap
3545 * while the writer is updating the pointers, so this
3546 * guarantees that the overwrite recorded here is the one we
3547 * want to compare with the last_overrun.
3550 overwrite
= local_read(&(cpu_buffer
->overrun
));
3553 * Here's the tricky part.
3555 * We need to move the pointer past the header page.
3556 * But we can only do that if a writer is not currently
3557 * moving it. The page before the header page has the
3558 * flag bit '1' set if it is pointing to the page we want.
3559 * but if the writer is in the process of moving it
3560 * than it will be '2' or already moved '0'.
3563 ret
= rb_head_page_replace(reader
, cpu_buffer
->reader_page
);
3566 * If we did not convert it, then we must try again.
3572 * Yeah! We succeeded in replacing the page.
3574 * Now make the new head point back to the reader page.
3576 rb_list_head(reader
->list
.next
)->prev
= &cpu_buffer
->reader_page
->list
;
3577 rb_inc_page(cpu_buffer
, &cpu_buffer
->head_page
);
3579 /* Finally update the reader page to the new head */
3580 cpu_buffer
->reader_page
= reader
;
3581 rb_reset_reader_page(cpu_buffer
);
3583 if (overwrite
!= cpu_buffer
->last_overrun
) {
3584 cpu_buffer
->lost_events
= overwrite
- cpu_buffer
->last_overrun
;
3585 cpu_buffer
->last_overrun
= overwrite
;
3591 arch_spin_unlock(&cpu_buffer
->lock
);
3592 local_irq_restore(flags
);
3597 static void rb_advance_reader(struct ring_buffer_per_cpu
*cpu_buffer
)
3599 struct ring_buffer_event
*event
;
3600 struct buffer_page
*reader
;
3603 reader
= rb_get_reader_page(cpu_buffer
);
3605 /* This function should not be called when buffer is empty */
3606 if (RB_WARN_ON(cpu_buffer
, !reader
))
3609 event
= rb_reader_event(cpu_buffer
);
3611 if (event
->type_len
<= RINGBUF_TYPE_DATA_TYPE_LEN_MAX
)
3614 rb_update_read_stamp(cpu_buffer
, event
);
3616 length
= rb_event_length(event
);
3617 cpu_buffer
->reader_page
->read
+= length
;
3620 static void rb_advance_iter(struct ring_buffer_iter
*iter
)
3622 struct ring_buffer_per_cpu
*cpu_buffer
;
3623 struct ring_buffer_event
*event
;
3626 cpu_buffer
= iter
->cpu_buffer
;
3629 * Check if we are at the end of the buffer.
3631 if (iter
->head
>= rb_page_size(iter
->head_page
)) {
3632 /* discarded commits can make the page empty */
3633 if (iter
->head_page
== cpu_buffer
->commit_page
)
3639 event
= rb_iter_head_event(iter
);
3641 length
= rb_event_length(event
);
3644 * This should not be called to advance the header if we are
3645 * at the tail of the buffer.
3647 if (RB_WARN_ON(cpu_buffer
,
3648 (iter
->head_page
== cpu_buffer
->commit_page
) &&
3649 (iter
->head
+ length
> rb_commit_index(cpu_buffer
))))
3652 rb_update_iter_read_stamp(iter
, event
);
3654 iter
->head
+= length
;
3656 /* check for end of page padding */
3657 if ((iter
->head
>= rb_page_size(iter
->head_page
)) &&
3658 (iter
->head_page
!= cpu_buffer
->commit_page
))
3662 static int rb_lost_events(struct ring_buffer_per_cpu
*cpu_buffer
)
3664 return cpu_buffer
->lost_events
;
3667 static struct ring_buffer_event
*
3668 rb_buffer_peek(struct ring_buffer_per_cpu
*cpu_buffer
, u64
*ts
,
3669 unsigned long *lost_events
)
3671 struct ring_buffer_event
*event
;
3672 struct buffer_page
*reader
;
3677 * We repeat when a time extend is encountered.
3678 * Since the time extend is always attached to a data event,
3679 * we should never loop more than once.
3680 * (We never hit the following condition more than twice).
3682 if (RB_WARN_ON(cpu_buffer
, ++nr_loops
> 2))
3685 reader
= rb_get_reader_page(cpu_buffer
);
3689 event
= rb_reader_event(cpu_buffer
);
3691 switch (event
->type_len
) {
3692 case RINGBUF_TYPE_PADDING
:
3693 if (rb_null_event(event
))
3694 RB_WARN_ON(cpu_buffer
, 1);
3696 * Because the writer could be discarding every
3697 * event it creates (which would probably be bad)
3698 * if we were to go back to "again" then we may never
3699 * catch up, and will trigger the warn on, or lock
3700 * the box. Return the padding, and we will release
3701 * the current locks, and try again.
3705 case RINGBUF_TYPE_TIME_EXTEND
:
3706 /* Internal data, OK to advance */
3707 rb_advance_reader(cpu_buffer
);
3710 case RINGBUF_TYPE_TIME_STAMP
:
3711 /* FIXME: not implemented */
3712 rb_advance_reader(cpu_buffer
);
3715 case RINGBUF_TYPE_DATA
:
3717 *ts
= cpu_buffer
->read_stamp
+ event
->time_delta
;
3718 ring_buffer_normalize_time_stamp(cpu_buffer
->buffer
,
3719 cpu_buffer
->cpu
, ts
);
3722 *lost_events
= rb_lost_events(cpu_buffer
);
3731 EXPORT_SYMBOL_GPL(ring_buffer_peek
);
3733 static struct ring_buffer_event
*
3734 rb_iter_peek(struct ring_buffer_iter
*iter
, u64
*ts
)
3736 struct ring_buffer
*buffer
;
3737 struct ring_buffer_per_cpu
*cpu_buffer
;
3738 struct ring_buffer_event
*event
;
3741 cpu_buffer
= iter
->cpu_buffer
;
3742 buffer
= cpu_buffer
->buffer
;
3745 * Check if someone performed a consuming read to
3746 * the buffer. A consuming read invalidates the iterator
3747 * and we need to reset the iterator in this case.
3749 if (unlikely(iter
->cache_read
!= cpu_buffer
->read
||
3750 iter
->cache_reader_page
!= cpu_buffer
->reader_page
))
3751 rb_iter_reset(iter
);
3754 if (ring_buffer_iter_empty(iter
))
3758 * We repeat when a time extend is encountered or we hit
3759 * the end of the page. Since the time extend is always attached
3760 * to a data event, we should never loop more than three times.
3761 * Once for going to next page, once on time extend, and
3762 * finally once to get the event.
3763 * (We never hit the following condition more than thrice).
3765 if (RB_WARN_ON(cpu_buffer
, ++nr_loops
> 3))
3768 if (rb_per_cpu_empty(cpu_buffer
))
3771 if (iter
->head
>= local_read(&iter
->head_page
->page
->commit
)) {
3776 event
= rb_iter_head_event(iter
);
3778 switch (event
->type_len
) {
3779 case RINGBUF_TYPE_PADDING
:
3780 if (rb_null_event(event
)) {
3784 rb_advance_iter(iter
);
3787 case RINGBUF_TYPE_TIME_EXTEND
:
3788 /* Internal data, OK to advance */
3789 rb_advance_iter(iter
);
3792 case RINGBUF_TYPE_TIME_STAMP
:
3793 /* FIXME: not implemented */
3794 rb_advance_iter(iter
);
3797 case RINGBUF_TYPE_DATA
:
3799 *ts
= iter
->read_stamp
+ event
->time_delta
;
3800 ring_buffer_normalize_time_stamp(buffer
,
3801 cpu_buffer
->cpu
, ts
);
3811 EXPORT_SYMBOL_GPL(ring_buffer_iter_peek
);
3813 static inline int rb_ok_to_lock(void)
3816 * If an NMI die dumps out the content of the ring buffer
3817 * do not grab locks. We also permanently disable the ring
3818 * buffer too. A one time deal is all you get from reading
3819 * the ring buffer from an NMI.
3821 if (likely(!in_nmi()))
3824 tracing_off_permanent();
3829 * ring_buffer_peek - peek at the next event to be read
3830 * @buffer: The ring buffer to read
3831 * @cpu: The cpu to peak at
3832 * @ts: The timestamp counter of this event.
3833 * @lost_events: a variable to store if events were lost (may be NULL)
3835 * This will return the event that will be read next, but does
3836 * not consume the data.
3838 struct ring_buffer_event
*
3839 ring_buffer_peek(struct ring_buffer
*buffer
, int cpu
, u64
*ts
,
3840 unsigned long *lost_events
)
3842 struct ring_buffer_per_cpu
*cpu_buffer
= buffer
->buffers
[cpu
];
3843 struct ring_buffer_event
*event
;
3844 unsigned long flags
;
3847 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
3850 dolock
= rb_ok_to_lock();
3852 local_irq_save(flags
);
3854 raw_spin_lock(&cpu_buffer
->reader_lock
);
3855 event
= rb_buffer_peek(cpu_buffer
, ts
, lost_events
);
3856 if (event
&& event
->type_len
== RINGBUF_TYPE_PADDING
)
3857 rb_advance_reader(cpu_buffer
);
3859 raw_spin_unlock(&cpu_buffer
->reader_lock
);
3860 local_irq_restore(flags
);
3862 if (event
&& event
->type_len
== RINGBUF_TYPE_PADDING
)
3869 * ring_buffer_iter_peek - peek at the next event to be read
3870 * @iter: The ring buffer iterator
3871 * @ts: The timestamp counter of this event.
3873 * This will return the event that will be read next, but does
3874 * not increment the iterator.
3876 struct ring_buffer_event
*
3877 ring_buffer_iter_peek(struct ring_buffer_iter
*iter
, u64
*ts
)
3879 struct ring_buffer_per_cpu
*cpu_buffer
= iter
->cpu_buffer
;
3880 struct ring_buffer_event
*event
;
3881 unsigned long flags
;
3884 raw_spin_lock_irqsave(&cpu_buffer
->reader_lock
, flags
);
3885 event
= rb_iter_peek(iter
, ts
);
3886 raw_spin_unlock_irqrestore(&cpu_buffer
->reader_lock
, flags
);
3888 if (event
&& event
->type_len
== RINGBUF_TYPE_PADDING
)
3895 * ring_buffer_consume - return an event and consume it
3896 * @buffer: The ring buffer to get the next event from
3897 * @cpu: the cpu to read the buffer from
3898 * @ts: a variable to store the timestamp (may be NULL)
3899 * @lost_events: a variable to store if events were lost (may be NULL)
3901 * Returns the next event in the ring buffer, and that event is consumed.
3902 * Meaning, that sequential reads will keep returning a different event,
3903 * and eventually empty the ring buffer if the producer is slower.
3905 struct ring_buffer_event
*
3906 ring_buffer_consume(struct ring_buffer
*buffer
, int cpu
, u64
*ts
,
3907 unsigned long *lost_events
)
3909 struct ring_buffer_per_cpu
*cpu_buffer
;
3910 struct ring_buffer_event
*event
= NULL
;
3911 unsigned long flags
;
3914 dolock
= rb_ok_to_lock();
3917 /* might be called in atomic */
3920 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
3923 cpu_buffer
= buffer
->buffers
[cpu
];
3924 local_irq_save(flags
);
3926 raw_spin_lock(&cpu_buffer
->reader_lock
);
3928 event
= rb_buffer_peek(cpu_buffer
, ts
, lost_events
);
3930 cpu_buffer
->lost_events
= 0;
3931 rb_advance_reader(cpu_buffer
);
3935 raw_spin_unlock(&cpu_buffer
->reader_lock
);
3936 local_irq_restore(flags
);
3941 if (event
&& event
->type_len
== RINGBUF_TYPE_PADDING
)
3946 EXPORT_SYMBOL_GPL(ring_buffer_consume
);
3949 * ring_buffer_read_prepare - Prepare for a non consuming read of the buffer
3950 * @buffer: The ring buffer to read from
3951 * @cpu: The cpu buffer to iterate over
3953 * This performs the initial preparations necessary to iterate
3954 * through the buffer. Memory is allocated, buffer recording
3955 * is disabled, and the iterator pointer is returned to the caller.
3957 * Disabling buffer recordng prevents the reading from being
3958 * corrupted. This is not a consuming read, so a producer is not
3961 * After a sequence of ring_buffer_read_prepare calls, the user is
3962 * expected to make at least one call to ring_buffer_prepare_sync.
3963 * Afterwards, ring_buffer_read_start is invoked to get things going
3966 * This overall must be paired with ring_buffer_finish.
3968 struct ring_buffer_iter
*
3969 ring_buffer_read_prepare(struct ring_buffer
*buffer
, int cpu
)
3971 struct ring_buffer_per_cpu
*cpu_buffer
;
3972 struct ring_buffer_iter
*iter
;
3974 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
3977 iter
= kmalloc(sizeof(*iter
), GFP_KERNEL
);
3981 cpu_buffer
= buffer
->buffers
[cpu
];
3983 iter
->cpu_buffer
= cpu_buffer
;
3985 atomic_inc(&buffer
->resize_disabled
);
3986 atomic_inc(&cpu_buffer
->record_disabled
);
3990 EXPORT_SYMBOL_GPL(ring_buffer_read_prepare
);
3993 * ring_buffer_read_prepare_sync - Synchronize a set of prepare calls
3995 * All previously invoked ring_buffer_read_prepare calls to prepare
3996 * iterators will be synchronized. Afterwards, read_buffer_read_start
3997 * calls on those iterators are allowed.
4000 ring_buffer_read_prepare_sync(void)
4002 synchronize_sched();
4004 EXPORT_SYMBOL_GPL(ring_buffer_read_prepare_sync
);
4007 * ring_buffer_read_start - start a non consuming read of the buffer
4008 * @iter: The iterator returned by ring_buffer_read_prepare
4010 * This finalizes the startup of an iteration through the buffer.
4011 * The iterator comes from a call to ring_buffer_read_prepare and
4012 * an intervening ring_buffer_read_prepare_sync must have been
4015 * Must be paired with ring_buffer_finish.
4018 ring_buffer_read_start(struct ring_buffer_iter
*iter
)
4020 struct ring_buffer_per_cpu
*cpu_buffer
;
4021 unsigned long flags
;
4026 cpu_buffer
= iter
->cpu_buffer
;
4028 raw_spin_lock_irqsave(&cpu_buffer
->reader_lock
, flags
);
4029 arch_spin_lock(&cpu_buffer
->lock
);
4030 rb_iter_reset(iter
);
4031 arch_spin_unlock(&cpu_buffer
->lock
);
4032 raw_spin_unlock_irqrestore(&cpu_buffer
->reader_lock
, flags
);
4034 EXPORT_SYMBOL_GPL(ring_buffer_read_start
);
4037 * ring_buffer_finish - finish reading the iterator of the buffer
4038 * @iter: The iterator retrieved by ring_buffer_start
4040 * This re-enables the recording to the buffer, and frees the
4044 ring_buffer_read_finish(struct ring_buffer_iter
*iter
)
4046 struct ring_buffer_per_cpu
*cpu_buffer
= iter
->cpu_buffer
;
4047 unsigned long flags
;
4050 * Ring buffer is disabled from recording, here's a good place
4051 * to check the integrity of the ring buffer.
4052 * Must prevent readers from trying to read, as the check
4053 * clears the HEAD page and readers require it.
4055 raw_spin_lock_irqsave(&cpu_buffer
->reader_lock
, flags
);
4056 rb_check_pages(cpu_buffer
);
4057 raw_spin_unlock_irqrestore(&cpu_buffer
->reader_lock
, flags
);
4059 atomic_dec(&cpu_buffer
->record_disabled
);
4060 atomic_dec(&cpu_buffer
->buffer
->resize_disabled
);
4063 EXPORT_SYMBOL_GPL(ring_buffer_read_finish
);
4066 * ring_buffer_read - read the next item in the ring buffer by the iterator
4067 * @iter: The ring buffer iterator
4068 * @ts: The time stamp of the event read.
4070 * This reads the next event in the ring buffer and increments the iterator.
4072 struct ring_buffer_event
*
4073 ring_buffer_read(struct ring_buffer_iter
*iter
, u64
*ts
)
4075 struct ring_buffer_event
*event
;
4076 struct ring_buffer_per_cpu
*cpu_buffer
= iter
->cpu_buffer
;
4077 unsigned long flags
;
4079 raw_spin_lock_irqsave(&cpu_buffer
->reader_lock
, flags
);
4081 event
= rb_iter_peek(iter
, ts
);
4085 if (event
->type_len
== RINGBUF_TYPE_PADDING
)
4088 rb_advance_iter(iter
);
4090 raw_spin_unlock_irqrestore(&cpu_buffer
->reader_lock
, flags
);
4094 EXPORT_SYMBOL_GPL(ring_buffer_read
);
4097 * ring_buffer_size - return the size of the ring buffer (in bytes)
4098 * @buffer: The ring buffer.
4100 unsigned long ring_buffer_size(struct ring_buffer
*buffer
, int cpu
)
4103 * Earlier, this method returned
4104 * BUF_PAGE_SIZE * buffer->nr_pages
4105 * Since the nr_pages field is now removed, we have converted this to
4106 * return the per cpu buffer value.
4108 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
4111 return BUF_PAGE_SIZE
* buffer
->buffers
[cpu
]->nr_pages
;
4113 EXPORT_SYMBOL_GPL(ring_buffer_size
);
4116 rb_reset_cpu(struct ring_buffer_per_cpu
*cpu_buffer
)
4118 rb_head_page_deactivate(cpu_buffer
);
4120 cpu_buffer
->head_page
4121 = list_entry(cpu_buffer
->pages
, struct buffer_page
, list
);
4122 local_set(&cpu_buffer
->head_page
->write
, 0);
4123 local_set(&cpu_buffer
->head_page
->entries
, 0);
4124 local_set(&cpu_buffer
->head_page
->page
->commit
, 0);
4126 cpu_buffer
->head_page
->read
= 0;
4128 cpu_buffer
->tail_page
= cpu_buffer
->head_page
;
4129 cpu_buffer
->commit_page
= cpu_buffer
->head_page
;
4131 INIT_LIST_HEAD(&cpu_buffer
->reader_page
->list
);
4132 INIT_LIST_HEAD(&cpu_buffer
->new_pages
);
4133 local_set(&cpu_buffer
->reader_page
->write
, 0);
4134 local_set(&cpu_buffer
->reader_page
->entries
, 0);
4135 local_set(&cpu_buffer
->reader_page
->page
->commit
, 0);
4136 cpu_buffer
->reader_page
->read
= 0;
4138 local_set(&cpu_buffer
->entries_bytes
, 0);
4139 local_set(&cpu_buffer
->overrun
, 0);
4140 local_set(&cpu_buffer
->commit_overrun
, 0);
4141 local_set(&cpu_buffer
->dropped_events
, 0);
4142 local_set(&cpu_buffer
->entries
, 0);
4143 local_set(&cpu_buffer
->committing
, 0);
4144 local_set(&cpu_buffer
->commits
, 0);
4145 cpu_buffer
->read
= 0;
4146 cpu_buffer
->read_bytes
= 0;
4148 cpu_buffer
->write_stamp
= 0;
4149 cpu_buffer
->read_stamp
= 0;
4151 cpu_buffer
->lost_events
= 0;
4152 cpu_buffer
->last_overrun
= 0;
4154 rb_head_page_activate(cpu_buffer
);
4158 * ring_buffer_reset_cpu - reset a ring buffer per CPU buffer
4159 * @buffer: The ring buffer to reset a per cpu buffer of
4160 * @cpu: The CPU buffer to be reset
4162 void ring_buffer_reset_cpu(struct ring_buffer
*buffer
, int cpu
)
4164 struct ring_buffer_per_cpu
*cpu_buffer
= buffer
->buffers
[cpu
];
4165 unsigned long flags
;
4167 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
4170 atomic_inc(&buffer
->resize_disabled
);
4171 atomic_inc(&cpu_buffer
->record_disabled
);
4173 /* Make sure all commits have finished */
4174 synchronize_sched();
4176 raw_spin_lock_irqsave(&cpu_buffer
->reader_lock
, flags
);
4178 if (RB_WARN_ON(cpu_buffer
, local_read(&cpu_buffer
->committing
)))
4181 arch_spin_lock(&cpu_buffer
->lock
);
4183 rb_reset_cpu(cpu_buffer
);
4185 arch_spin_unlock(&cpu_buffer
->lock
);
4188 raw_spin_unlock_irqrestore(&cpu_buffer
->reader_lock
, flags
);
4190 atomic_dec(&cpu_buffer
->record_disabled
);
4191 atomic_dec(&buffer
->resize_disabled
);
4193 EXPORT_SYMBOL_GPL(ring_buffer_reset_cpu
);
4196 * ring_buffer_reset - reset a ring buffer
4197 * @buffer: The ring buffer to reset all cpu buffers
4199 void ring_buffer_reset(struct ring_buffer
*buffer
)
4203 for_each_buffer_cpu(buffer
, cpu
)
4204 ring_buffer_reset_cpu(buffer
, cpu
);
4206 EXPORT_SYMBOL_GPL(ring_buffer_reset
);
4209 * rind_buffer_empty - is the ring buffer empty?
4210 * @buffer: The ring buffer to test
4212 int ring_buffer_empty(struct ring_buffer
*buffer
)
4214 struct ring_buffer_per_cpu
*cpu_buffer
;
4215 unsigned long flags
;
4220 dolock
= rb_ok_to_lock();
4222 /* yes this is racy, but if you don't like the race, lock the buffer */
4223 for_each_buffer_cpu(buffer
, cpu
) {
4224 cpu_buffer
= buffer
->buffers
[cpu
];
4225 local_irq_save(flags
);
4227 raw_spin_lock(&cpu_buffer
->reader_lock
);
4228 ret
= rb_per_cpu_empty(cpu_buffer
);
4230 raw_spin_unlock(&cpu_buffer
->reader_lock
);
4231 local_irq_restore(flags
);
4239 EXPORT_SYMBOL_GPL(ring_buffer_empty
);
4242 * ring_buffer_empty_cpu - is a cpu buffer of a ring buffer empty?
4243 * @buffer: The ring buffer
4244 * @cpu: The CPU buffer to test
4246 int ring_buffer_empty_cpu(struct ring_buffer
*buffer
, int cpu
)
4248 struct ring_buffer_per_cpu
*cpu_buffer
;
4249 unsigned long flags
;
4253 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
4256 dolock
= rb_ok_to_lock();
4258 cpu_buffer
= buffer
->buffers
[cpu
];
4259 local_irq_save(flags
);
4261 raw_spin_lock(&cpu_buffer
->reader_lock
);
4262 ret
= rb_per_cpu_empty(cpu_buffer
);
4264 raw_spin_unlock(&cpu_buffer
->reader_lock
);
4265 local_irq_restore(flags
);
4269 EXPORT_SYMBOL_GPL(ring_buffer_empty_cpu
);
4271 #ifdef CONFIG_RING_BUFFER_ALLOW_SWAP
4273 * ring_buffer_swap_cpu - swap a CPU buffer between two ring buffers
4274 * @buffer_a: One buffer to swap with
4275 * @buffer_b: The other buffer to swap with
4277 * This function is useful for tracers that want to take a "snapshot"
4278 * of a CPU buffer and has another back up buffer lying around.
4279 * it is expected that the tracer handles the cpu buffer not being
4280 * used at the moment.
4282 int ring_buffer_swap_cpu(struct ring_buffer
*buffer_a
,
4283 struct ring_buffer
*buffer_b
, int cpu
)
4285 struct ring_buffer_per_cpu
*cpu_buffer_a
;
4286 struct ring_buffer_per_cpu
*cpu_buffer_b
;
4289 if (!cpumask_test_cpu(cpu
, buffer_a
->cpumask
) ||
4290 !cpumask_test_cpu(cpu
, buffer_b
->cpumask
))
4293 cpu_buffer_a
= buffer_a
->buffers
[cpu
];
4294 cpu_buffer_b
= buffer_b
->buffers
[cpu
];
4296 /* At least make sure the two buffers are somewhat the same */
4297 if (cpu_buffer_a
->nr_pages
!= cpu_buffer_b
->nr_pages
)
4302 if (ring_buffer_flags
!= RB_BUFFERS_ON
)
4305 if (atomic_read(&buffer_a
->record_disabled
))
4308 if (atomic_read(&buffer_b
->record_disabled
))
4311 if (atomic_read(&cpu_buffer_a
->record_disabled
))
4314 if (atomic_read(&cpu_buffer_b
->record_disabled
))
4318 * We can't do a synchronize_sched here because this
4319 * function can be called in atomic context.
4320 * Normally this will be called from the same CPU as cpu.
4321 * If not it's up to the caller to protect this.
4323 atomic_inc(&cpu_buffer_a
->record_disabled
);
4324 atomic_inc(&cpu_buffer_b
->record_disabled
);
4327 if (local_read(&cpu_buffer_a
->committing
))
4329 if (local_read(&cpu_buffer_b
->committing
))
4332 buffer_a
->buffers
[cpu
] = cpu_buffer_b
;
4333 buffer_b
->buffers
[cpu
] = cpu_buffer_a
;
4335 cpu_buffer_b
->buffer
= buffer_a
;
4336 cpu_buffer_a
->buffer
= buffer_b
;
4341 atomic_dec(&cpu_buffer_a
->record_disabled
);
4342 atomic_dec(&cpu_buffer_b
->record_disabled
);
4346 EXPORT_SYMBOL_GPL(ring_buffer_swap_cpu
);
4347 #endif /* CONFIG_RING_BUFFER_ALLOW_SWAP */
4350 * ring_buffer_alloc_read_page - allocate a page to read from buffer
4351 * @buffer: the buffer to allocate for.
4353 * This function is used in conjunction with ring_buffer_read_page.
4354 * When reading a full page from the ring buffer, these functions
4355 * can be used to speed up the process. The calling function should
4356 * allocate a few pages first with this function. Then when it
4357 * needs to get pages from the ring buffer, it passes the result
4358 * of this function into ring_buffer_read_page, which will swap
4359 * the page that was allocated, with the read page of the buffer.
4362 * The page allocated, or NULL on error.
4364 void *ring_buffer_alloc_read_page(struct ring_buffer
*buffer
, int cpu
)
4366 struct buffer_data_page
*bpage
;
4369 page
= alloc_pages_node(cpu_to_node(cpu
),
4370 GFP_KERNEL
| __GFP_NORETRY
, 0);
4374 bpage
= page_address(page
);
4376 rb_init_page(bpage
);
4380 EXPORT_SYMBOL_GPL(ring_buffer_alloc_read_page
);
4383 * ring_buffer_free_read_page - free an allocated read page
4384 * @buffer: the buffer the page was allocate for
4385 * @data: the page to free
4387 * Free a page allocated from ring_buffer_alloc_read_page.
4389 void ring_buffer_free_read_page(struct ring_buffer
*buffer
, void *data
)
4391 free_page((unsigned long)data
);
4393 EXPORT_SYMBOL_GPL(ring_buffer_free_read_page
);
4396 * ring_buffer_read_page - extract a page from the ring buffer
4397 * @buffer: buffer to extract from
4398 * @data_page: the page to use allocated from ring_buffer_alloc_read_page
4399 * @len: amount to extract
4400 * @cpu: the cpu of the buffer to extract
4401 * @full: should the extraction only happen when the page is full.
4403 * This function will pull out a page from the ring buffer and consume it.
4404 * @data_page must be the address of the variable that was returned
4405 * from ring_buffer_alloc_read_page. This is because the page might be used
4406 * to swap with a page in the ring buffer.
4409 * rpage = ring_buffer_alloc_read_page(buffer);
4412 * ret = ring_buffer_read_page(buffer, &rpage, len, cpu, 0);
4414 * process_page(rpage, ret);
4416 * When @full is set, the function will not return true unless
4417 * the writer is off the reader page.
4419 * Note: it is up to the calling functions to handle sleeps and wakeups.
4420 * The ring buffer can be used anywhere in the kernel and can not
4421 * blindly call wake_up. The layer that uses the ring buffer must be
4422 * responsible for that.
4425 * >=0 if data has been transferred, returns the offset of consumed data.
4426 * <0 if no data has been transferred.
4428 int ring_buffer_read_page(struct ring_buffer
*buffer
,
4429 void **data_page
, size_t len
, int cpu
, int full
)
4431 struct ring_buffer_per_cpu
*cpu_buffer
= buffer
->buffers
[cpu
];
4432 struct ring_buffer_event
*event
;
4433 struct buffer_data_page
*bpage
;
4434 struct buffer_page
*reader
;
4435 unsigned long missed_events
;
4436 unsigned long flags
;
4437 unsigned int commit
;
4442 if (!cpumask_test_cpu(cpu
, buffer
->cpumask
))
4446 * If len is not big enough to hold the page header, then
4447 * we can not copy anything.
4449 if (len
<= BUF_PAGE_HDR_SIZE
)
4452 len
-= BUF_PAGE_HDR_SIZE
;
4461 raw_spin_lock_irqsave(&cpu_buffer
->reader_lock
, flags
);
4463 reader
= rb_get_reader_page(cpu_buffer
);
4467 event
= rb_reader_event(cpu_buffer
);
4469 read
= reader
->read
;
4470 commit
= rb_page_commit(reader
);
4472 /* Check if any events were dropped */
4473 missed_events
= cpu_buffer
->lost_events
;
4476 * If this page has been partially read or
4477 * if len is not big enough to read the rest of the page or
4478 * a writer is still on the page, then
4479 * we must copy the data from the page to the buffer.
4480 * Otherwise, we can simply swap the page with the one passed in.
4482 if (read
|| (len
< (commit
- read
)) ||
4483 cpu_buffer
->reader_page
== cpu_buffer
->commit_page
) {
4484 struct buffer_data_page
*rpage
= cpu_buffer
->reader_page
->page
;
4485 unsigned int rpos
= read
;
4486 unsigned int pos
= 0;
4492 if (len
> (commit
- read
))
4493 len
= (commit
- read
);
4495 /* Always keep the time extend and data together */
4496 size
= rb_event_ts_length(event
);
4501 /* save the current timestamp, since the user will need it */
4502 save_timestamp
= cpu_buffer
->read_stamp
;
4504 /* Need to copy one event at a time */
4506 /* We need the size of one event, because
4507 * rb_advance_reader only advances by one event,
4508 * whereas rb_event_ts_length may include the size of
4509 * one or two events.
4510 * We have already ensured there's enough space if this
4511 * is a time extend. */
4512 size
= rb_event_length(event
);
4513 memcpy(bpage
->data
+ pos
, rpage
->data
+ rpos
, size
);
4517 rb_advance_reader(cpu_buffer
);
4518 rpos
= reader
->read
;
4524 event
= rb_reader_event(cpu_buffer
);
4525 /* Always keep the time extend and data together */
4526 size
= rb_event_ts_length(event
);
4527 } while (len
>= size
);
4530 local_set(&bpage
->commit
, pos
);
4531 bpage
->time_stamp
= save_timestamp
;
4533 /* we copied everything to the beginning */
4536 /* update the entry counter */
4537 cpu_buffer
->read
+= rb_page_entries(reader
);
4538 cpu_buffer
->read_bytes
+= BUF_PAGE_SIZE
;
4540 /* swap the pages */
4541 rb_init_page(bpage
);
4542 bpage
= reader
->page
;
4543 reader
->page
= *data_page
;
4544 local_set(&reader
->write
, 0);
4545 local_set(&reader
->entries
, 0);
4550 * Use the real_end for the data size,
4551 * This gives us a chance to store the lost events
4554 if (reader
->real_end
)
4555 local_set(&bpage
->commit
, reader
->real_end
);
4559 cpu_buffer
->lost_events
= 0;
4561 commit
= local_read(&bpage
->commit
);
4563 * Set a flag in the commit field if we lost events
4565 if (missed_events
) {
4566 /* If there is room at the end of the page to save the
4567 * missed events, then record it there.
4569 if (BUF_PAGE_SIZE
- commit
>= sizeof(missed_events
)) {
4570 memcpy(&bpage
->data
[commit
], &missed_events
,
4571 sizeof(missed_events
));
4572 local_add(RB_MISSED_STORED
, &bpage
->commit
);
4573 commit
+= sizeof(missed_events
);
4575 local_add(RB_MISSED_EVENTS
, &bpage
->commit
);
4579 * This page may be off to user land. Zero it out here.
4581 if (commit
< BUF_PAGE_SIZE
)
4582 memset(&bpage
->data
[commit
], 0, BUF_PAGE_SIZE
- commit
);
4585 raw_spin_unlock_irqrestore(&cpu_buffer
->reader_lock
, flags
);
4590 EXPORT_SYMBOL_GPL(ring_buffer_read_page
);
4592 #ifdef CONFIG_HOTPLUG_CPU
4593 static int rb_cpu_notify(struct notifier_block
*self
,
4594 unsigned long action
, void *hcpu
)
4596 struct ring_buffer
*buffer
=
4597 container_of(self
, struct ring_buffer
, cpu_notify
);
4598 long cpu
= (long)hcpu
;
4599 int cpu_i
, nr_pages_same
;
4600 unsigned int nr_pages
;
4603 case CPU_UP_PREPARE
:
4604 case CPU_UP_PREPARE_FROZEN
:
4605 if (cpumask_test_cpu(cpu
, buffer
->cpumask
))
4610 /* check if all cpu sizes are same */
4611 for_each_buffer_cpu(buffer
, cpu_i
) {
4612 /* fill in the size from first enabled cpu */
4614 nr_pages
= buffer
->buffers
[cpu_i
]->nr_pages
;
4615 if (nr_pages
!= buffer
->buffers
[cpu_i
]->nr_pages
) {
4620 /* allocate minimum pages, user can later expand it */
4623 buffer
->buffers
[cpu
] =
4624 rb_allocate_cpu_buffer(buffer
, nr_pages
, cpu
);
4625 if (!buffer
->buffers
[cpu
]) {
4626 WARN(1, "failed to allocate ring buffer on CPU %ld\n",
4631 cpumask_set_cpu(cpu
, buffer
->cpumask
);
4633 case CPU_DOWN_PREPARE
:
4634 case CPU_DOWN_PREPARE_FROZEN
:
4637 * If we were to free the buffer, then the user would
4638 * lose any trace that was in the buffer.
4648 #ifdef CONFIG_RING_BUFFER_STARTUP_TEST
4650 * This is a basic integrity check of the ring buffer.
4651 * Late in the boot cycle this test will run when configured in.
4652 * It will kick off a thread per CPU that will go into a loop
4653 * writing to the per cpu ring buffer various sizes of data.
4654 * Some of the data will be large items, some small.
4656 * Another thread is created that goes into a spin, sending out
4657 * IPIs to the other CPUs to also write into the ring buffer.
4658 * this is to test the nesting ability of the buffer.
4660 * Basic stats are recorded and reported. If something in the
4661 * ring buffer should happen that's not expected, a big warning
4662 * is displayed and all ring buffers are disabled.
4664 static struct task_struct
*rb_threads
[NR_CPUS
] __initdata
;
4666 struct rb_test_data
{
4667 struct ring_buffer
*buffer
;
4668 unsigned long events
;
4669 unsigned long bytes_written
;
4670 unsigned long bytes_alloc
;
4671 unsigned long bytes_dropped
;
4672 unsigned long events_nested
;
4673 unsigned long bytes_written_nested
;
4674 unsigned long bytes_alloc_nested
;
4675 unsigned long bytes_dropped_nested
;
4676 int min_size_nested
;
4677 int max_size_nested
;
4684 static struct rb_test_data rb_data
[NR_CPUS
] __initdata
;
4687 #define RB_TEST_BUFFER_SIZE 1048576
4689 static char rb_string
[] __initdata
=
4690 "abcdefghijklmnopqrstuvwxyz1234567890!@#$%^&*()?+\\"
4691 "?+|:';\",.<>/?abcdefghijklmnopqrstuvwxyz1234567890"
4692 "!@#$%^&*()?+\\?+|:';\",.<>/?abcdefghijklmnopqrstuv";
4694 static bool rb_test_started __initdata
;
4701 static __init
int rb_write_something(struct rb_test_data
*data
, bool nested
)
4703 struct ring_buffer_event
*event
;
4704 struct rb_item
*item
;
4711 /* Have nested writes different that what is written */
4712 cnt
= data
->cnt
+ (nested
? 27 : 0);
4714 /* Multiply cnt by ~e, to make some unique increment */
4715 size
= (data
->cnt
* 68 / 25) % (sizeof(rb_string
) - 1);
4717 len
= size
+ sizeof(struct rb_item
);
4719 started
= rb_test_started
;
4720 /* read rb_test_started before checking buffer enabled */
4723 event
= ring_buffer_lock_reserve(data
->buffer
, len
);
4725 /* Ignore dropped events before test starts. */
4728 data
->bytes_dropped
+= len
;
4730 data
->bytes_dropped_nested
+= len
;
4735 event_len
= ring_buffer_event_length(event
);
4737 if (RB_WARN_ON(data
->buffer
, event_len
< len
))
4740 item
= ring_buffer_event_data(event
);
4742 memcpy(item
->str
, rb_string
, size
);
4745 data
->bytes_alloc_nested
+= event_len
;
4746 data
->bytes_written_nested
+= len
;
4747 data
->events_nested
++;
4748 if (!data
->min_size_nested
|| len
< data
->min_size_nested
)
4749 data
->min_size_nested
= len
;
4750 if (len
> data
->max_size_nested
)
4751 data
->max_size_nested
= len
;
4753 data
->bytes_alloc
+= event_len
;
4754 data
->bytes_written
+= len
;
4756 if (!data
->min_size
|| len
< data
->min_size
)
4757 data
->max_size
= len
;
4758 if (len
> data
->max_size
)
4759 data
->max_size
= len
;
4763 ring_buffer_unlock_commit(data
->buffer
, event
);
4768 static __init
int rb_test(void *arg
)
4770 struct rb_test_data
*data
= arg
;
4772 while (!kthread_should_stop()) {
4773 rb_write_something(data
, false);
4776 set_current_state(TASK_INTERRUPTIBLE
);
4777 /* Now sleep between a min of 100-300us and a max of 1ms */
4778 usleep_range(((data
->cnt
% 3) + 1) * 100, 1000);
4784 static __init
void rb_ipi(void *ignore
)
4786 struct rb_test_data
*data
;
4787 int cpu
= smp_processor_id();
4789 data
= &rb_data
[cpu
];
4790 rb_write_something(data
, true);
4793 static __init
int rb_hammer_test(void *arg
)
4795 while (!kthread_should_stop()) {
4797 /* Send an IPI to all cpus to write data! */
4798 smp_call_function(rb_ipi
, NULL
, 1);
4799 /* No sleep, but for non preempt, let others run */
4806 static __init
int test_ringbuffer(void)
4808 struct task_struct
*rb_hammer
;
4809 struct ring_buffer
*buffer
;
4813 pr_info("Running ring buffer tests...\n");
4815 buffer
= ring_buffer_alloc(RB_TEST_BUFFER_SIZE
, RB_FL_OVERWRITE
);
4816 if (WARN_ON(!buffer
))
4819 /* Disable buffer so that threads can't write to it yet */
4820 ring_buffer_record_off(buffer
);
4822 for_each_online_cpu(cpu
) {
4823 rb_data
[cpu
].buffer
= buffer
;
4824 rb_data
[cpu
].cpu
= cpu
;
4825 rb_data
[cpu
].cnt
= cpu
;
4826 rb_threads
[cpu
] = kthread_create(rb_test
, &rb_data
[cpu
],
4827 "rbtester/%d", cpu
);
4828 if (WARN_ON(!rb_threads
[cpu
])) {
4829 pr_cont("FAILED\n");
4834 kthread_bind(rb_threads
[cpu
], cpu
);
4835 wake_up_process(rb_threads
[cpu
]);
4838 /* Now create the rb hammer! */
4839 rb_hammer
= kthread_run(rb_hammer_test
, NULL
, "rbhammer");
4840 if (WARN_ON(!rb_hammer
)) {
4841 pr_cont("FAILED\n");
4846 ring_buffer_record_on(buffer
);
4848 * Show buffer is enabled before setting rb_test_started.
4849 * Yes there's a small race window where events could be
4850 * dropped and the thread wont catch it. But when a ring
4851 * buffer gets enabled, there will always be some kind of
4852 * delay before other CPUs see it. Thus, we don't care about
4853 * those dropped events. We care about events dropped after
4854 * the threads see that the buffer is active.
4857 rb_test_started
= true;
4859 set_current_state(TASK_INTERRUPTIBLE
);
4860 /* Just run for 10 seconds */;
4861 schedule_timeout(10 * HZ
);
4863 kthread_stop(rb_hammer
);
4866 for_each_online_cpu(cpu
) {
4867 if (!rb_threads
[cpu
])
4869 kthread_stop(rb_threads
[cpu
]);
4872 ring_buffer_free(buffer
);
4877 pr_info("finished\n");
4878 for_each_online_cpu(cpu
) {
4879 struct ring_buffer_event
*event
;
4880 struct rb_test_data
*data
= &rb_data
[cpu
];
4881 struct rb_item
*item
;
4882 unsigned long total_events
;
4883 unsigned long total_dropped
;
4884 unsigned long total_written
;
4885 unsigned long total_alloc
;
4886 unsigned long total_read
= 0;
4887 unsigned long total_size
= 0;
4888 unsigned long total_len
= 0;
4889 unsigned long total_lost
= 0;
4892 int small_event_size
;
4896 total_events
= data
->events
+ data
->events_nested
;
4897 total_written
= data
->bytes_written
+ data
->bytes_written_nested
;
4898 total_alloc
= data
->bytes_alloc
+ data
->bytes_alloc_nested
;
4899 total_dropped
= data
->bytes_dropped
+ data
->bytes_dropped_nested
;
4901 big_event_size
= data
->max_size
+ data
->max_size_nested
;
4902 small_event_size
= data
->min_size
+ data
->min_size_nested
;
4904 pr_info("CPU %d:\n", cpu
);
4905 pr_info(" events: %ld\n", total_events
);
4906 pr_info(" dropped bytes: %ld\n", total_dropped
);
4907 pr_info(" alloced bytes: %ld\n", total_alloc
);
4908 pr_info(" written bytes: %ld\n", total_written
);
4909 pr_info(" biggest event: %d\n", big_event_size
);
4910 pr_info(" smallest event: %d\n", small_event_size
);
4912 if (RB_WARN_ON(buffer
, total_dropped
))
4917 while ((event
= ring_buffer_consume(buffer
, cpu
, NULL
, &lost
))) {
4919 item
= ring_buffer_event_data(event
);
4920 total_len
+= ring_buffer_event_length(event
);
4921 total_size
+= item
->size
+ sizeof(struct rb_item
);
4922 if (memcmp(&item
->str
[0], rb_string
, item
->size
) != 0) {
4923 pr_info("FAILED!\n");
4924 pr_info("buffer had: %.*s\n", item
->size
, item
->str
);
4925 pr_info("expected: %.*s\n", item
->size
, rb_string
);
4926 RB_WARN_ON(buffer
, 1);
4937 pr_info(" read events: %ld\n", total_read
);
4938 pr_info(" lost events: %ld\n", total_lost
);
4939 pr_info(" total events: %ld\n", total_lost
+ total_read
);
4940 pr_info(" recorded len bytes: %ld\n", total_len
);
4941 pr_info(" recorded size bytes: %ld\n", total_size
);
4943 pr_info(" With dropped events, record len and size may not match\n"
4944 " alloced and written from above\n");
4946 if (RB_WARN_ON(buffer
, total_len
!= total_alloc
||
4947 total_size
!= total_written
))
4950 if (RB_WARN_ON(buffer
, total_lost
+ total_read
!= total_events
))
4956 pr_info("Ring buffer PASSED!\n");
4958 ring_buffer_free(buffer
);
4962 late_initcall(test_ringbuffer
);
4963 #endif /* CONFIG_RING_BUFFER_STARTUP_TEST */