/* pads */
GstClock *clock;
+ gboolean have_nonintraonly_v_streams;
guint num_v_streams;
guint num_a_streams;
guint num_t_streams;
/* state */
gboolean streaming;
- guint level_up;
guint64 seek_block;
gboolean seek_first;
/* some state saving */
GstClockTime cluster_time;
guint64 cluster_offset;
+ guint64 cluster_prevsize; /* 0 if unknown */
guint64 first_cluster_offset;
guint64 next_cluster_offset;
GstClockTime requested_seek_time;
guint64 seek_offset;
+ /* alternative duration; optionally obtained from last cluster */
+ guint64 last_cluster_offset;
+ GstClockTime stream_last_time;
+
/* index stuff */
gboolean seekable;
gboolean building_index;
guint64 index_offset;
GstEvent *seek_event;
+ GstEvent *deferred_seek_event;
+ GstPad *deferred_seek_pad;
gboolean need_segment;
guint32 segment_seqnum;
GArray *seek_index;
gint seek_entry;
+ gboolean seen_cluster_prevsize; /* We track this because the
+ * first cluster won't have
+ * this set, so we can't just
+ * check cluster_prevsize to
+ * determine if it's there
+ * or not. We assume if one
+ * cluster has it, all but
+ * the first will have it. */
+
+ guint max_backtrack_distance; /* in seconds (0 = don't backtrack) */
+
/* gap handling */
guint64 max_gap_time;
/* for non-finalized files, with invalid segment duration */
gboolean invalid_duration;
+
+ /* Cached upstream length (default G_MAXUINT64) */
+ guint64 cached_length;
} GstMatroskaDemux;
typedef struct _GstMatroskaDemuxClass {