Commit c77a5460 authored by Tomas Härdin's avatar Tomas Härdin Committed by Janne Grunau

mxfdec: Make mxf->partitions sorted by offset.

This also zeroes new entries for good measure (used by future patches).
Signed-off-by: 's avatarJanne Grunau <janne-libav@jannau.net>
parent be78e3f6
...@@ -192,6 +192,7 @@ typedef struct { ...@@ -192,6 +192,7 @@ typedef struct {
MXFPartition *current_partition; MXFPartition *current_partition;
int parsing_backward; int parsing_backward;
int64_t last_forward_tell; int64_t last_forward_tell;
int last_forward_partition;
} MXFContext; } MXFContext;
enum MXFWrappingScheme { enum MXFWrappingScheme {
...@@ -448,7 +449,20 @@ static int mxf_read_partition_pack(void *arg, AVIOContext *pb, int tag, int size ...@@ -448,7 +449,20 @@ static int mxf_read_partition_pack(void *arg, AVIOContext *pb, int tag, int size
if (!mxf->partitions) if (!mxf->partitions)
return AVERROR(ENOMEM); return AVERROR(ENOMEM);
partition = mxf->current_partition = &mxf->partitions[mxf->partitions_count++]; if (mxf->parsing_backward) {
/* insert the new partition pack in the middle
* this makes the entries in mxf->partitions sorted by offset */
memmove(&mxf->partitions[mxf->last_forward_partition+1],
&mxf->partitions[mxf->last_forward_partition],
(mxf->partitions_count - mxf->last_forward_partition)*sizeof(*mxf->partitions));
partition = mxf->current_partition = &mxf->partitions[mxf->last_forward_partition];
} else {
mxf->last_forward_partition++;
partition = mxf->current_partition = &mxf->partitions[mxf->partitions_count];
}
memset(partition, 0, sizeof(*partition));
mxf->partitions_count++;
switch(uid[13]) { switch(uid[13]) {
case 2: case 2:
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment