return iter;
}
+struct bt_ctf_iter *bt_ctf_iter_create_intersect(struct bt_context *ctx,
+ struct bt_iter_pos **inter_begin_pos,
+ struct bt_iter_pos **inter_end_pos)
+{
+ int ret;
+ int64_t begin, end;
+
+ /*
+ * The iterator's range is the union of each trace's intersection of
+ * streams. This means that we determine the "active" region of each
+ * trace (that is the region where all of its streams are active), and
+ * use the TraceCollection to merge all of these active regions.
+ *
+ * This results in a union of the traces' active regions.
+ */
+ ret = ctf_find_tc_stream_packet_intersection_union(ctx, &begin, &end);
+ if (ret == 1) {
+ fprintf(stderr, "[error] No intersection found between trace files.\n");
+ goto error;
+ } else if (ret != 0) {
+ goto error;
+ }
+ *inter_begin_pos = bt_iter_create_time_pos(NULL, begin);
+ if (!(*inter_begin_pos)) {
+ goto error;
+ }
+ *inter_end_pos = bt_iter_create_time_pos(NULL, end);
+ if (!(*inter_end_pos)) {
+ goto error;
+ }
+
+ ret = ctf_tc_set_stream_intersection_mode(ctx);
+ if (ret) {
+ goto error;
+ }
+
+ /*
+ * bt_ctf_iter does not take ownership of begin and end positions,
+ * so we return them to the caller who must still assume their ownership
+ * until the iterator is destroyed.
+ */
+ return bt_ctf_iter_create(ctx, *inter_begin_pos,
+ *inter_end_pos);
+error:
+ return NULL;
+}
+
void bt_ctf_iter_destroy(struct bt_ctf_iter *iter)
{
struct bt_stream_callbacks *bt_stream_cb;
ret->parent = g_ptr_array_index(stream->events_by_id,
stream->event_id);
- if (!file_stream->pos.packet_cycles_index)
+ if (!file_stream->pos.packet_index)
packet_index = NULL;
else
- packet_index = &g_array_index(file_stream->pos.packet_cycles_index,
+ packet_index = &g_array_index(file_stream->pos.packet_index,
struct packet_index, file_stream->pos.cur_index);
iter->events_lost = 0;
if (packet_index && packet_index->events_discarded >