| OLD | NEW |
| (Empty) | |
| 1 // Copyright 2016 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. |
| 4 |
| 5 syntax = "proto2"; |
| 6 option optimize_for = LITE_RUNTIME; |
| 7 |
| 8 package tracing.proto; |
| 9 |
| 10 message EventsChunk { |
| 11 // Chunks produced by the same trace writer have the same writer_id. This |
| 12 // allows to identify the next chunk for a writer (thread) in the ring buffer. |
| 13 optional uint32 writer_id = 1; |
| 14 |
| 15 // A monotonic counter within the writer, to establish sequencing of chunks. |
| 16 optional uint32 seq_id = 2; |
| 17 |
| 18 // Each event is a byte sequence that encapsulates the bytes for a single |
| 19 // Event (see event.proto) or an incomplete portion of it. |
| 20 // Why this isn't just a "repeated Events" field? An Event can spawn across |
| 21 // several chunks. In this case the reader has to first glue the byte |
| 22 // sequences together and then process the event. |
| 23 repeated bytes events = 3; |
| 24 |
| 25 // The first entry of |events| is incomplete and continues from the previous |
| 26 // chunk. |
| 27 optional bool first_event_continues_from_prev_chunk = 4; |
| 28 |
| 29 // The last entry of |events| is incomplete and contiues into the next chunk. |
| 30 optional bool last_event_continues_on_next_chunk = 5; |
| 31 } |
| OLD | NEW |