struct bt_iter {
struct ptr_heap *stream_heap;
struct bt_context *ctx;
- struct bt_iter_pos *end_pos;
- struct bt_ctf_event current_ctf_event; /* last read event */
- GArray *callbacks; /* Array of struct bt_stream_callbacks */
- struct bt_callback_chain main_callbacks; /* For all events */
- /*
- * Flag indicating if dependency graph needs to be recalculated.
- * Set by bt_iter_add_callback(), and checked (and
- * cleared) by upon entry into bt_iter_read_event().
- * bt_iter_read_event() is responsible for calling dep
- * graph calculation if it sees this flag set.
- */
- int recalculate_dep_graph;
- /*
- * Array of pointers to struct bt_dependencies, for garbage
- * collection. We're not using a linked list here because each
- * struct bt_dependencies can belong to more than one
- * bt_iter.
- */
- GPtrArray *dep_gc;
+ const struct bt_iter_pos *end_pos;
};
+/*
+ * bt_iter_create - Allocate a trace collection iterator.
+ *
+ * begin_pos and end_pos are optional parameters to specify the position
+ * at which the trace collection should be seeked upon iterator
+ * creation, and the position at which iteration will start returning
+ * "EOF".
+ *
+ * By default, if begin_pos is NULL, a BT_SEEK_CUR is performed at
+ * creation. By default, if end_pos is NULL, a BT_SEEK_END (end of
+ * trace) is the EOF criterion.
+ */
+struct bt_iter *bt_iter_create(struct bt_context *ctx,
+ const struct bt_iter_pos *begin_pos,
+ const struct bt_iter_pos *end_pos);
+
+/*
+ * bt_iter_destroy - Free a trace collection iterator.
+ */
+void bt_iter_destroy(struct bt_iter *iter);
+
+int bt_iter_init(struct bt_iter *iter,
+ struct bt_context *ctx,
+ const struct bt_iter_pos *begin_pos,
+ const struct bt_iter_pos *end_pos);
+void bt_iter_fini(struct bt_iter *iter);
+
#endif /* _BABELTRACE_ITERATOR_INTERNAL_H */