3 * LTTng userspace tracer buffering system
5 * Copyright (C) 2009 - Pierre-Marc Fournier (pierre-marc dot fournier at polymtl dot ca)
6 * Copyright (C) 2008 - Mathieu Desnoyers (mathieu.desnoyers@polymtl.ca)
8 * This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2.1 of the License, or (at your option) any later version.
13 * This library is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with this library; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
23 #ifndef _UST_BUFFERS_H
24 #define _UST_BUFFERS_H
32 #include "tracerconst.h"
33 #include "tracercore.h"
34 #include "header-inline.h"
36 /***** FIXME: SHOULD BE REMOVED ***** */
39 * BUFFER_TRUNC zeroes the subbuffer offset and the subbuffer number parts of
40 * the offset, which leaves only the buffer number.
42 #define BUFFER_TRUNC(offset, chan) \
43 ((offset) & (~((chan)->alloc_size-1)))
44 #define BUFFER_OFFSET(offset, chan) ((offset) & ((chan)->alloc_size - 1))
45 #define SUBBUF_OFFSET(offset, chan) ((offset) & ((chan)->subbuf_size - 1))
46 #define SUBBUF_ALIGN(offset, chan) \
47 (((offset) + (chan)->subbuf_size) & (~((chan)->subbuf_size - 1)))
48 #define SUBBUF_TRUNC(offset, chan) \
49 ((offset) & (~((chan)->subbuf_size - 1)))
50 #define SUBBUF_INDEX(offset, chan) \
51 (BUFFER_OFFSET((offset), chan) >> (chan)->subbuf_size_order)
54 * Tracks changes to rchan/rchan_buf structs
56 #define UST_CHANNEL_VERSION 8
58 /**************************************/
60 struct commit_counters
{
62 long cc_sb
; /* ATOMIC - Incremented _once_ at sb switch */
66 /* First 32 bytes cache-hot cacheline */
67 long offset
; /* Current offset in the buffer *atomic* */
68 struct commit_counters
*commit_count
; /* Commit count per sub-buffer */
69 long consumed
; /* Current offset in the buffer *atomic* access (shared) */
70 unsigned long last_tsc
; /*
71 * Last timestamp written in the buffer.
73 /* End of first 32 bytes cacheline */
74 long active_readers
; /* ATOMIC - Active readers count standard atomic access (shared) */
75 long events_lost
; /* ATOMIC */
76 long corrupted_subbuffers
; /* *ATOMIC* */
77 /* one byte is written to this pipe when data is available, in order
78 to wake the consumer */
79 /* portability: Single byte writes must be as quick as possible. The kernel-side
80 buffer must be large enough so the writer doesn't block. From the pipe(7)
81 man page: Since linux 2.6.11, the pipe capacity is 65536 bytes. */
82 int data_ready_fd_write
;
83 /* the reading end of the pipe */
84 int data_ready_fd_read
;
86 * List of buffers with an open pipe, used for fork and forced subbuffer
89 struct list_head open_buffers_list
;
91 unsigned int finalized
;
92 //ust// struct timer_list switch_timer; /* timer for periodical switch */
93 unsigned long switch_timer_interval
; /* 0 = unset */
95 struct ust_channel
*chan
;
103 /* commit count per subbuffer; must be at end of struct */
104 long commit_seq
[0]; /* ATOMIC */
105 } ____cacheline_aligned
;
108 * A switch is done during tracing or as a final flush after tracing (so it
109 * won't write in the new sub-buffer).
110 * FIXME: make this message clearer
112 enum force_switch_mode
{ FORCE_ACTIVE
, FORCE_FLUSH
};
114 extern int ltt_reserve_slot_lockless_slow(struct ust_channel
*chan
,
115 struct ust_trace
*trace
, size_t data_size
,
116 int largest_align
, int cpu
,
117 struct ust_buffer
**ret_buf
,
118 size_t *slot_size
, long *buf_offset
,
119 u64
*tsc
, unsigned int *rflags
);
121 extern void ltt_force_switch_lockless_slow(struct ust_buffer
*buf
,
122 enum force_switch_mode mode
);
125 static __inline__
void ust_buffers_do_copy(void *dest
, const void *src
, size_t len
)
133 } u
= { .src
= src
};
137 case 1: *(u8
*)dest
= *u
.src8
;
139 case 2: *(u16
*)dest
= *u
.src16
;
141 case 4: *(u32
*)dest
= *u
.src32
;
143 case 8: *(u64
*)dest
= *u
.src64
;
146 memcpy(dest
, src
, len
);
150 static __inline__
void *ust_buffers_offset_address(struct ust_buffer
*buf
, size_t offset
)
152 return ((char *)buf
->buf_data
)+offset
;
156 * Last TSC comparison functions. Check if the current TSC overflows
157 * LTT_TSC_BITS bits from the last TSC read. Reads and writes last_tsc
161 /* FIXME: does this test work properly? */
162 #if (BITS_PER_LONG == 32)
163 static __inline__
void save_last_tsc(struct ust_buffer
*ltt_buf
,
166 ltt_buf
->last_tsc
= (unsigned long)(tsc
>> LTT_TSC_BITS
);
169 static __inline__
int last_tsc_overflow(struct ust_buffer
*ltt_buf
,
172 unsigned long tsc_shifted
= (unsigned long)(tsc
>> LTT_TSC_BITS
);
174 if (unlikely((tsc_shifted
- ltt_buf
->last_tsc
)))
180 static __inline__
void save_last_tsc(struct ust_buffer
*ltt_buf
,
183 ltt_buf
->last_tsc
= (unsigned long)tsc
;
186 static __inline__
int last_tsc_overflow(struct ust_buffer
*ltt_buf
,
189 if (unlikely((tsc
- ltt_buf
->last_tsc
) >> LTT_TSC_BITS
))
196 static __inline__
void ltt_reserve_push_reader(
197 struct ust_channel
*rchan
,
198 struct ust_buffer
*buf
,
201 long consumed_old
, consumed_new
;
204 consumed_old
= uatomic_read(&buf
->consumed
);
206 * If buffer is in overwrite mode, push the reader consumed
207 * count if the write position has reached it and we are not
208 * at the first iteration (don't push the reader farther than
209 * the writer). This operation can be done concurrently by many
210 * writers in the same buffer, the writer being at the farthest
211 * write position sub-buffer index in the buffer being the one
212 * which will win this loop.
213 * If the buffer is not in overwrite mode, pushing the reader
214 * only happens if a sub-buffer is corrupted.
216 if (unlikely((SUBBUF_TRUNC(offset
, buf
->chan
)
217 - SUBBUF_TRUNC(consumed_old
, buf
->chan
))
218 >= rchan
->alloc_size
))
219 consumed_new
= SUBBUF_ALIGN(consumed_old
, buf
->chan
);
222 } while (unlikely(uatomic_cmpxchg(&buf
->consumed
, consumed_old
,
223 consumed_new
) != consumed_old
));
226 static __inline__
void ltt_vmcore_check_deliver(
227 struct ust_buffer
*buf
,
228 long commit_count
, long idx
)
230 uatomic_set(&buf
->commit_seq
[idx
], commit_count
);
233 static __inline__
void ltt_check_deliver(struct ust_channel
*chan
,
234 struct ust_buffer
*buf
,
235 long offset
, long commit_count
, long idx
)
237 long old_commit_count
= commit_count
- chan
->subbuf_size
;
239 /* Check if all commits have been done */
240 if (unlikely((BUFFER_TRUNC(offset
, chan
)
241 >> chan
->n_subbufs_order
)
243 & chan
->commit_count_mask
) == 0)) {
245 * If we succeeded in updating the cc_sb, we are delivering
246 * the subbuffer. Deals with concurrent updates of the "cc"
247 * value without adding a add_return atomic operation to the
250 if (likely(uatomic_cmpxchg(&buf
->commit_count
[idx
].cc_sb
,
251 old_commit_count
, commit_count
)
252 == old_commit_count
)) {
256 * Set noref flag for this subbuffer.
258 //ust// ltt_set_noref_flag(rchan, buf, idx);
259 ltt_vmcore_check_deliver(buf
, commit_count
, idx
);
261 /* wakeup consumer */
262 result
= write(buf
->data_ready_fd_write
, "1", 1);
264 PERROR("write (in ltt_relay_buffer_flush)");
265 ERR("this should never happen!");
271 static __inline__
int ltt_poll_deliver(struct ust_channel
*chan
, struct ust_buffer
*buf
)
273 long consumed_old
, consumed_idx
, commit_count
, write_offset
;
275 consumed_old
= uatomic_read(&buf
->consumed
);
276 consumed_idx
= SUBBUF_INDEX(consumed_old
, buf
->chan
);
277 commit_count
= uatomic_read(&buf
->commit_count
[consumed_idx
].cc_sb
);
279 * No memory barrier here, since we are only interested
280 * in a statistically correct polling result. The next poll will
281 * get the data is we are racing. The mb() that ensures correct
282 * memory order is in get_subbuf.
284 write_offset
= uatomic_read(&buf
->offset
);
287 * Check that the subbuffer we are trying to consume has been
288 * already fully committed.
291 if (((commit_count
- chan
->subbuf_size
)
292 & chan
->commit_count_mask
)
293 - (BUFFER_TRUNC(consumed_old
, buf
->chan
)
294 >> chan
->n_subbufs_order
)
299 * Check that we are not about to read the same subbuffer in
300 * which the writer head is.
302 if ((SUBBUF_TRUNC(write_offset
, buf
->chan
)
303 - SUBBUF_TRUNC(consumed_old
, buf
->chan
))
312 * returns 0 if reserve ok, or 1 if the slow path must be taken.
314 static __inline__
int ltt_relay_try_reserve(
315 struct ust_channel
*chan
,
316 struct ust_buffer
*buf
,
318 u64
*tsc
, unsigned int *rflags
, int largest_align
,
319 long *o_begin
, long *o_end
, long *o_old
,
320 size_t *before_hdr_pad
, size_t *size
)
322 *o_begin
= uatomic_read(&buf
->offset
);
325 *tsc
= trace_clock_read64();
327 //ust// #ifdef CONFIG_LTT_VMCORE
328 //ust// prefetch(&buf->commit_count[SUBBUF_INDEX(*o_begin, rchan)]);
329 //ust// prefetch(&buf->commit_seq[SUBBUF_INDEX(*o_begin, rchan)]);
331 //ust// prefetchw(&buf->commit_count[SUBBUF_INDEX(*o_begin, rchan)]);
333 if (last_tsc_overflow(buf
, *tsc
))
334 *rflags
= LTT_RFLAG_ID_SIZE_TSC
;
336 if (unlikely(SUBBUF_OFFSET(*o_begin
, buf
->chan
) == 0))
339 *size
= ust_get_header_size(chan
,
341 before_hdr_pad
, *rflags
);
342 *size
+= ltt_align(*o_begin
+ *size
, largest_align
) + data_size
;
343 if (unlikely((SUBBUF_OFFSET(*o_begin
, buf
->chan
) + *size
)
344 > buf
->chan
->subbuf_size
))
348 * Event fits in the current buffer and we are not on a switch
349 * boundary. It's safe to write.
351 *o_end
= *o_begin
+ *size
;
353 if (unlikely((SUBBUF_OFFSET(*o_end
, buf
->chan
)) == 0))
355 * The offset_end will fall at the very beginning of the next
363 static __inline__
int ltt_reserve_slot(struct ust_channel
*chan
,
364 struct ust_trace
*trace
, size_t data_size
,
365 int largest_align
, int cpu
,
366 struct ust_buffer
**ret_buf
,
367 size_t *slot_size
, long *buf_offset
, u64
*tsc
,
368 unsigned int *rflags
)
370 struct ust_buffer
*buf
= *ret_buf
= chan
->buf
[cpu
];
371 long o_begin
, o_end
, o_old
;
372 size_t before_hdr_pad
;
375 * Perform retryable operations.
377 /* FIXME: make this really per cpu? */
378 if (unlikely(LOAD_SHARED(ltt_nesting
) > 4)) {
379 DBG("Dropping event because nesting is too deep.");
380 uatomic_inc(&buf
->events_lost
);
384 if (unlikely(ltt_relay_try_reserve(chan
, buf
,
385 data_size
, tsc
, rflags
,
386 largest_align
, &o_begin
, &o_end
, &o_old
,
387 &before_hdr_pad
, slot_size
)))
390 if (unlikely(uatomic_cmpxchg(&buf
->offset
, o_old
, o_end
) != o_old
))
394 * Atomically update last_tsc. This update races against concurrent
395 * atomic updates, but the race will always cause supplementary full TSC
396 * events, never the opposite (missing a full TSC event when it would be
399 save_last_tsc(buf
, *tsc
);
402 * Push the reader if necessary
404 ltt_reserve_push_reader(chan
, buf
, o_end
- 1);
407 * Clear noref flag for this subbuffer.
409 //ust// ltt_clear_noref_flag(chan, buf, SUBBUF_INDEX(o_end - 1, chan));
411 *buf_offset
= o_begin
+ before_hdr_pad
;
414 return ltt_reserve_slot_lockless_slow(chan
, trace
, data_size
,
415 largest_align
, cpu
, ret_buf
,
416 slot_size
, buf_offset
, tsc
,
421 * Force a sub-buffer switch for a per-cpu buffer. This operation is
422 * completely reentrant : can be called while tracing is active with
423 * absolutely no lock held.
425 static __inline__
void ltt_force_switch(struct ust_buffer
*buf
,
426 enum force_switch_mode mode
)
428 return ltt_force_switch_lockless_slow(buf
, mode
);
432 * for flight recording. must be called after relay_commit.
433 * This function increments the subbuffers's commit_seq counter each time the
434 * commit count reaches back the reserve offset (module subbuffer size). It is
435 * useful for crash dump.
437 //ust// #ifdef CONFIG_LTT_VMCORE
438 static __inline__
void ltt_write_commit_counter(struct ust_channel
*chan
,
439 struct ust_buffer
*buf
, long idx
, long buf_offset
,
440 long commit_count
, size_t data_size
)
445 offset
= buf_offset
+ data_size
;
448 * SUBBUF_OFFSET includes commit_count_mask. We can simply
449 * compare the offsets within the subbuffer without caring about
450 * buffer full/empty mismatch because offset is never zero here
451 * (subbuffer header and event headers have non-zero length).
453 if (unlikely(SUBBUF_OFFSET(offset
- commit_count
, buf
->chan
)))
456 commit_seq_old
= uatomic_read(&buf
->commit_seq
[idx
]);
457 while (commit_seq_old
< commit_count
)
458 commit_seq_old
= uatomic_cmpxchg(&buf
->commit_seq
[idx
],
459 commit_seq_old
, commit_count
);
461 DBG("commit_seq for channel %s_%d, subbuf %ld is now %ld", buf
->chan
->channel_name
, buf
->cpu
, idx
, commit_count
);
464 //ust// static __inline__ void ltt_write_commit_counter(struct ust_buffer *buf,
465 //ust// long idx, long buf_offset, long commit_count, size_t data_size)
471 * Atomic unordered slot commit. Increments the commit count in the
472 * specified sub-buffer, and delivers it if necessary.
476 * @ltt_channel : channel structure
477 * @transport_data: transport-specific data
478 * @buf_offset : offset following the event header.
479 * @data_size : size of the event data.
480 * @slot_size : size of the reserved slot.
482 static __inline__
void ltt_commit_slot(
483 struct ust_channel
*chan
,
484 struct ust_buffer
*buf
, long buf_offset
,
485 size_t data_size
, size_t slot_size
)
487 long offset_end
= buf_offset
;
488 long endidx
= SUBBUF_INDEX(offset_end
- 1, chan
);
493 uatomic_add(&buf
->commit_count
[endidx
].cc
, slot_size
);
495 * commit count read can race with concurrent OOO commit count updates.
496 * This is only needed for ltt_check_deliver (for non-polling delivery
497 * only) and for ltt_write_commit_counter. The race can only cause the
498 * counter to be read with the same value more than once, which could
500 * - Multiple delivery for the same sub-buffer (which is handled
501 * gracefully by the reader code) if the value is for a full
502 * sub-buffer. It's important that we can never miss a sub-buffer
503 * delivery. Re-reading the value after the uatomic_add ensures this.
504 * - Reading a commit_count with a higher value that what was actually
505 * added to it for the ltt_write_commit_counter call (again caused by
506 * a concurrent committer). It does not matter, because this function
507 * is interested in the fact that the commit count reaches back the
508 * reserve offset for a specific sub-buffer, which is completely
509 * independent of the order.
511 commit_count
= uatomic_read(&buf
->commit_count
[endidx
].cc
);
513 ltt_check_deliver(chan
, buf
, offset_end
- 1, commit_count
, endidx
);
515 * Update data_size for each commit. It's needed only for extracting
516 * ltt buffers from vmcore, after crash.
518 ltt_write_commit_counter(chan
, buf
, endidx
, buf_offset
, commit_count
, data_size
);
521 void _ust_buffers_strncpy_fixup(struct ust_buffer
*buf
, size_t offset
,
522 size_t len
, size_t copied
, int terminated
);
524 static __inline__
int ust_buffers_write(struct ust_buffer
*buf
, size_t offset
,
525 const void *src
, size_t len
)
527 size_t buf_offset
= BUFFER_OFFSET(offset
, buf
->chan
);
529 assert(buf_offset
< buf
->chan
->subbuf_size
*buf
->chan
->subbuf_cnt
);
530 assert(buf_offset
+ len
531 <= buf
->chan
->subbuf_size
*buf
->chan
->subbuf_cnt
);
533 ust_buffers_do_copy(buf
->buf_data
+ buf_offset
, src
, len
);
539 * ust_buffers_do_memset - write character into dest.
541 * @src: source character
542 * @len: length to write
545 void ust_buffers_do_memset(void *dest
, char src
, size_t len
)
548 * What we really want here is an __inline__ memset, but we
549 * don't have constants, so gcc generally uses a function call.
551 for (; len
> 0; len
--)
556 * ust_buffers_do_strncpy - copy a string up to a certain number of bytes
559 * @len: max. length to copy
560 * @terminated: output string ends with \0 (output)
562 * returns the number of bytes copied. Does not finalize with \0 if len is
566 size_t ust_buffers_do_strncpy(void *dest
, const void *src
, size_t len
,
569 size_t orig_len
= len
;
573 * What we really want here is an __inline__ strncpy, but we
574 * don't have constants, so gcc generally uses a function call.
576 for (; len
> 0; len
--) {
577 *(u8
*)dest
= LOAD_SHARED(*(const u8
*)src
);
578 /* Check with dest, because src may be modified concurrently */
579 if (*(const u8
*)dest
== '\0') {
587 return orig_len
- len
;
591 int ust_buffers_strncpy(struct ust_buffer
*buf
, size_t offset
, const void *src
,
594 size_t buf_offset
= BUFFER_OFFSET(offset
, buf
->chan
);
598 assert(buf_offset
< buf
->chan
->subbuf_size
*buf
->chan
->subbuf_cnt
);
599 assert(buf_offset
+ len
600 <= buf
->chan
->subbuf_size
*buf
->chan
->subbuf_cnt
);
602 copied
= ust_buffers_do_strncpy(buf
->buf_data
+ buf_offset
,
603 src
, len
, &terminated
);
604 if (unlikely(copied
< len
|| !terminated
))
605 _ust_buffers_strncpy_fixup(buf
, offset
, len
, copied
,
610 extern int ust_buffers_get_subbuf(struct ust_buffer
*buf
, long *consumed
);
611 extern int ust_buffers_put_subbuf(struct ust_buffer
*buf
, unsigned long uconsumed_old
);
613 extern void init_ustrelay_transport(void);
615 #endif /* _UST_BUFFERS_H */