Commit | Line | Data |
---|---|---|
b1acd2b3 JD |
1 | #ifndef _BABELTRACE_CTF_TYPES_H |
2 | #define _BABELTRACE_CTF_TYPES_H | |
3 | ||
4 | /* | |
5 | * Common Trace Format | |
6 | * | |
7 | * Type header | |
8 | * | |
9 | * Copyright 2010 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com> | |
10 | * | |
11 | * Permission is hereby granted, free of charge, to any person obtaining a copy | |
12 | * of this software and associated documentation files (the "Software"), to deal | |
13 | * in the Software without restriction, including without limitation the rights | |
14 | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
15 | * copies of the Software, and to permit persons to whom the Software is | |
16 | * furnished to do so, subject to the following conditions: | |
17 | * | |
18 | * The above copyright notice and this permission notice shall be included in | |
19 | * all copies or substantial portions of the Software. | |
20 | * | |
21 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | |
22 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | |
23 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | |
24 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | |
25 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | |
26 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE | |
27 | * SOFTWARE. | |
28 | */ | |
29 | ||
30 | #include <babeltrace/types.h> | |
31 | #include <babeltrace/babeltrace-internal.h> | |
32 | #include <sys/types.h> | |
33 | #include <sys/stat.h> | |
34 | #include <fcntl.h> | |
35 | #include <errno.h> | |
36 | #include <stdint.h> | |
37 | #include <unistd.h> | |
38 | #include <glib.h> | |
39 | #include <stdio.h> | |
40 | #include <inttypes.h> | |
41 | #include <babeltrace/mmap-align.h> | |
42 | ||
43 | #define LAST_OFFSET_POISON ((int64_t) ~0ULL) | |
44 | ||
45 | struct bt_stream_callbacks; | |
46 | ||
47 | struct packet_index { | |
48 | off_t offset; /* offset of the packet in the file, in bytes */ | |
49 | int64_t data_offset; /* offset of data within the packet, in bits */ | |
50 | uint64_t packet_size; /* packet size, in bits */ | |
51 | uint64_t content_size; /* content size, in bits */ | |
52 | uint64_t timestamp_begin; | |
53 | uint64_t timestamp_end; | |
54 | uint64_t events_discarded; | |
55 | uint64_t events_discarded_len; /* length of the field, in bits */ | |
56 | }; | |
57 | ||
58 | /* | |
59 | * Always update ctf_stream_pos with ctf_move_pos and ctf_init_pos. | |
60 | */ | |
61 | struct ctf_stream_pos { | |
62 | struct bt_stream_pos parent; | |
63 | int fd; /* backing file fd. -1 if unset. */ | |
64 | int index_fd; /* backing index file fd. -1 if unset. */ | |
65 | GArray *packet_cycles_index; /* contains struct packet_index in cycles */ | |
66 | GArray *packet_real_index; /* contains struct packet_index in ns */ | |
67 | int prot; /* mmap protection */ | |
68 | int flags; /* mmap flags */ | |
69 | ||
70 | /* Current position */ | |
71 | off_t mmap_offset; /* mmap offset in the file, in bytes */ | |
72 | off_t mmap_base_offset; /* offset of start of packet in mmap, in bytes */ | |
73 | uint64_t packet_size; /* current packet size, in bits */ | |
74 | uint64_t content_size; /* current content size, in bits */ | |
75 | uint64_t *content_size_loc; /* pointer to current content size */ | |
76 | struct mmap_align *base_mma;/* mmap base address */ | |
77 | int64_t offset; /* offset from base, in bits. EOF for end of file. */ | |
78 | int64_t last_offset; /* offset before the last read_event */ | |
79 | uint64_t cur_index; /* current index in packet index */ | |
80 | uint64_t last_events_discarded; /* last known amount of event discarded */ | |
81 | void (*packet_seek)(struct bt_stream_pos *pos, size_t index, | |
82 | int whence); /* function called to switch packet */ | |
83 | ||
84 | int dummy; /* dummy position, for length calculation */ | |
85 | struct bt_stream_callbacks *cb; /* Callbacks registered for iterator. */ | |
86 | }; | |
87 | ||
88 | static inline | |
89 | struct ctf_stream_pos *ctf_pos(struct bt_stream_pos *pos) | |
90 | { | |
91 | return container_of(pos, struct ctf_stream_pos, parent); | |
92 | } | |
93 | ||
94 | BT_HIDDEN | |
95 | int ctf_integer_read(struct bt_stream_pos *pos, struct bt_definition *definition); | |
96 | BT_HIDDEN | |
97 | int ctf_integer_write(struct bt_stream_pos *pos, struct bt_definition *definition); | |
98 | BT_HIDDEN | |
99 | int ctf_float_read(struct bt_stream_pos *pos, struct bt_definition *definition); | |
100 | BT_HIDDEN | |
101 | int ctf_float_write(struct bt_stream_pos *pos, struct bt_definition *definition); | |
102 | BT_HIDDEN | |
103 | int ctf_string_read(struct bt_stream_pos *pos, struct bt_definition *definition); | |
104 | BT_HIDDEN | |
105 | int ctf_string_write(struct bt_stream_pos *pos, struct bt_definition *definition); | |
106 | BT_HIDDEN | |
107 | int ctf_enum_read(struct bt_stream_pos *pos, struct bt_definition *definition); | |
108 | BT_HIDDEN | |
109 | int ctf_enum_write(struct bt_stream_pos *pos, struct bt_definition *definition); | |
110 | BT_HIDDEN | |
111 | int ctf_struct_rw(struct bt_stream_pos *pos, struct bt_definition *definition); | |
112 | BT_HIDDEN | |
113 | int ctf_variant_rw(struct bt_stream_pos *pos, struct bt_definition *definition); | |
114 | BT_HIDDEN | |
115 | int ctf_array_read(struct bt_stream_pos *pos, struct bt_definition *definition); | |
116 | BT_HIDDEN | |
117 | int ctf_array_write(struct bt_stream_pos *pos, struct bt_definition *definition); | |
118 | BT_HIDDEN | |
119 | int ctf_sequence_read(struct bt_stream_pos *pos, struct bt_definition *definition); | |
120 | BT_HIDDEN | |
121 | int ctf_sequence_write(struct bt_stream_pos *pos, struct bt_definition *definition); | |
122 | ||
123 | void ctf_packet_seek(struct bt_stream_pos *pos, size_t index, int whence); | |
124 | ||
125 | int ctf_init_pos(struct ctf_stream_pos *pos, struct bt_trace_descriptor *trace, | |
126 | int fd, int open_flags); | |
127 | int ctf_fini_pos(struct ctf_stream_pos *pos); | |
128 | ||
129 | /* | |
130 | * move_pos - move position of a relative bit offset | |
131 | * | |
132 | * TODO: allow larger files by updating base too. | |
133 | */ | |
134 | static inline | |
135 | void ctf_move_pos(struct ctf_stream_pos *pos, uint64_t bit_offset) | |
136 | { | |
137 | printf_debug("ctf_move_pos test EOF: %" PRId64 "\n", pos->offset); | |
138 | if (unlikely(pos->offset == EOF)) | |
139 | return; | |
140 | ||
141 | if (pos->fd >= 0) { | |
142 | /* | |
143 | * PROT_READ ctf_packet_seek is called from within | |
144 | * ctf_pos_get_event so end of packet does not change | |
145 | * the packet context on for the last event of the | |
146 | * packet. | |
147 | */ | |
148 | if ((pos->prot == PROT_WRITE) | |
149 | && (unlikely(pos->offset + bit_offset >= pos->packet_size))) { | |
150 | printf_debug("ctf_packet_seek (before call): %" PRId64 "\n", | |
151 | pos->offset); | |
152 | ctf_packet_seek(&pos->parent, 0, SEEK_CUR); | |
153 | printf_debug("ctf_packet_seek (after call): %" PRId64 "\n", | |
154 | pos->offset); | |
155 | return; | |
156 | } | |
157 | } | |
158 | pos->offset += bit_offset; | |
159 | printf_debug("ctf_move_pos after increment: %" PRId64 "\n", pos->offset); | |
160 | } | |
161 | ||
162 | /* | |
163 | * align_pos - align position on a bit offset (> 0) | |
164 | * | |
165 | * TODO: allow larger files by updating base too. | |
166 | */ | |
167 | static inline | |
168 | void ctf_align_pos(struct ctf_stream_pos *pos, uint64_t bit_offset) | |
169 | { | |
170 | ctf_move_pos(pos, offset_align(pos->offset, bit_offset)); | |
171 | } | |
172 | ||
173 | static inline | |
174 | char *ctf_get_pos_addr(struct ctf_stream_pos *pos) | |
175 | { | |
176 | /* Only makes sense to get the address after aligning on CHAR_BIT */ | |
177 | assert(!(pos->offset % CHAR_BIT)); | |
178 | return mmap_align_addr(pos->base_mma) + | |
179 | pos->mmap_base_offset + (pos->offset / CHAR_BIT); | |
180 | } | |
181 | ||
182 | static inline | |
183 | void ctf_dummy_pos(struct ctf_stream_pos *pos, struct ctf_stream_pos *dummy) | |
184 | { | |
185 | memcpy(dummy, pos, sizeof(struct ctf_stream_pos)); | |
186 | dummy->dummy = 1; | |
187 | dummy->fd = -1; | |
188 | } | |
189 | ||
190 | /* | |
191 | * Check if current packet can hold data. | |
192 | * Returns 0 for success, negative error otherwise. | |
193 | */ | |
194 | static inline | |
195 | int ctf_pos_packet(struct ctf_stream_pos *dummy) | |
196 | { | |
197 | if (unlikely(dummy->offset > dummy->packet_size)) | |
198 | return -ENOSPC; | |
199 | return 0; | |
200 | } | |
201 | ||
202 | static inline | |
203 | void ctf_pos_pad_packet(struct ctf_stream_pos *pos) | |
204 | { | |
205 | ctf_move_pos(pos, pos->packet_size - pos->offset); | |
206 | } | |
207 | ||
208 | static inline | |
209 | int ctf_pos_access_ok(struct ctf_stream_pos *pos, uint64_t bit_len) | |
210 | { | |
211 | if (unlikely(pos->offset == EOF)) | |
212 | return 0; | |
213 | if (unlikely(pos->offset + bit_len > pos->packet_size)) | |
214 | return 0; | |
215 | return 1; | |
216 | } | |
217 | ||
218 | /* | |
219 | * Update the stream position for to the current event. This moves to | |
220 | * the next packet if we are located at the end of the current packet. | |
221 | */ | |
222 | static inline | |
223 | void ctf_pos_get_event(struct ctf_stream_pos *pos) | |
224 | { | |
225 | assert(pos->offset <= pos->content_size); | |
226 | if (pos->offset == pos->content_size) { | |
227 | printf_debug("ctf_packet_seek (before call): %" PRId64 "\n", | |
228 | pos->offset); | |
229 | pos->packet_seek(&pos->parent, 0, SEEK_CUR); | |
230 | printf_debug("ctf_packet_seek (after call): %" PRId64 "\n", | |
231 | pos->offset); | |
232 | } | |
233 | } | |
234 | ||
235 | void ctf_print_timestamp(FILE *fp, struct ctf_stream_definition *stream, | |
236 | uint64_t timestamp); | |
237 | ||
238 | #endif /* _BABELTRACE_CTF_TYPES_H */ |