falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
33660 Commits
32 Branches
449MB
Tree: beb33fca69
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'beb33fca69'
${ noResults }
FFmpeg/libavformat/mxfdec.c

2120 lines
78KB
Raw Blame History 

  1. /*

  2.  * MXF demuxer.

  3.  * Copyright (c) 2006 SmartJog S.A., Baptiste Coudurier <baptiste dot coudurier at smartjog dot com>

  4.  *

  5.  * This file is part of Libav.

  6.  *

  7.  * Libav is free software; you can redistribute it and/or

  8.  * modify it under the terms of the GNU Lesser General Public

  9.  * License as published by the Free Software Foundation; either

  10.  * version 2.1 of the License, or (at your option) any later version.

  11.  *

  12.  * Libav is distributed in the hope that it will be useful,

  13.  * but WITHOUT ANY WARRANTY; without even the implied warranty of

  14.  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

  15.  * Lesser General Public License for more details.

  16.  *

  17.  * You should have received a copy of the GNU Lesser General Public

  18.  * License along with Libav; if not, write to the Free Software

  19.  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA

  20.  */

  21. 

  22. /*

  23.  * References

  24.  * SMPTE 336M KLV Data Encoding Protocol Using Key-Length-Value

  25.  * SMPTE 377M MXF File Format Specifications

  26.  * SMPTE 378M Operational Pattern 1a

  27.  * SMPTE 379M MXF Generic Container

  28.  * SMPTE 381M Mapping MPEG Streams into the MXF Generic Container

  29.  * SMPTE 382M Mapping AES3 and Broadcast Wave Audio into the MXF Generic Container

  30.  * SMPTE 383M Mapping DV-DIF Data to the MXF Generic Container

  31.  *

  32.  * Principle

  33.  * Search for Track numbers which will identify essence element KLV packets.

  34.  * Search for SourcePackage which define tracks which contains Track numbers.

  35.  * Material Package contains tracks with reference to SourcePackage tracks.

  36.  * Search for Descriptors (Picture, Sound) which contains codec info and parameters.

  37.  * Assign Descriptors to correct Tracks.

  38.  *

  39.  * Metadata reading functions read Local Tags, get InstanceUID(0x3C0A) then add MetaDataSet to MXFContext.

  40.  * Metadata parsing resolves Strong References to objects.

  41.  *

  42.  * Simple demuxer, only OP1A supported and some files might not work at all.

  43.  * Only tracks with associated descriptors will be decoded. "Highly Desirable" SMPTE 377M D.1

  44.  */

  45. 

  46. //#define DEBUG

  47. 

  48. #include "libavutil/aes.h"

  49. #include "libavutil/mathematics.h"

  50. #include "libavcodec/bytestream.h"

  51. #include "avformat.h"

  52. #include "internal.h"

  53. #include "mxf.h"

  54. 

  55. typedef enum {

  56.     Header,

  57.     BodyPartition,

  58.     Footer

  59. } MXFPartitionType;

  60. 

  61. typedef enum {

  62.     OP1a = 1,

  63.     OP1b,

  64.     OP1c,

  65.     OP2a,

  66.     OP2b,

  67.     OP2c,

  68.     OP3a,

  69.     OP3b,

  70.     OP3c,

  71.     OPAtom,

  72.     OPSonyOpt,  /* FATE sample, violates the spec in places */

  73. } MXFOP;

  74. 

  75. typedef struct {

  76.     int closed;

  77.     int complete;

  78.     MXFPartitionType type;

  79.     uint64_t previous_partition;

  80.     int index_sid;

  81.     int body_sid;

  82.     int64_t this_partition;

  83.     int64_t essence_offset;         ///< absolute offset of essence

  84.     int64_t essence_length;

  85.     int32_t kag_size;

  86.     int64_t header_byte_count;

  87.     int64_t index_byte_count;

  88.     int pack_length;

  89. } MXFPartition;

  90. 

  91. typedef struct {

  92.     UID uid;

  93.     enum MXFMetadataSetType type;

  94.     UID source_container_ul;

  95. } MXFCryptoContext;

  96. 

  97. typedef struct {

  98.     UID uid;

  99.     enum MXFMetadataSetType type;

  100.     UID source_package_uid;

  101.     UID data_definition_ul;

  102.     int64_t duration;

  103.     int64_t start_position;

  104.     int source_track_id;

  105. } MXFStructuralComponent;

  106. 

  107. typedef struct {

  108.     UID uid;

  109.     enum MXFMetadataSetType type;

  110.     UID data_definition_ul;

  111.     UID *structural_components_refs;

  112.     int structural_components_count;

  113.     int64_t duration;

  114. } MXFSequence;

  115. 

  116. typedef struct {

  117.     UID uid;

  118.     enum MXFMetadataSetType type;

  119.     MXFSequence *sequence; /* mandatory, and only one */

  120.     UID sequence_ref;

  121.     int track_id;

  122.     uint8_t track_number[4];

  123.     AVRational edit_rate;

  124. } MXFTrack;

  125. 

  126. typedef struct {

  127.     UID uid;

  128.     enum MXFMetadataSetType type;

  129.     UID essence_container_ul;

  130.     UID essence_codec_ul;

  131.     AVRational sample_rate;

  132.     AVRational aspect_ratio;

  133.     int width;

  134.     int height;

  135.     int channels;

  136.     int bits_per_sample;

  137.     UID *sub_descriptors_refs;

  138.     int sub_descriptors_count;

  139.     int linked_track_id;

  140.     uint8_t *extradata;

  141.     int extradata_size;

  142.     enum PixelFormat pix_fmt;

  143. } MXFDescriptor;

  144. 

  145. typedef struct {

  146.     UID uid;

  147.     enum MXFMetadataSetType type;

  148.     int edit_unit_byte_count;

  149.     int index_sid;

  150.     int body_sid;

  151.     AVRational index_edit_rate;

  152.     uint64_t index_start_position;

  153.     uint64_t index_duration;

  154.     int8_t *temporal_offset_entries;

  155.     int *flag_entries;

  156.     uint64_t *stream_offset_entries;

  157.     int nb_index_entries;

  158. } MXFIndexTableSegment;

  159. 

  160. typedef struct {

  161.     UID uid;

  162.     enum MXFMetadataSetType type;

  163.     UID package_uid;

  164.     UID *tracks_refs;

  165.     int tracks_count;

  166.     MXFDescriptor *descriptor; /* only one */

  167.     UID descriptor_ref;

  168. } MXFPackage;

  169. 

  170. typedef struct {

  171.     UID uid;

  172.     enum MXFMetadataSetType type;

  173. } MXFMetadataSet;

  174. 

  175. /* decoded index table */

  176. typedef struct {

  177.     int index_sid;

  178.     int body_sid;

  179.     int nb_ptses;               /* number of PTSes or total duration of index */

  180.     int64_t first_dts;          /* DTS = EditUnit + first_dts */

  181.     int64_t *ptses;             /* maps EditUnit -> PTS */

  182.     int nb_segments;

  183.     MXFIndexTableSegment **segments;    /* sorted by IndexStartPosition */

  184.     AVIndexEntry *fake_index;   /* used for calling ff_index_search_timestamp() */

  185. } MXFIndexTable;

  186. 

  187. typedef struct {

  188.     MXFPartition *partitions;

  189.     unsigned partitions_count;

  190.     MXFOP op;

  191.     UID *packages_refs;

  192.     int packages_count;

  193.     MXFMetadataSet **metadata_sets;

  194.     int metadata_sets_count;

  195.     AVFormatContext *fc;

  196.     struct AVAES *aesc;

  197.     uint8_t *local_tags;

  198.     int local_tags_count;

  199.     uint64_t footer_partition;

  200.     KLVPacket current_klv_data;

  201.     int current_klv_index;

  202.     int run_in;

  203.     MXFPartition *current_partition;

  204.     int parsing_backward;

  205.     int64_t last_forward_tell;

  206.     int last_forward_partition;

  207.     int current_edit_unit;

  208.     int nb_index_tables;

  209.     MXFIndexTable *index_tables;

  210.     int edit_units_per_packet;      ///< how many edit units to read at a time (PCM, OPAtom)

  211. } MXFContext;

  212. 

  213. enum MXFWrappingScheme {

  214.     Frame,

  215.     Clip,

  216. };

  217. 

  218. /* NOTE: klv_offset is not set (-1) for local keys */

  219. typedef int MXFMetadataReadFunc(void *arg, AVIOContext *pb, int tag, int size, UID uid, int64_t klv_offset);

  220. 

  221. typedef struct {

  222.     const UID key;

  223.     MXFMetadataReadFunc *read;

  224.     int ctx_size;

  225.     enum MXFMetadataSetType type;

  226. } MXFMetadataReadTableEntry;

  227. 

  228. /* partial keys to match */

  229. static const uint8_t mxf_header_partition_pack_key[]       = { 0x06,0x0e,0x2b,0x34,0x02,0x05,0x01,0x01,0x0d,0x01,0x02,0x01,0x01,0x02 };

  230. static const uint8_t mxf_essence_element_key[]             = { 0x06,0x0e,0x2b,0x34,0x01,0x02,0x01,0x01,0x0d,0x01,0x03,0x01 };

  231. static const uint8_t mxf_avid_essence_element_key[]        = { 0x06,0x0e,0x2b,0x34,0x01,0x02,0x01,0x01,0x0e,0x04,0x03,0x01 };

  232. static const uint8_t mxf_system_item_key[]                 = { 0x06,0x0E,0x2B,0x34,0x02,0x05,0x01,0x01,0x0D,0x01,0x03,0x01,0x04 };

  233. static const uint8_t mxf_klv_key[]                         = { 0x06,0x0e,0x2b,0x34 };

  234. /* complete keys to match */

  235. static const uint8_t mxf_crypto_source_container_ul[]      = { 0x06,0x0e,0x2b,0x34,0x01,0x01,0x01,0x09,0x06,0x01,0x01,0x02,0x02,0x00,0x00,0x00 };

  236. static const uint8_t mxf_encrypted_triplet_key[]           = { 0x06,0x0e,0x2b,0x34,0x02,0x04,0x01,0x07,0x0d,0x01,0x03,0x01,0x02,0x7e,0x01,0x00 };

  237. static const uint8_t mxf_encrypted_essence_container[]     = { 0x06,0x0e,0x2b,0x34,0x04,0x01,0x01,0x07,0x0d,0x01,0x03,0x01,0x02,0x0b,0x01,0x00 };

  238. static const uint8_t mxf_sony_mpeg4_extradata[]            = { 0x06,0x0e,0x2b,0x34,0x04,0x01,0x01,0x01,0x0e,0x06,0x06,0x02,0x02,0x01,0x00,0x00 };

  239. 

  240. #define IS_KLV_KEY(x, y) (!memcmp(x, y, sizeof(y)))

  241. 

  242. static int64_t klv_decode_ber_length(AVIOContext *pb)

  243. {

  244.     uint64_t size = avio_r8(pb);

  245.     if (size & 0x80) { /* long form */

  246.         int bytes_num = size & 0x7f;

  247.         /* SMPTE 379M 5.3.4 guarantee that bytes_num must not exceed 8 bytes */

  248.         if (bytes_num > 8)

  249.             return AVERROR_INVALIDDATA;

  250.         size = 0;

  251.         while (bytes_num--)

  252.             size = size << 8 | avio_r8(pb);

  253.     }

  254.     return size;

  255. }

  256. 

  257. static int mxf_read_sync(AVIOContext *pb, const uint8_t *key, unsigned size)

  258. {

  259.     int i, b;

  260.     for (i = 0; i < size && !pb->eof_reached; i++) {

  261.         b = avio_r8(pb);

  262.         if (b == key[0])

  263.             i = 0;

  264.         else if (b != key[i])

  265.             i = -1;

  266.     }

  267.     return i == size;

  268. }

  269. 

  270. static int klv_read_packet(KLVPacket *klv, AVIOContext *pb)

  271. {

  272.     if (!mxf_read_sync(pb, mxf_klv_key, 4))

  273.         return AVERROR_INVALIDDATA;

  274.     klv->offset = avio_tell(pb) - 4;

  275.     memcpy(klv->key, mxf_klv_key, 4);

  276.     avio_read(pb, klv->key + 4, 12);

  277.     klv->length = klv_decode_ber_length(pb);

  278.     return klv->length == -1 ? -1 : 0;

  279. }

  280. 

  281. static int mxf_get_stream_index(AVFormatContext *s, KLVPacket *klv)

  282. {

  283.     int i;

  284. 

  285.     for (i = 0; i < s->nb_streams; i++) {

  286.         MXFTrack *track = s->streams[i]->priv_data;

  287.         /* SMPTE 379M 7.3 */

  288.         if (!memcmp(klv->key + sizeof(mxf_essence_element_key), track->track_number, sizeof(track->track_number)))

  289.             return i;

  290.     }

  291.     /* return 0 if only one stream, for OP Atom files with 0 as track number */

  292.     return s->nb_streams == 1 ? 0 : -1;

  293. }

  294. 

  295. /* XXX: use AVBitStreamFilter */

  296. static int mxf_get_d10_aes3_packet(AVIOContext *pb, AVStream *st, AVPacket *pkt, int64_t length)

  297. {

  298.     const uint8_t *buf_ptr, *end_ptr;

  299.     uint8_t *data_ptr;

  300.     int i;

  301. 

  302.     if (length > 61444) /* worst case PAL 1920 samples 8 channels */

  303.         return AVERROR_INVALIDDATA;

  304.     length = av_get_packet(pb, pkt, length);

  305.     if (length < 0)

  306.         return length;

  307.     data_ptr = pkt->data;

  308.     end_ptr = pkt->data + length;

  309.     buf_ptr = pkt->data + 4; /* skip SMPTE 331M header */

  310.     for (; buf_ptr + st->codec->channels*4 < end_ptr; ) {

  311.         for (i = 0; i < st->codec->channels; i++) {

  312.             uint32_t sample = bytestream_get_le32(&buf_ptr);

  313.             if (st->codec->bits_per_coded_sample == 24)

  314.                 bytestream_put_le24(&data_ptr, (sample >> 4) & 0xffffff);

  315.             else

  316.                 bytestream_put_le16(&data_ptr, (sample >> 12) & 0xffff);

  317.         }

  318.         buf_ptr += 32 - st->codec->channels*4; // always 8 channels stored SMPTE 331M

  319.     }

  320.     av_shrink_packet(pkt, data_ptr - pkt->data);

  321.     return 0;

  322. }

  323. 

  324. static int mxf_decrypt_triplet(AVFormatContext *s, AVPacket *pkt, KLVPacket *klv)

  325. {

  326.     static const uint8_t checkv[16] = {0x43, 0x48, 0x55, 0x4b, 0x43, 0x48, 0x55, 0x4b, 0x43, 0x48, 0x55, 0x4b, 0x43, 0x48, 0x55, 0x4b};

  327.     MXFContext *mxf = s->priv_data;

  328.     AVIOContext *pb = s->pb;

  329.     int64_t end = avio_tell(pb) + klv->length;

  330.     int64_t size;

  331.     uint64_t orig_size;

  332.     uint64_t plaintext_size;

  333.     uint8_t ivec[16];

  334.     uint8_t tmpbuf[16];

  335.     int index;

  336. 

  337.     if (!mxf->aesc && s->key && s->keylen == 16) {

  338.         mxf->aesc = av_malloc(av_aes_size);

  339.         if (!mxf->aesc)

  340.             return AVERROR(ENOMEM);

  341.         av_aes_init(mxf->aesc, s->key, 128, 1);

  342.     }

  343.     // crypto context

  344.     avio_skip(pb, klv_decode_ber_length(pb));

  345.     // plaintext offset

  346.     klv_decode_ber_length(pb);

  347.     plaintext_size = avio_rb64(pb);

  348.     // source klv key

  349.     klv_decode_ber_length(pb);

  350.     avio_read(pb, klv->key, 16);

  351.     if (!IS_KLV_KEY(klv, mxf_essence_element_key))

  352.         return AVERROR_INVALIDDATA;

  353.     index = mxf_get_stream_index(s, klv);

  354.     if (index < 0)

  355.         return AVERROR_INVALIDDATA;

  356.     // source size

  357.     klv_decode_ber_length(pb);

  358.     orig_size = avio_rb64(pb);

  359.     if (orig_size < plaintext_size)

  360.         return AVERROR_INVALIDDATA;

  361.     // enc. code

  362.     size = klv_decode_ber_length(pb);

  363.     if (size < 32 || size - 32 < orig_size)

  364.         return AVERROR_INVALIDDATA;

  365.     avio_read(pb, ivec, 16);

  366.     avio_read(pb, tmpbuf, 16);

  367.     if (mxf->aesc)

  368.         av_aes_crypt(mxf->aesc, tmpbuf, tmpbuf, 1, ivec, 1);

  369.     if (memcmp(tmpbuf, checkv, 16))

  370.         av_log(s, AV_LOG_ERROR, "probably incorrect decryption key\n");

  371.     size -= 32;

  372.     size = av_get_packet(pb, pkt, size);

  373.     if (size < 0)

  374.         return size;

  375.     else if (size < plaintext_size)

  376.         return AVERROR_INVALIDDATA;

  377.     size -= plaintext_size;

  378.     if (mxf->aesc)

  379.         av_aes_crypt(mxf->aesc, &pkt->data[plaintext_size],

  380.                      &pkt->data[plaintext_size], size >> 4, ivec, 1);

  381.     av_shrink_packet(pkt, orig_size);

  382.     pkt->stream_index = index;

  383.     avio_skip(pb, end - avio_tell(pb));

  384.     return 0;

  385. }

  386. 

  387. static int mxf_read_primer_pack(void *arg, AVIOContext *pb, int tag, int size, UID uid, int64_t klv_offset)

  388. {

  389.     MXFContext *mxf = arg;

  390.     int item_num = avio_rb32(pb);

  391.     int item_len = avio_rb32(pb);

  392. 

  393.     if (item_len != 18) {

  394.         av_log_ask_for_sample(pb, "unsupported primer pack item length %d\n",

  395.                               item_len);

  396.         return AVERROR_PATCHWELCOME;

  397.     }

  398.     if (item_num > UINT_MAX / item_len)

  399.         return AVERROR_INVALIDDATA;

  400.     mxf->local_tags_count = item_num;

  401.     mxf->local_tags = av_malloc(item_num*item_len);

  402.     if (!mxf->local_tags)

  403.         return AVERROR(ENOMEM);

  404.     avio_read(pb, mxf->local_tags, item_num*item_len);

  405.     return 0;

  406. }

  407. 

  408. static int mxf_read_partition_pack(void *arg, AVIOContext *pb, int tag, int size, UID uid, int64_t klv_offset)

  409. {

  410.     MXFContext *mxf = arg;

  411.     MXFPartition *partition, *tmp_part;

  412.     UID op;

  413.     uint64_t footer_partition;

  414.     uint32_t nb_essence_containers;

  415. 

  416.     if (mxf->partitions_count+1 >= UINT_MAX / sizeof(*mxf->partitions))

  417.         return AVERROR(ENOMEM);

  418. 

  419.     tmp_part = av_realloc(mxf->partitions, (mxf->partitions_count + 1) * sizeof(*mxf->partitions));

  420.     if (!tmp_part)

  421.         return AVERROR(ENOMEM);

  422.     mxf->partitions = tmp_part;

  423. 

  424.     if (mxf->parsing_backward) {

  425.         /* insert the new partition pack in the middle

  426.          * this makes the entries in mxf->partitions sorted by offset */

  427.         memmove(&mxf->partitions[mxf->last_forward_partition+1],

  428.                 &mxf->partitions[mxf->last_forward_partition],

  429.                 (mxf->partitions_count - mxf->last_forward_partition)*sizeof(*mxf->partitions));

  430.         partition = mxf->current_partition = &mxf->partitions[mxf->last_forward_partition];

  431.     } else {

  432.         mxf->last_forward_partition++;

  433.         partition = mxf->current_partition = &mxf->partitions[mxf->partitions_count];

  434.     }

  435. 

  436.     memset(partition, 0, sizeof(*partition));

  437.     mxf->partitions_count++;

  438.     partition->pack_length = avio_tell(pb) - klv_offset + size;

  439. 

  440.     switch(uid[13]) {

  441.     case 2:

  442.         partition->type = Header;

  443.         break;

  444.     case 3:

  445.         partition->type = BodyPartition;

  446.         break;

  447.     case 4:

  448.         partition->type = Footer;

  449.         break;

  450.     default:

  451.         av_log(mxf->fc, AV_LOG_ERROR, "unknown partition type %i\n", uid[13]);

  452.         return AVERROR_INVALIDDATA;

  453.     }

  454. 

  455.     /* consider both footers to be closed (there is only Footer and CompleteFooter) */

  456.     partition->closed = partition->type == Footer || !(uid[14] & 1);

  457.     partition->complete = uid[14] > 2;

  458.     avio_skip(pb, 4);

  459.     partition->kag_size = avio_rb32(pb);

  460.     partition->this_partition = avio_rb64(pb);

  461.     partition->previous_partition = avio_rb64(pb);

  462.     footer_partition = avio_rb64(pb);

  463.     partition->header_byte_count = avio_rb64(pb);

  464.     partition->index_byte_count = avio_rb64(pb);

  465.     partition->index_sid = avio_rb32(pb);

  466.     avio_skip(pb, 8);

  467.     partition->body_sid = avio_rb32(pb);

  468.     avio_read(pb, op, sizeof(UID));

  469.     nb_essence_containers = avio_rb32(pb);

  470. 

  471.     /* some files don'thave FooterPartition set in every partition */

  472.     if (footer_partition) {

  473.         if (mxf->footer_partition && mxf->footer_partition != footer_partition) {

  474.             av_log(mxf->fc, AV_LOG_ERROR,

  475.                    "inconsistent FooterPartition value: %"PRIu64" != %"PRIu64"\n",

  476.                    mxf->footer_partition, footer_partition);

  477.         } else {

  478.             mxf->footer_partition = footer_partition;

  479.         }

  480.     }

  481. 

  482.     av_dlog(mxf->fc,

  483.             "PartitionPack: ThisPartition = 0x%"PRIX64

  484.             ", PreviousPartition = 0x%"PRIX64", "

  485.             "FooterPartition = 0x%"PRIX64", IndexSID = %i, BodySID = %i\n",

  486.             partition->this_partition,

  487.             partition->previous_partition, footer_partition,

  488.             partition->index_sid, partition->body_sid);

  489. 

  490.     /* sanity check PreviousPartition if set */

  491.     if (partition->previous_partition &&

  492.         mxf->run_in + partition->previous_partition >= klv_offset) {

  493.         av_log(mxf->fc, AV_LOG_ERROR,

  494.                "PreviousPartition points to this partition or forward\n");

  495.         return AVERROR_INVALIDDATA;

  496.     }

  497. 

  498.     if      (op[12] == 1 && op[13] == 1) mxf->op = OP1a;

  499.     else if (op[12] == 1 && op[13] == 2) mxf->op = OP1b;

  500.     else if (op[12] == 1 && op[13] == 3) mxf->op = OP1c;

  501.     else if (op[12] == 2 && op[13] == 1) mxf->op = OP2a;

  502.     else if (op[12] == 2 && op[13] == 2) mxf->op = OP2b;

  503.     else if (op[12] == 2 && op[13] == 3) mxf->op = OP2c;

  504.     else if (op[12] == 3 && op[13] == 1) mxf->op = OP3a;

  505.     else if (op[12] == 3 && op[13] == 2) mxf->op = OP3b;

  506.     else if (op[12] == 3 && op[13] == 3) mxf->op = OP3c;

  507.     else if (op[12] == 64&& op[13] == 1) mxf->op = OPSonyOpt;

  508.     else if (op[12] == 0x10) {

  509.         /* SMPTE 390m: "There shall be exactly one essence container"

  510.          * 2011_DCPTEST_24FPS.V.mxf violates this and is frame wrapped,

  511.          * which is why we assume OP1a. */

  512.         if (nb_essence_containers != 1) {

  513.             /* only nag once */

  514.             if (!mxf->op)

  515.                 av_log(mxf->fc, AV_LOG_WARNING,

  516.                        "\"OPAtom\" with %u ECs - assuming OP1a\n",

  517.                        nb_essence_containers);

  518. 

  519.             mxf->op = OP1a;

  520.         } else

  521.             mxf->op = OPAtom;

  522.     } else {

  523.         av_log(mxf->fc, AV_LOG_ERROR, "unknown operational pattern: %02xh %02xh - guessing OP1a\n", op[12], op[13]);

  524.         mxf->op = OP1a;

  525.     }

  526. 

  527.     if (partition->kag_size <= 0 || partition->kag_size > (1 << 20)) {

  528.         av_log(mxf->fc, AV_LOG_WARNING, "invalid KAGSize %i - guessing ", partition->kag_size);

  529. 

  530.         if (mxf->op == OPSonyOpt)

  531.             partition->kag_size = 512;

  532.         else

  533.             partition->kag_size = 1;

  534. 

  535.         av_log(mxf->fc, AV_LOG_WARNING, "%i\n", partition->kag_size);

  536.     }

  537. 

  538.     return 0;

  539. }

  540. 

  541. static int mxf_add_metadata_set(MXFContext *mxf, void *metadata_set)

  542. {

  543.     MXFMetadataSet **tmp;

  544.     if (mxf->metadata_sets_count+1 >= UINT_MAX / sizeof(*mxf->metadata_sets))

  545.         return AVERROR(ENOMEM);

  546.     tmp = av_realloc(mxf->metadata_sets, (mxf->metadata_sets_count + 1) * sizeof(*mxf->metadata_sets));

  547.     if (!tmp)

  548.         return AVERROR(ENOMEM);

  549.     mxf->metadata_sets = tmp;

  550.     mxf->metadata_sets[mxf->metadata_sets_count] = metadata_set;

  551.     mxf->metadata_sets_count++;

  552.     return 0;

  553. }

  554. 

  555. static int mxf_read_cryptographic_context(void *arg, AVIOContext *pb, int tag, int size, UID uid, int64_t klv_offset)

  556. {

  557.     MXFCryptoContext *cryptocontext = arg;

  558.     if (size != 16)

  559.         return AVERROR_INVALIDDATA;

  560.     if (IS_KLV_KEY(uid, mxf_crypto_source_container_ul))

  561.         avio_read(pb, cryptocontext->source_container_ul, 16);

  562.     return 0;

  563. }

  564. 

  565. static int mxf_read_content_storage(void *arg, AVIOContext *pb, int tag, int size, UID uid, int64_t klv_offset)

  566. {

  567.     MXFContext *mxf = arg;

  568.     switch (tag) {

  569.     case 0x1901:

  570.         mxf->packages_count = avio_rb32(pb);

  571.         if (mxf->packages_count >= UINT_MAX / sizeof(UID))

  572.             return AVERROR_INVALIDDATA;

  573.         mxf->packages_refs = av_malloc(mxf->packages_count * sizeof(UID));

  574.         if (!mxf->packages_refs)

  575.             return AVERROR(ENOMEM);

  576.         avio_skip(pb, 4); /* useless size of objects, always 16 according to specs */

  577.         avio_read(pb, (uint8_t *)mxf->packages_refs, mxf->packages_count * sizeof(UID));

  578.         break;

  579.     }

  580.     return 0;

  581. }

  582. 

  583. static int mxf_read_source_clip(void *arg, AVIOContext *pb, int tag, int size, UID uid, int64_t klv_offset)

  584. {

  585.     MXFStructuralComponent *source_clip = arg;

  586.     switch(tag) {

  587.     case 0x0202:

  588.         source_clip->duration = avio_rb64(pb);

  589.         break;

  590.     case 0x1201:

  591.         source_clip->start_position = avio_rb64(pb);

  592.         break;

  593.     case 0x1101:

  594.         /* UMID, only get last 16 bytes */

  595.         avio_skip(pb, 16);

  596.         avio_read(pb, source_clip->source_package_uid, 16);

  597.         break;

  598.     case 0x1102:

  599.         source_clip->source_track_id = avio_rb32(pb);

  600.         break;

  601.     }

  602.     return 0;

  603. }

  604. 

  605. static int mxf_read_material_package(void *arg, AVIOContext *pb, int tag, int size, UID uid, int64_t klv_offset)

  606. {

  607.     MXFPackage *package = arg;

  608.     switch(tag) {

  609.     case 0x4403:

  610.         package->tracks_count = avio_rb32(pb);

  611.         if (package->tracks_count >= UINT_MAX / sizeof(UID))

  612.             return AVERROR_INVALIDDATA;

  613.         package->tracks_refs = av_malloc(package->tracks_count * sizeof(UID));

  614.         if (!package->tracks_refs)

  615.             return AVERROR(ENOMEM);

  616.         avio_skip(pb, 4); /* useless size of objects, always 16 according to specs */

  617.         avio_read(pb, (uint8_t *)package->tracks_refs, package->tracks_count * sizeof(UID));

  618.         break;

  619.     }

  620.     return 0;

  621. }

  622. 

  623. static int mxf_read_track(void *arg, AVIOContext *pb, int tag, int size, UID uid, int64_t klv_offset)

  624. {

  625.     MXFTrack *track = arg;

  626.     switch(tag) {

  627.     case 0x4801:

  628.         track->track_id = avio_rb32(pb);

  629.         break;

  630.     case 0x4804:

  631.         avio_read(pb, track->track_number, 4);

  632.         break;

  633.     case 0x4B01:

  634.         track->edit_rate.den = avio_rb32(pb);

  635.         track->edit_rate.num = avio_rb32(pb);

  636.         break;

  637.     case 0x4803:

  638.         avio_read(pb, track->sequence_ref, 16);

  639.         break;

  640.     }

  641.     return 0;

  642. }

  643. 

  644. static int mxf_read_sequence(void *arg, AVIOContext *pb, int tag, int size, UID uid, int64_t klv_offset)

  645. {

  646.     MXFSequence *sequence = arg;

  647.     switch(tag) {

  648.     case 0x0202:

  649.         sequence->duration = avio_rb64(pb);

  650.         break;

  651.     case 0x0201:

  652.         avio_read(pb, sequence->data_definition_ul, 16);

  653.         break;

  654.     case 0x1001:

  655.         sequence->structural_components_count = avio_rb32(pb);

  656.         if (sequence->structural_components_count >= UINT_MAX / sizeof(UID))

  657.             return AVERROR_INVALIDDATA;

  658.         sequence->structural_components_refs = av_malloc(sequence->structural_components_count * sizeof(UID));

  659.         if (!sequence->structural_components_refs)

  660.             return AVERROR(ENOMEM);

  661.         avio_skip(pb, 4); /* useless size of objects, always 16 according to specs */

  662.         avio_read(pb, (uint8_t *)sequence->structural_components_refs, sequence->structural_components_count * sizeof(UID));

  663.         break;

  664.     }

  665.     return 0;

  666. }

  667. 

  668. static int mxf_read_source_package(void *arg, AVIOContext *pb, int tag, int size, UID uid, int64_t klv_offset)

  669. {

  670.     MXFPackage *package = arg;

  671.     switch(tag) {

  672.     case 0x4403:

  673.         package->tracks_count = avio_rb32(pb);

  674.         if (package->tracks_count >= UINT_MAX / sizeof(UID))

  675.             return AVERROR_INVALIDDATA;

  676.         package->tracks_refs = av_malloc(package->tracks_count * sizeof(UID));

  677.         if (!package->tracks_refs)

  678.             return AVERROR(ENOMEM);

  679.         avio_skip(pb, 4); /* useless size of objects, always 16 according to specs */

  680.         avio_read(pb, (uint8_t *)package->tracks_refs, package->tracks_count * sizeof(UID));

  681.         break;

  682.     case 0x4401:

  683.         /* UMID, only get last 16 bytes */

  684.         avio_skip(pb, 16);

  685.         avio_read(pb, package->package_uid, 16);

  686.         break;

  687.     case 0x4701:

  688.         avio_read(pb, package->descriptor_ref, 16);

  689.         break;

  690.     }

  691.     return 0;

  692. }

  693. 

  694. static int mxf_read_index_entry_array(AVIOContext *pb, MXFIndexTableSegment *segment)

  695. {

  696.     int i, length;

  697. 

  698.     segment->nb_index_entries = avio_rb32(pb);

  699.     if (!segment->nb_index_entries)

  700.         return 0;

  701.     else if (segment->nb_index_entries < 0 ||

  702.              segment->nb_index_entries >

  703.              (INT_MAX >> av_log2(sizeof(*segment->stream_offset_entries))))

  704.         return AVERROR(ENOMEM);

  705. 

  706.     length = avio_rb32(pb);

  707. 

  708.     segment->temporal_offset_entries = av_mallocz(segment->nb_index_entries *

  709.                                  sizeof(*segment->temporal_offset_entries));

  710.     segment->flag_entries            = av_mallocz(segment->nb_index_entries *

  711.                                  sizeof(*segment->flag_entries));

  712.     segment->stream_offset_entries   = av_mallocz(segment->nb_index_entries *

  713.                                  sizeof(*segment->stream_offset_entries));

  714. 

  715.     if (!segment->flag_entries || !segment->stream_offset_entries ||

  716.         !segment->temporal_offset_entries) {

  717.         av_freep(&segment->flag_entries);

  718.         av_freep(&segment->stream_offset_entries);

  719.         av_freep(&segment->temporal_offset_entries);

  720.         return AVERROR(ENOMEM);

  721.     }

  722. 

  723.     for (i = 0; i < segment->nb_index_entries; i++) {

  724.         segment->temporal_offset_entries[i] = avio_r8(pb);

  725.         avio_r8(pb);                                        /* KeyFrameOffset */

  726.         segment->flag_entries[i] = avio_r8(pb);

  727.         segment->stream_offset_entries[i] = avio_rb64(pb);

  728.         avio_skip(pb, length - 11);

  729.     }

  730.     return 0;

  731. }

  732. 

  733. static int mxf_read_index_table_segment(void *arg, AVIOContext *pb, int tag, int size, UID uid, int64_t klv_offset)

  734. {

  735.     MXFIndexTableSegment *segment = arg;

  736.     switch(tag) {

  737.     case 0x3F05:

  738.         segment->edit_unit_byte_count = avio_rb32(pb);

  739.         av_dlog(NULL, "EditUnitByteCount %d\n", segment->edit_unit_byte_count);

  740.         break;

  741.     case 0x3F06:

  742.         segment->index_sid = avio_rb32(pb);

  743.         av_dlog(NULL, "IndexSID %d\n", segment->index_sid);

  744.         break;

  745.     case 0x3F07:

  746.         segment->body_sid = avio_rb32(pb);

  747.         av_dlog(NULL, "BodySID %d\n", segment->body_sid);

  748.         break;

  749.     case 0x3F0A:

  750.         av_dlog(NULL, "IndexEntryArray found\n");

  751.         return mxf_read_index_entry_array(pb, segment);

  752.     case 0x3F0B:

  753.         segment->index_edit_rate.num = avio_rb32(pb);

  754.         segment->index_edit_rate.den = avio_rb32(pb);

  755.         av_dlog(NULL, "IndexEditRate %d/%d\n", segment->index_edit_rate.num,

  756.                 segment->index_edit_rate.den);

  757.         break;

  758.     case 0x3F0C:

  759.         segment->index_start_position = avio_rb64(pb);

  760.         av_dlog(NULL, "IndexStartPosition %"PRId64"\n", segment->index_start_position);

  761.         break;

  762.     case 0x3F0D:

  763.         segment->index_duration = avio_rb64(pb);

  764.         av_dlog(NULL, "IndexDuration %"PRId64"\n", segment->index_duration);

  765.         break;

  766.     }

  767.     return 0;

  768. }

  769. 

  770. static void mxf_read_pixel_layout(AVIOContext *pb, MXFDescriptor *descriptor)

  771. {

  772.     int code, value, ofs = 0;

  773.     char layout[16] = {0};

  774. 

  775.     do {

  776.         code = avio_r8(pb);

  777.         value = avio_r8(pb);

  778.         av_dlog(NULL, "pixel layout: code %#x\n", code);

  779. 

  780.         if (ofs < 16) {

  781.             layout[ofs++] = code;

  782.             layout[ofs++] = value;

  783.         }

  784.     } while (code != 0); /* SMPTE 377M E.2.46 */

  785. 

  786.     ff_mxf_decode_pixel_layout(layout, &descriptor->pix_fmt);

  787. }

  788. 

  789. static int mxf_read_generic_descriptor(void *arg, AVIOContext *pb, int tag, int size, UID uid, int64_t klv_offset)

  790. {

  791.     MXFDescriptor *descriptor = arg;

  792.     switch(tag) {

  793.     case 0x3F01:

  794.         descriptor->sub_descriptors_count = avio_rb32(pb);

  795.         if (descriptor->sub_descriptors_count >= UINT_MAX / sizeof(UID))

  796.             return AVERROR_INVALIDDATA;

  797.         descriptor->sub_descriptors_refs = av_malloc(descriptor->sub_descriptors_count * sizeof(UID));

  798.         if (!descriptor->sub_descriptors_refs)

  799.             return AVERROR(ENOMEM);

  800.         avio_skip(pb, 4); /* useless size of objects, always 16 according to specs */

  801.         avio_read(pb, (uint8_t *)descriptor->sub_descriptors_refs, descriptor->sub_descriptors_count * sizeof(UID));

  802.         break;

  803.     case 0x3004:

  804.         avio_read(pb, descriptor->essence_container_ul, 16);

  805.         break;

  806.     case 0x3006:

  807.         descriptor->linked_track_id = avio_rb32(pb);

  808.         break;

  809.     case 0x3201: /* PictureEssenceCoding */

  810.         avio_read(pb, descriptor->essence_codec_ul, 16);

  811.         break;

  812.     case 0x3203:

  813.         descriptor->width = avio_rb32(pb);

  814.         break;

  815.     case 0x3202:

  816.         descriptor->height = avio_rb32(pb);

  817.         break;

  818.     case 0x320E:

  819.         descriptor->aspect_ratio.num = avio_rb32(pb);

  820.         descriptor->aspect_ratio.den = avio_rb32(pb);

  821.         break;

  822.     case 0x3D03:

  823.         descriptor->sample_rate.num = avio_rb32(pb);

  824.         descriptor->sample_rate.den = avio_rb32(pb);

  825.         break;

  826.     case 0x3D06: /* SoundEssenceCompression */

  827.         avio_read(pb, descriptor->essence_codec_ul, 16);

  828.         break;

  829.     case 0x3D07:

  830.         descriptor->channels = avio_rb32(pb);

  831.         break;

  832.     case 0x3D01:

  833.         descriptor->bits_per_sample = avio_rb32(pb);

  834.         break;

  835.     case 0x3401:

  836.         mxf_read_pixel_layout(pb, descriptor);

  837.         break;

  838.     default:

  839.         /* Private uid used by SONY C0023S01.mxf */

  840.         if (IS_KLV_KEY(uid, mxf_sony_mpeg4_extradata)) {

  841.             descriptor->extradata = av_malloc(size + FF_INPUT_BUFFER_PADDING_SIZE);

  842.             if (!descriptor->extradata)

  843.                 return AVERROR(ENOMEM);

  844.             descriptor->extradata_size = size;

  845.             avio_read(pb, descriptor->extradata, size);

  846.         }

  847.         break;

  848.     }

  849.     return 0;

  850. }

  851. 

  852. /*

  853.  * Match an uid independently of the version byte and up to len common bytes

  854.  * Returns: boolean

  855.  */

  856. static int mxf_match_uid(const UID key, const UID uid, int len)

  857. {

  858.     int i;

  859.     for (i = 0; i < len; i++) {

  860.         if (i != 7 && key[i] != uid[i])

  861.             return 0;

  862.     }

  863.     return 1;

  864. }

  865. 

  866. static const MXFCodecUL *mxf_get_codec_ul(const MXFCodecUL *uls, UID *uid)

  867. {

  868.     while (uls->uid[0]) {

  869.         if(mxf_match_uid(uls->uid, *uid, uls->matching_len))

  870.             break;

  871.         uls++;

  872.     }

  873.     return uls;

  874. }

  875. 

  876. static void *mxf_resolve_strong_ref(MXFContext *mxf, UID *strong_ref, enum MXFMetadataSetType type)

  877. {

  878.     int i;

  879. 

  880.     if (!strong_ref)

  881.         return NULL;

  882.     for (i = 0; i < mxf->metadata_sets_count; i++) {

  883.         if (!memcmp(*strong_ref, mxf->metadata_sets[i]->uid, 16) &&

  884.             (type == AnyType || mxf->metadata_sets[i]->type == type)) {

  885.             return mxf->metadata_sets[i];

  886.         }

  887.     }

  888.     return NULL;

  889. }

  890. 

  891. static const MXFCodecUL mxf_picture_essence_container_uls[] = {

  892.     // video essence container uls

  893.     { { 0x06,0x0E,0x2B,0x34,0x04,0x01,0x01,0x02,0x0D,0x01,0x03,0x01,0x02,0x04,0x60,0x01 }, 14, CODEC_ID_MPEG2VIDEO }, /* MPEG-ES Frame wrapped */

  894.     { { 0x06,0x0E,0x2B,0x34,0x04,0x01,0x01,0x01,0x0D,0x01,0x03,0x01,0x02,0x02,0x41,0x01 }, 14,    CODEC_ID_DVVIDEO }, /* DV 625 25mbps */

  895.     { { 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 },  0,      CODEC_ID_NONE },

  896. };

  897. static const MXFCodecUL mxf_sound_essence_container_uls[] = {

  898.     // sound essence container uls

  899.     { { 0x06,0x0E,0x2B,0x34,0x04,0x01,0x01,0x01,0x0D,0x01,0x03,0x01,0x02,0x06,0x01,0x00 }, 14, CODEC_ID_PCM_S16LE }, /* BWF Frame wrapped */

  900.     { { 0x06,0x0E,0x2B,0x34,0x04,0x01,0x01,0x02,0x0D,0x01,0x03,0x01,0x02,0x04,0x40,0x01 }, 14,       CODEC_ID_MP2 }, /* MPEG-ES Frame wrapped, 0x40 ??? stream id */

  901.     { { 0x06,0x0E,0x2B,0x34,0x04,0x01,0x01,0x01,0x0D,0x01,0x03,0x01,0x02,0x01,0x01,0x01 }, 14, CODEC_ID_PCM_S16LE }, /* D-10 Mapping 50Mbps PAL Extended Template */

  902.     { { 0x06,0x0E,0x2B,0x34,0x01,0x01,0x01,0xFF,0x4B,0x46,0x41,0x41,0x00,0x0D,0x4D,0x4F }, 14, CODEC_ID_PCM_S16LE }, /* 0001GL00.MXF.A1.mxf_opatom.mxf */

  903.     { { 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 },  0,      CODEC_ID_NONE },

  904. };

  905. 

  906. static int mxf_get_sorted_table_segments(MXFContext *mxf, int *nb_sorted_segments, MXFIndexTableSegment ***sorted_segments)

  907. {

  908.     int i, j, nb_segments = 0;

  909.     MXFIndexTableSegment **unsorted_segments;

  910.     int last_body_sid = -1, last_index_sid = -1, last_index_start = -1;

  911. 

  912.     /* count number of segments, allocate arrays and copy unsorted segments */

  913.     for (i = 0; i < mxf->metadata_sets_count; i++)

  914.         if (mxf->metadata_sets[i]->type == IndexTableSegment)

  915.             nb_segments++;

  916. 

  917.     *sorted_segments  = av_mallocz(nb_segments * sizeof(**sorted_segments));

  918.     unsorted_segments = av_mallocz(nb_segments * sizeof(*unsorted_segments));

  919.     if (!sorted_segments || !unsorted_segments) {

  920.         av_freep(sorted_segments);

  921.         av_free(unsorted_segments);

  922.         return AVERROR(ENOMEM);

  923.     }

  924. 

  925.     for (i = j = 0; i < mxf->metadata_sets_count; i++)

  926.         if (mxf->metadata_sets[i]->type == IndexTableSegment)

  927.             unsorted_segments[j++] = (MXFIndexTableSegment*)mxf->metadata_sets[i];

  928. 

  929.     *nb_sorted_segments = 0;

  930. 

  931.     /* sort segments by {BodySID, IndexSID, IndexStartPosition}, remove duplicates while we're at it */

  932.     for (i = 0; i < nb_segments; i++) {

  933.         int best = -1, best_body_sid = -1, best_index_sid = -1, best_index_start = -1;

  934. 

  935.         for (j = 0; j < nb_segments; j++) {

  936.             MXFIndexTableSegment *s = unsorted_segments[j];

  937. 

  938.             /* Require larger BosySID, IndexSID or IndexStartPosition then the previous entry. This removes duplicates.

  939.              * We want the smallest values for the keys than what we currently have, unless this is the first such entry this time around.

  940.              */

  941.             if ((i == 0     || s->body_sid > last_body_sid || s->index_sid > last_index_sid || s->index_start_position > last_index_start) &&

  942.                 (best == -1 || s->body_sid < best_body_sid || s->index_sid < best_index_sid || s->index_start_position < best_index_start)) {

  943.                 best             = j;

  944.                 best_body_sid    = s->body_sid;

  945.                 best_index_sid   = s->index_sid;

  946.                 best_index_start = s->index_start_position;

  947.             }

  948.         }

  949. 

  950.         /* no suitable entry found -> we're done */

  951.         if (best == -1)

  952.             break;

  953. 

  954.         (*sorted_segments)[(*nb_sorted_segments)++] = unsorted_segments[best];

  955.         last_body_sid    = best_body_sid;

  956.         last_index_sid   = best_index_sid;

  957.         last_index_start = best_index_start;

  958.     }

  959. 

  960.     av_free(unsorted_segments);

  961. 

  962.     return 0;

  963. }

  964. 

  965. /**

  966.  * Computes the absolute file offset of the given essence container offset

  967.  */

  968. static int mxf_absolute_bodysid_offset(MXFContext *mxf, int body_sid, int64_t offset, int64_t *offset_out)

  969. {

  970.     int x;

  971.     int64_t offset_in = offset;     /* for logging */

  972. 

  973.     for (x = 0; x < mxf->partitions_count; x++) {

  974.         MXFPartition *p = &mxf->partitions[x];

  975. 

  976.         if (p->body_sid != body_sid)

  977.             continue;

  978. 

  979.         if (offset < p->essence_length || !p->essence_length) {

  980.             *offset_out = p->essence_offset + offset;

  981.             return 0;

  982.         }

  983. 

  984.         offset -= p->essence_length;

  985.     }

  986. 

  987.     av_log(mxf->fc, AV_LOG_ERROR,

  988.            "failed to find absolute offset of %"PRIX64" in BodySID %i - partial file?\n",

  989.            offset_in, body_sid);

  990. 

  991.     return AVERROR_INVALIDDATA;

  992. }

  993. 

  994. /**

  995.  * Returns the end position of the essence container with given BodySID, or zero if unknown

  996.  */

  997. static int64_t mxf_essence_container_end(MXFContext *mxf, int body_sid)

  998. {

  999.     int x;

  1000.     int64_t ret = 0;

  1001. 

  1002.     for (x = 0; x < mxf->partitions_count; x++) {

  1003.         MXFPartition *p = &mxf->partitions[x];

  1004. 

  1005.         if (p->body_sid != body_sid)

  1006.             continue;

  1007. 

  1008.         if (!p->essence_length)

  1009.             return 0;

  1010. 

  1011.         ret = p->essence_offset + p->essence_length;

  1012.     }

  1013. 

  1014.     return ret;

  1015. }

  1016. 

  1017. /* EditUnit -> absolute offset */

  1018. static int mxf_edit_unit_absolute_offset(MXFContext *mxf, MXFIndexTable *index_table, int64_t edit_unit, int64_t *edit_unit_out, int64_t *offset_out, int nag)

  1019. {

  1020.     int i;

  1021.     int64_t offset_temp = 0;

  1022. 

  1023.     for (i = 0; i < index_table->nb_segments; i++) {

  1024.         MXFIndexTableSegment *s = index_table->segments[i];

  1025. 

  1026.         edit_unit = FFMAX(edit_unit, s->index_start_position);  /* clamp if trying to seek before start */

  1027. 

  1028.         if (edit_unit < s->index_start_position + s->index_duration) {

  1029.             int64_t index = edit_unit - s->index_start_position;

  1030. 

  1031.             if (s->edit_unit_byte_count)

  1032.                 offset_temp += s->edit_unit_byte_count * index;

  1033.             else if (s->nb_index_entries) {

  1034.                 if (s->nb_index_entries == 2 * s->index_duration + 1)

  1035.                     index *= 2;     /* Avid index */

  1036. 

  1037.                 if (index < 0 || index > s->nb_index_entries) {

  1038.                     av_log(mxf->fc, AV_LOG_ERROR, "IndexSID %i segment at %"PRId64" IndexEntryArray too small\n",

  1039.                            index_table->index_sid, s->index_start_position);

  1040.                     return AVERROR_INVALIDDATA;

  1041.                 }

  1042. 

  1043.                 offset_temp = s->stream_offset_entries[index];

  1044.             } else {

  1045.                 av_log(mxf->fc, AV_LOG_ERROR, "IndexSID %i segment at %"PRId64" missing EditUnitByteCount and IndexEntryArray\n",

  1046.                        index_table->index_sid, s->index_start_position);

  1047.                 return AVERROR_INVALIDDATA;

  1048.             }

  1049. 

  1050.             if (edit_unit_out)

  1051.                 *edit_unit_out = edit_unit;

  1052. 

  1053.             return mxf_absolute_bodysid_offset(mxf, index_table->body_sid, offset_temp, offset_out);

  1054.         } else {

  1055.             /* EditUnitByteCount == 0 for VBR indexes, which is fine since they use explicit StreamOffsets */

  1056.             offset_temp += s->edit_unit_byte_count * s->index_duration;

  1057.         }

  1058.     }

  1059. 

  1060.     if (nag)

  1061.         av_log(mxf->fc, AV_LOG_ERROR, "failed to map EditUnit %"PRId64" in IndexSID %i to an offset\n", edit_unit, index_table->index_sid);

  1062. 

  1063.     return AVERROR_INVALIDDATA;

  1064. }

  1065. 

  1066. static int mxf_compute_ptses_fake_index(MXFContext *mxf, MXFIndexTable *index_table)

  1067. {

  1068.     int i, j, x;

  1069.     int8_t max_temporal_offset = -128;

  1070. 

  1071.     /* first compute how many entries we have */

  1072.     for (i = 0; i < index_table->nb_segments; i++) {

  1073.         MXFIndexTableSegment *s = index_table->segments[i];

  1074. 

  1075.         if (!s->nb_index_entries) {

  1076.             index_table->nb_ptses = 0;

  1077.             return 0;                               /* no TemporalOffsets */

  1078.         }

  1079. 

  1080.         index_table->nb_ptses += s->index_duration;

  1081.     }

  1082. 

  1083.     /* paranoid check */

  1084.     if (index_table->nb_ptses <= 0)

  1085.         return 0;

  1086. 

  1087.     if (index_table->nb_ptses > INT_MAX >> av_log2(sizeof(AVIndexEntry)) + 1)

  1088.         return AVERROR(ENOMEM);

  1089. 

  1090.     index_table->ptses      = av_mallocz(index_table->nb_ptses *

  1091.                                          sizeof(int64_t));

  1092.     index_table->fake_index = av_mallocz(index_table->nb_ptses *

  1093.                                          sizeof(AVIndexEntry));

  1094.     if (!index_table->ptses || !index_table->fake_index) {

  1095.         av_freep(&index_table->ptses);

  1096.         return AVERROR(ENOMEM);

  1097.     }

  1098. 

  1099.     /* we may have a few bad TemporalOffsets

  1100.      * make sure the corresponding PTSes don't have the bogus value 0 */

  1101.     for (x = 0; x < index_table->nb_ptses; x++)

  1102.         index_table->ptses[x] = AV_NOPTS_VALUE;

  1103. 

  1104.     /**

  1105.      * We have this:

  1106.      *

  1107.      * x  TemporalOffset

  1108.      * 0:  0

  1109.      * 1:  1

  1110.      * 2:  1

  1111.      * 3: -2

  1112.      * 4:  1

  1113.      * 5:  1

  1114.      * 6: -2

  1115.      *

  1116.      * We want to transform it into this:

  1117.      *

  1118.      * x  DTS PTS

  1119.      * 0: -1   0

  1120.      * 1:  0   3

  1121.      * 2:  1   1

  1122.      * 3:  2   2

  1123.      * 4:  3   6

  1124.      * 5:  4   4

  1125.      * 6:  5   5

  1126.      *

  1127.      * We do this by bucket sorting x by x+TemporalOffset[x] into mxf->ptses,

  1128.      * then settings mxf->first_dts = -max(TemporalOffset[x]).

  1129.      * The latter makes DTS <= PTS.

  1130.      */

  1131.     for (i = x = 0; i < index_table->nb_segments; i++) {

  1132.         MXFIndexTableSegment *s = index_table->segments[i];

  1133.         int index_delta = 1;

  1134.         int n = s->nb_index_entries;

  1135. 

  1136.         if (s->nb_index_entries == 2 * s->index_duration + 1) {

  1137.             index_delta = 2;    /* Avid index */

  1138.             /* ignore the last entry - it's the size of the essence container */

  1139.             n--;

  1140.         }

  1141. 

  1142.         for (j = 0; j < n; j += index_delta, x++) {

  1143.             int offset = s->temporal_offset_entries[j] / index_delta;

  1144.             int index  = x + offset;

  1145. 

  1146.             if (x >= index_table->nb_ptses) {

  1147.                 av_log(mxf->fc, AV_LOG_ERROR,

  1148.                        "x >= nb_ptses - IndexEntryCount %i < IndexDuration %"PRId64"?\n",

  1149.                        s->nb_index_entries, s->index_duration);

  1150.                 break;

  1151.             }

  1152. 

  1153.             index_table->fake_index[x].timestamp = x;

  1154.             index_table->fake_index[x].flags = !(s->flag_entries[j] & 0x30) ? AVINDEX_KEYFRAME : 0;

  1155. 

  1156.             if (index < 0 || index >= index_table->nb_ptses) {

  1157.                 av_log(mxf->fc, AV_LOG_ERROR,

  1158.                        "index entry %i + TemporalOffset %i = %i, which is out of bounds\n",

  1159.                        x, offset, index);

  1160.                 continue;

  1161.             }

  1162. 

  1163.             index_table->ptses[index] = x;

  1164.             max_temporal_offset = FFMAX(max_temporal_offset, offset);

  1165.         }

  1166.     }

  1167. 

  1168.     index_table->first_dts = -max_temporal_offset;

  1169. 

  1170.     return 0;

  1171. }

  1172. 

  1173. /**

  1174.  * Sorts and collects index table segments into index tables.

  1175.  * Also computes PTSes if possible.

  1176.  */

  1177. static int mxf_compute_index_tables(MXFContext *mxf)

  1178. {

  1179.     int i, j, k, ret, nb_sorted_segments;

  1180.     MXFIndexTableSegment **sorted_segments = NULL;

  1181. 

  1182.     if ((ret = mxf_get_sorted_table_segments(mxf, &nb_sorted_segments, &sorted_segments)) ||

  1183.         nb_sorted_segments <= 0) {

  1184.         av_log(mxf->fc, AV_LOG_WARNING, "broken or empty index\n");

  1185.         return 0;

  1186.     }

  1187. 

  1188.     /* sanity check and count unique BodySIDs/IndexSIDs */

  1189.     for (i = 0; i < nb_sorted_segments; i++) {

  1190.         if (i == 0 || sorted_segments[i-1]->index_sid != sorted_segments[i]->index_sid)

  1191.             mxf->nb_index_tables++;

  1192.         else if (sorted_segments[i-1]->body_sid != sorted_segments[i]->body_sid) {

  1193.             av_log(mxf->fc, AV_LOG_ERROR, "found inconsistent BodySID\n");

  1194.             ret = AVERROR_INVALIDDATA;

  1195.             goto finish_decoding_index;

  1196.         }

  1197.     }

  1198. 

  1199.     if (mxf->nb_index_tables > INT_MAX >> av_log2(sizeof(MXFIndexTable)) + 1 ||

  1200.         !(mxf->index_tables = av_mallocz(mxf->nb_index_tables *

  1201.                                          sizeof(MXFIndexTable)))) {

  1202.         av_log(mxf->fc, AV_LOG_ERROR, "failed to allocate index tables\n");

  1203.         ret = AVERROR(ENOMEM);

  1204.         goto finish_decoding_index;

  1205.     }

  1206. 

  1207.     /* distribute sorted segments to index tables */

  1208.     for (i = j = 0; i < nb_sorted_segments; i++) {

  1209.         if (i != 0 && sorted_segments[i-1]->index_sid != sorted_segments[i]->index_sid) {

  1210.             /* next IndexSID */

  1211.             j++;

  1212.         }

  1213. 

  1214.         mxf->index_tables[j].nb_segments++;

  1215.     }

  1216. 

  1217.     for (i = j = 0; j < mxf->nb_index_tables; i += mxf->index_tables[j++].nb_segments) {

  1218.         MXFIndexTable *t = &mxf->index_tables[j];

  1219. 

  1220.         if (t->nb_segments >

  1221.             (INT_MAX >> av_log2(sizeof(MXFIndexTableSegment *))) ||

  1222.             !(t->segments = av_mallocz(t->nb_segments *

  1223.                                        sizeof(MXFIndexTableSegment*)))) {

  1224.             av_log(mxf->fc, AV_LOG_ERROR, "failed to allocate IndexTableSegment"

  1225.                    " pointer array\n");

  1226.             ret = AVERROR(ENOMEM);

  1227.             goto finish_decoding_index;

  1228.         }

  1229. 

  1230.         if (sorted_segments[i]->index_start_position)

  1231.             av_log(mxf->fc, AV_LOG_WARNING, "IndexSID %i starts at EditUnit %"PRId64" - seeking may not work as expected\n",

  1232.                    sorted_segments[i]->index_sid, sorted_segments[i]->index_start_position);

  1233. 

  1234.         memcpy(t->segments, &sorted_segments[i], t->nb_segments * sizeof(MXFIndexTableSegment*));

  1235.         t->index_sid = sorted_segments[i]->index_sid;

  1236.         t->body_sid = sorted_segments[i]->body_sid;

  1237. 

  1238.         if ((ret = mxf_compute_ptses_fake_index(mxf, t)) < 0)

  1239.             goto finish_decoding_index;

  1240. 

  1241.         /* fix zero IndexDurations */

  1242.         for (k = 0; k < t->nb_segments; k++) {

  1243.             if (t->segments[k]->index_duration)

  1244.                 continue;

  1245. 

  1246.             if (t->nb_segments > 1)

  1247.                 av_log(mxf->fc, AV_LOG_WARNING, "IndexSID %i segment %i has zero IndexDuration and there's more than one segment\n",

  1248.                        t->index_sid, k);

  1249. 

  1250.             if (mxf->fc->nb_streams <= 0) {

  1251.                 av_log(mxf->fc, AV_LOG_WARNING, "no streams?\n");

  1252.                 break;

  1253.             }

  1254. 

  1255.             /* assume the first stream's duration is reasonable

  1256.              * leave index_duration = 0 on further segments in case we have any (unlikely)

  1257.              */

  1258.             t->segments[k]->index_duration = mxf->fc->streams[0]->duration;

  1259.             break;

  1260.         }

  1261.     }

  1262. 

  1263.     ret = 0;

  1264. finish_decoding_index:

  1265.     av_free(sorted_segments);

  1266.     return ret;

  1267. }

  1268. 

  1269. static int mxf_parse_structural_metadata(MXFContext *mxf)

  1270. {

  1271.     MXFPackage *material_package = NULL;

  1272.     MXFPackage *temp_package = NULL;

  1273.     int i, j, k, ret;

  1274. 

  1275.     av_dlog(mxf->fc, "metadata sets count %d\n", mxf->metadata_sets_count);

  1276.     /* TODO: handle multiple material packages (OP3x) */

  1277.     for (i = 0; i < mxf->packages_count; i++) {

  1278.         material_package = mxf_resolve_strong_ref(mxf, &mxf->packages_refs[i], MaterialPackage);

  1279.         if (material_package) break;

  1280.     }

  1281.     if (!material_package) {

  1282.         av_log(mxf->fc, AV_LOG_ERROR, "no material package found\n");

  1283.         return AVERROR_INVALIDDATA;

  1284.     }

  1285. 

  1286.     for (i = 0; i < material_package->tracks_count; i++) {

  1287.         MXFPackage *source_package = NULL;

  1288.         MXFTrack *material_track = NULL;

  1289.         MXFTrack *source_track = NULL;

  1290.         MXFTrack *temp_track = NULL;

  1291.         MXFDescriptor *descriptor = NULL;

  1292.         MXFStructuralComponent *component = NULL;

  1293.         UID *essence_container_ul = NULL;

  1294.         const MXFCodecUL *codec_ul = NULL;

  1295.         const MXFCodecUL *container_ul = NULL;

  1296.         AVStream *st;

  1297. 

  1298.         if (!(material_track = mxf_resolve_strong_ref(mxf, &material_package->tracks_refs[i], Track))) {

  1299.             av_log(mxf->fc, AV_LOG_ERROR, "could not resolve material track strong ref\n");

  1300.             continue;

  1301.         }

  1302. 

  1303.         if (!(material_track->sequence = mxf_resolve_strong_ref(mxf, &material_track->sequence_ref, Sequence))) {

  1304.             av_log(mxf->fc, AV_LOG_ERROR, "could not resolve material track sequence strong ref\n");

  1305.             continue;

  1306.         }

  1307. 

  1308.         /* TODO: handle multiple source clips */

  1309.         for (j = 0; j < material_track->sequence->structural_components_count; j++) {

  1310.             /* TODO: handle timecode component */

  1311.             component = mxf_resolve_strong_ref(mxf, &material_track->sequence->structural_components_refs[j], SourceClip);

  1312.             if (!component)

  1313.                 continue;

  1314. 

  1315.             for (k = 0; k < mxf->packages_count; k++) {

  1316.                 temp_package = mxf_resolve_strong_ref(mxf, &mxf->packages_refs[k], SourcePackage);

  1317.                 if (!temp_package)

  1318.                     continue;

  1319.                 if (!memcmp(temp_package->package_uid, component->source_package_uid, 16)) {

  1320.                     source_package = temp_package;

  1321.                     break;

  1322.                 }

  1323.             }

  1324.             if (!source_package) {

  1325.                 av_dlog(mxf->fc, "material track %d: no corresponding source package found\n", material_track->track_id);

  1326.                 break;

  1327.             }

  1328.             for (k = 0; k < source_package->tracks_count; k++) {

  1329.                 if (!(temp_track = mxf_resolve_strong_ref(mxf, &source_package->tracks_refs[k], Track))) {

  1330.                     av_log(mxf->fc, AV_LOG_ERROR, "could not resolve source track strong ref\n");

  1331.                     ret = AVERROR_INVALIDDATA;

  1332.                     goto fail_and_free;

  1333.                 }

  1334.                 if (temp_track->track_id == component->source_track_id) {

  1335.                     source_track = temp_track;

  1336.                     break;

  1337.                 }

  1338.             }

  1339.             if (!source_track) {

  1340.                 av_log(mxf->fc, AV_LOG_ERROR, "material track %d: no corresponding source track found\n", material_track->track_id);

  1341.                 break;

  1342.             }

  1343.         }

  1344.         if (!source_track || !component)

  1345.             continue;

  1346. 

  1347.         if (!(source_track->sequence = mxf_resolve_strong_ref(mxf, &source_track->sequence_ref, Sequence))) {

  1348.             av_log(mxf->fc, AV_LOG_ERROR, "could not resolve source track sequence strong ref\n");

  1349.             ret = AVERROR_INVALIDDATA;

  1350.             goto fail_and_free;

  1351.         }

  1352. 

  1353.         /* 0001GL00.MXF.A1.mxf_opatom.mxf has the same SourcePackageID as 0001GL.MXF.V1.mxf_opatom.mxf

  1354.          * This would result in both files appearing to have two streams. Work around this by sanity checking DataDefinition */

  1355.         if (memcmp(material_track->sequence->data_definition_ul, source_track->sequence->data_definition_ul, 16)) {

  1356.             av_log(mxf->fc, AV_LOG_ERROR, "material track %d: DataDefinition mismatch\n", material_track->track_id);

  1357.             continue;

  1358.         }

  1359. 

  1360.         st = avformat_new_stream(mxf->fc, NULL);

  1361.         if (!st) {

  1362.             av_log(mxf->fc, AV_LOG_ERROR, "could not allocate stream\n");

  1363.             ret = AVERROR(ENOMEM);

  1364.             goto fail_and_free;

  1365.         }

  1366.         st->id = source_track->track_id;

  1367.         st->priv_data = source_track;

  1368.         st->duration = component->duration;

  1369.         if (st->duration == -1)

  1370.             st->duration = AV_NOPTS_VALUE;

  1371.         st->start_time = component->start_position;

  1372.         avpriv_set_pts_info(st, 64, material_track->edit_rate.num, material_track->edit_rate.den);

  1373. 

  1374.         PRINT_KEY(mxf->fc, "data definition   ul", source_track->sequence->data_definition_ul);

  1375.         codec_ul = mxf_get_codec_ul(ff_mxf_data_definition_uls, &source_track->sequence->data_definition_ul);

  1376.         st->codec->codec_type = codec_ul->id;

  1377. 

  1378.         source_package->descriptor = mxf_resolve_strong_ref(mxf, &source_package->descriptor_ref, AnyType);

  1379.         if (source_package->descriptor) {

  1380.             if (source_package->descriptor->type == MultipleDescriptor) {

  1381.                 for (j = 0; j < source_package->descriptor->sub_descriptors_count; j++) {

  1382.                     MXFDescriptor *sub_descriptor = mxf_resolve_strong_ref(mxf, &source_package->descriptor->sub_descriptors_refs[j], Descriptor);

  1383. 

  1384.                     if (!sub_descriptor) {

  1385.                         av_log(mxf->fc, AV_LOG_ERROR, "could not resolve sub descriptor strong ref\n");

  1386.                         continue;

  1387.                     }

  1388.                     if (sub_descriptor->linked_track_id == source_track->track_id) {

  1389.                         descriptor = sub_descriptor;

  1390.                         break;

  1391.                     }

  1392.                 }

  1393.             } else if (source_package->descriptor->type == Descriptor)

  1394.                 descriptor = source_package->descriptor;

  1395.         }

  1396.         if (!descriptor) {

  1397.             av_log(mxf->fc, AV_LOG_INFO, "source track %d: stream %d, no descriptor found\n", source_track->track_id, st->index);

  1398.             continue;

  1399.         }

  1400.         PRINT_KEY(mxf->fc, "essence codec     ul", descriptor->essence_codec_ul);

  1401.         PRINT_KEY(mxf->fc, "essence container ul", descriptor->essence_container_ul);

  1402.         essence_container_ul = &descriptor->essence_container_ul;

  1403.         /* HACK: replacing the original key with mxf_encrypted_essence_container

  1404.          * is not allowed according to s429-6, try to find correct information anyway */

  1405.         if (IS_KLV_KEY(essence_container_ul, mxf_encrypted_essence_container)) {

  1406.             av_log(mxf->fc, AV_LOG_INFO, "broken encrypted mxf file\n");

  1407.             for (k = 0; k < mxf->metadata_sets_count; k++) {

  1408.                 MXFMetadataSet *metadata = mxf->metadata_sets[k];

  1409.                 if (metadata->type == CryptoContext) {

  1410.                     essence_container_ul = &((MXFCryptoContext *)metadata)->source_container_ul;

  1411.                     break;

  1412.                 }

  1413.             }

  1414.         }

  1415. 

  1416.         /* TODO: drop PictureEssenceCoding and SoundEssenceCompression, only check EssenceContainer */

  1417.         codec_ul = mxf_get_codec_ul(ff_mxf_codec_uls, &descriptor->essence_codec_ul);

  1418.         st->codec->codec_id = codec_ul->id;

  1419.         if (descriptor->extradata) {

  1420.             st->codec->extradata = descriptor->extradata;

  1421.             st->codec->extradata_size = descriptor->extradata_size;

  1422.         }

  1423.         if (st->codec->codec_type == AVMEDIA_TYPE_VIDEO) {

  1424.             container_ul = mxf_get_codec_ul(mxf_picture_essence_container_uls, essence_container_ul);

  1425.             if (st->codec->codec_id == CODEC_ID_NONE)

  1426.                 st->codec->codec_id = container_ul->id;

  1427.             st->codec->width = descriptor->width;

  1428.             st->codec->height = descriptor->height;

  1429.             if (st->codec->codec_id == CODEC_ID_RAWVIDEO)

  1430.                 st->codec->pix_fmt = descriptor->pix_fmt;

  1431.             st->need_parsing = AVSTREAM_PARSE_HEADERS;

  1432.         } else if (st->codec->codec_type == AVMEDIA_TYPE_AUDIO) {

  1433.             container_ul = mxf_get_codec_ul(mxf_sound_essence_container_uls, essence_container_ul);

  1434.             if (st->codec->codec_id == CODEC_ID_NONE)

  1435.                 st->codec->codec_id = container_ul->id;

  1436.             st->codec->channels = descriptor->channels;

  1437.             st->codec->bits_per_coded_sample = descriptor->bits_per_sample;

  1438. 

  1439.             if (descriptor->sample_rate.den > 0)

  1440.                 st->codec->sample_rate = descriptor->sample_rate.num / descriptor->sample_rate.den;

  1441. 

  1442.             /* TODO: implement CODEC_ID_RAWAUDIO */

  1443.             if (st->codec->codec_id == CODEC_ID_PCM_S16LE) {

  1444.                 if (descriptor->bits_per_sample > 16 && descriptor->bits_per_sample <= 24)

  1445.                     st->codec->codec_id = CODEC_ID_PCM_S24LE;

  1446.                 else if (descriptor->bits_per_sample == 32)

  1447.                     st->codec->codec_id = CODEC_ID_PCM_S32LE;

  1448.             } else if (st->codec->codec_id == CODEC_ID_PCM_S16BE) {

  1449.                 if (descriptor->bits_per_sample > 16 && descriptor->bits_per_sample <= 24)

  1450.                     st->codec->codec_id = CODEC_ID_PCM_S24BE;

  1451.                 else if (descriptor->bits_per_sample == 32)

  1452.                     st->codec->codec_id = CODEC_ID_PCM_S32BE;

  1453.             } else if (st->codec->codec_id == CODEC_ID_MP2) {

  1454.                 st->need_parsing = AVSTREAM_PARSE_FULL;

  1455.             }

  1456.         }

  1457.         if (st->codec->codec_type != AVMEDIA_TYPE_DATA && (*essence_container_ul)[15] > 0x01) {

  1458.             /* TODO: decode timestamps */

  1459.             st->need_parsing = AVSTREAM_PARSE_TIMESTAMPS;

  1460.         }

  1461.     }

  1462. 

  1463.     ret = 0;

  1464. fail_and_free:

  1465.     return ret;

  1466. }

  1467. 

  1468. static const MXFMetadataReadTableEntry mxf_metadata_read_table[] = {

  1469.     { { 0x06,0x0E,0x2B,0x34,0x02,0x05,0x01,0x01,0x0d,0x01,0x02,0x01,0x01,0x05,0x01,0x00 }, mxf_read_primer_pack },

  1470.     { { 0x06,0x0E,0x2B,0x34,0x02,0x05,0x01,0x01,0x0d,0x01,0x02,0x01,0x01,0x02,0x01,0x00 }, mxf_read_partition_pack },

  1471.     { { 0x06,0x0E,0x2B,0x34,0x02,0x05,0x01,0x01,0x0d,0x01,0x02,0x01,0x01,0x02,0x02,0x00 }, mxf_read_partition_pack },

  1472.     { { 0x06,0x0E,0x2B,0x34,0x02,0x05,0x01,0x01,0x0d,0x01,0x02,0x01,0x01,0x02,0x03,0x00 }, mxf_read_partition_pack },

  1473.     { { 0x06,0x0E,0x2B,0x34,0x02,0x05,0x01,0x01,0x0d,0x01,0x02,0x01,0x01,0x02,0x04,0x00 }, mxf_read_partition_pack },

  1474.     { { 0x06,0x0E,0x2B,0x34,0x02,0x05,0x01,0x01,0x0d,0x01,0x02,0x01,0x01,0x03,0x01,0x00 }, mxf_read_partition_pack },

  1475.     { { 0x06,0x0E,0x2B,0x34,0x02,0x05,0x01,0x01,0x0d,0x01,0x02,0x01,0x01,0x03,0x02,0x00 }, mxf_read_partition_pack },

  1476.     { { 0x06,0x0E,0x2B,0x34,0x02,0x05,0x01,0x01,0x0d,0x01,0x02,0x01,0x01,0x03,0x03,0x00 }, mxf_read_partition_pack },

  1477.     { { 0x06,0x0E,0x2B,0x34,0x02,0x05,0x01,0x01,0x0d,0x01,0x02,0x01,0x01,0x03,0x04,0x00 }, mxf_read_partition_pack },

  1478.     { { 0x06,0x0E,0x2B,0x34,0x02,0x05,0x01,0x01,0x0d,0x01,0x02,0x01,0x01,0x04,0x02,0x00 }, mxf_read_partition_pack },

  1479.     { { 0x06,0x0E,0x2B,0x34,0x02,0x05,0x01,0x01,0x0d,0x01,0x02,0x01,0x01,0x04,0x04,0x00 }, mxf_read_partition_pack },

  1480.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x18,0x00 }, mxf_read_content_storage, 0, AnyType },

  1481.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x37,0x00 }, mxf_read_source_package, sizeof(MXFPackage), SourcePackage },

  1482.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x36,0x00 }, mxf_read_material_package, sizeof(MXFPackage), MaterialPackage },

  1483.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x0F,0x00 }, mxf_read_sequence, sizeof(MXFSequence), Sequence },

  1484.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x11,0x00 }, mxf_read_source_clip, sizeof(MXFStructuralComponent), SourceClip },

  1485.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x44,0x00 }, mxf_read_generic_descriptor, sizeof(MXFDescriptor), MultipleDescriptor },

  1486.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x42,0x00 }, mxf_read_generic_descriptor, sizeof(MXFDescriptor), Descriptor }, /* Generic Sound */

  1487.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x28,0x00 }, mxf_read_generic_descriptor, sizeof(MXFDescriptor), Descriptor }, /* CDCI */

  1488.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x29,0x00 }, mxf_read_generic_descriptor, sizeof(MXFDescriptor), Descriptor }, /* RGBA */

  1489.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x51,0x00 }, mxf_read_generic_descriptor, sizeof(MXFDescriptor), Descriptor }, /* MPEG 2 Video */

  1490.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x48,0x00 }, mxf_read_generic_descriptor, sizeof(MXFDescriptor), Descriptor }, /* Wave */

  1491.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x47,0x00 }, mxf_read_generic_descriptor, sizeof(MXFDescriptor), Descriptor }, /* AES3 */

  1492.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x3A,0x00 }, mxf_read_track, sizeof(MXFTrack), Track }, /* Static Track */

  1493.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x01,0x01,0x01,0x01,0x3B,0x00 }, mxf_read_track, sizeof(MXFTrack), Track }, /* Generic Track */

  1494.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x04,0x01,0x02,0x02,0x00,0x00 }, mxf_read_cryptographic_context, sizeof(MXFCryptoContext), CryptoContext },

  1495.     { { 0x06,0x0E,0x2B,0x34,0x02,0x53,0x01,0x01,0x0d,0x01,0x02,0x01,0x01,0x10,0x01,0x00 }, mxf_read_index_table_segment, sizeof(MXFIndexTableSegment), IndexTableSegment },

  1496.     { { 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 }, NULL, 0, AnyType },

  1497. };

  1498. 

  1499. static int mxf_read_local_tags(MXFContext *mxf, KLVPacket *klv, MXFMetadataReadFunc *read_child, int ctx_size, enum MXFMetadataSetType type)

  1500. {

  1501.     AVIOContext *pb = mxf->fc->pb;

  1502.     MXFMetadataSet *ctx = ctx_size ? av_mallocz(ctx_size) : mxf;

  1503.     uint64_t klv_end = avio_tell(pb) + klv->length;

  1504. 

  1505.     if (!ctx)

  1506.         return AVERROR(ENOMEM);

  1507.     while (avio_tell(pb) + 4 < klv_end && !pb->eof_reached) {

  1508.         int ret;

  1509.         int tag = avio_rb16(pb);

  1510.         int size = avio_rb16(pb); /* KLV specified by 0x53 */

  1511.         uint64_t next = avio_tell(pb) + size;

  1512.         UID uid = {0};

  1513. 

  1514.         av_dlog(mxf->fc, "local tag %#04x size %d\n", tag, size);

  1515.         if (!size) { /* ignore empty tag, needed for some files with empty UMID tag */

  1516.             av_log(mxf->fc, AV_LOG_ERROR, "local tag %#04x with 0 size\n", tag);

  1517.             continue;

  1518.         }

  1519.         if (tag > 0x7FFF) { /* dynamic tag */

  1520.             int i;

  1521.             for (i = 0; i < mxf->local_tags_count; i++) {

  1522.                 int local_tag = AV_RB16(mxf->local_tags+i*18);

  1523.                 if (local_tag == tag) {

  1524.                     memcpy(uid, mxf->local_tags+i*18+2, 16);

  1525.                     av_dlog(mxf->fc, "local tag %#04x\n", local_tag);

  1526.                     PRINT_KEY(mxf->fc, "uid", uid);

  1527.                 }

  1528.             }

  1529.         }

  1530.         if (ctx_size && tag == 0x3C0A)

  1531.             avio_read(pb, ctx->uid, 16);

  1532.         else if ((ret = read_child(ctx, pb, tag, size, uid, -1)) < 0)

  1533.             return ret;

  1534. 

  1535.         /* Accept the 64k local set limit being exceeded (Avid). Don't accept

  1536.          * it extending past the end of the KLV though (zzuf5.mxf). */

  1537.         if (avio_tell(pb) > klv_end) {

  1538.             av_log(mxf->fc, AV_LOG_ERROR,

  1539.                    "local tag %#04x extends past end of local set @ %#"PRIx64"\n",

  1540.                    tag, klv->offset);

  1541.             return AVERROR_INVALIDDATA;

  1542.         } else if (avio_tell(pb) <= next)   /* only seek forward, else this can loop for a long time */

  1543.             avio_seek(pb, next, SEEK_SET);

  1544.     }

  1545.     if (ctx_size) ctx->type = type;

  1546.     return ctx_size ? mxf_add_metadata_set(mxf, ctx) : 0;

  1547. }

  1548. 

  1549. /**

  1550.  * Seeks to the previous partition, if possible

  1551.  * @return <= 0 if we should stop parsing, > 0 if we should keep going

  1552.  */

  1553. static int mxf_seek_to_previous_partition(MXFContext *mxf)

  1554. {

  1555.     AVIOContext *pb = mxf->fc->pb;

  1556. 

  1557.     if (!mxf->current_partition ||

  1558.         mxf->run_in + mxf->current_partition->previous_partition <= mxf->last_forward_tell)

  1559.         return 0;   /* we've parsed all partitions */

  1560. 

  1561.     /* seek to previous partition */

  1562.     avio_seek(pb, mxf->run_in + mxf->current_partition->previous_partition, SEEK_SET);

  1563.     mxf->current_partition = NULL;

  1564. 

  1565.     av_dlog(mxf->fc, "seeking to previous partition\n");

  1566. 

  1567.     return 1;

  1568. }

  1569. 

  1570. /**

  1571.  * Called when essence is encountered

  1572.  * @return <= 0 if we should stop parsing, > 0 if we should keep going

  1573.  */

  1574. static int mxf_parse_handle_essence(MXFContext *mxf)

  1575. {

  1576.     AVIOContext *pb = mxf->fc->pb;

  1577.     int64_t ret;

  1578. 

  1579.     if (mxf->parsing_backward) {

  1580.         return mxf_seek_to_previous_partition(mxf);

  1581.     } else {

  1582.         if (!mxf->footer_partition) {

  1583.             av_dlog(mxf->fc, "no footer\n");

  1584.             return 0;

  1585.         }

  1586. 

  1587.         av_dlog(mxf->fc, "seeking to footer\n");

  1588. 

  1589.         /* remember where we were so we don't end up seeking further back than this */

  1590.         mxf->last_forward_tell = avio_tell(pb);

  1591. 

  1592.         if (!pb->seekable) {

  1593.             av_log(mxf->fc, AV_LOG_INFO, "file is not seekable - not parsing footer\n");

  1594.             return -1;

  1595.         }

  1596. 

  1597.         /* seek to footer partition and parse backward */

  1598.         if ((ret = avio_seek(pb, mxf->run_in + mxf->footer_partition, SEEK_SET)) < 0) {

  1599.             av_log(mxf->fc, AV_LOG_ERROR, "failed to seek to footer @ 0x%"PRIx64" (%"PRId64") - partial file?\n",

  1600.                    mxf->run_in + mxf->footer_partition, ret);

  1601.             return ret;

  1602.         }

  1603. 

  1604.         mxf->current_partition = NULL;

  1605.         mxf->parsing_backward = 1;

  1606.     }

  1607. 

  1608.     return 1;

  1609. }

  1610. 

  1611. /**

  1612.  * Called when the next partition or EOF is encountered

  1613.  * @return <= 0 if we should stop parsing, > 0 if we should keep going

  1614.  */

  1615. static int mxf_parse_handle_partition_or_eof(MXFContext *mxf)

  1616. {

  1617.     return mxf->parsing_backward ? mxf_seek_to_previous_partition(mxf) : 1;

  1618. }

  1619. 

  1620. /**

  1621.  * Figure out the proper offset and length of the essence container

  1622.  * in each partition

  1623.  */

  1624. static void mxf_compute_essence_containers(MXFContext *mxf)

  1625. {

  1626.     int x;

  1627. 

  1628.     /* everything is already correct */

  1629.     if (mxf->op == OPAtom)

  1630.         return;

  1631. 

  1632.     for (x = 0; x < mxf->partitions_count; x++) {

  1633.         MXFPartition *p = &mxf->partitions[x];

  1634. 

  1635.         if (!p->body_sid)

  1636.             continue;       /* BodySID == 0 -> no essence */

  1637. 

  1638.         if (x >= mxf->partitions_count - 1)

  1639.             break;          /* last partition - can't compute length (and we don't need to) */

  1640. 

  1641.         /* essence container spans to the next partition */

  1642.         p->essence_length = mxf->partitions[x+1].this_partition - p->essence_offset;

  1643. 

  1644.         if (p->essence_length < 0) {

  1645.             /* next ThisPartition < essence_offset */

  1646.             p->essence_length = 0;

  1647.             av_log(mxf->fc, AV_LOG_ERROR,

  1648.                    "partition %i: bad ThisPartition = %"PRIX64"\n",

  1649.                    x+1, mxf->partitions[x+1].this_partition);

  1650.         }

  1651.     }

  1652. }

  1653. 

  1654. static int64_t round_to_kag(int64_t position, int kag_size)

  1655. {

  1656.     /* TODO: account for run-in? the spec isn't clear whether KAG should account for it */

  1657.     /* NOTE: kag_size may be any integer between 1 - 2^10 */

  1658.     int64_t ret = (position / kag_size) * kag_size;

  1659.     return ret == position ? ret : ret + kag_size;

  1660. }

  1661. 

  1662. static inline void compute_partition_essence_offset(AVFormatContext *s,

  1663.                                                     MXFContext *mxf,

  1664.                                                     KLVPacket *klv)

  1665. {

  1666.     MXFPartition *cur_part = mxf->current_partition;

  1667.     /* for OP1a we compute essence_offset

  1668.      * for OPAtom we point essence_offset after the KL

  1669.      *     (usually op1a_essence_offset + 20 or 25)

  1670.      * TODO: for OP1a we could eliminate this entire if statement, always

  1671.      *       stopping parsing at op1a_essence_offset

  1672.      *       for OPAtom we still need the actual essence_offset though

  1673.      *       (the KL's length can vary)

  1674.      */

  1675.     int64_t op1a_essence_offset =

  1676.         round_to_kag(cur_part->this_partition + cur_part->pack_length,

  1677.                      cur_part->kag_size) +

  1678.         round_to_kag(cur_part->header_byte_count, cur_part->kag_size) +

  1679.         round_to_kag(cur_part->index_byte_count, cur_part->kag_size);

  1680. 

  1681.     if (mxf->op == OPAtom) {

  1682.         /* point essence_offset to the actual data

  1683.          * OPAtom has all the essence in one big KLV

  1684.          */

  1685.         cur_part->essence_offset = avio_tell(s->pb);

  1686.         cur_part->essence_length = klv->length;

  1687.     } else {

  1688.         /* NOTE: op1a_essence_offset may be less than to klv.offset

  1689.          * (C0023S01.mxf)  */

  1690.         cur_part->essence_offset = op1a_essence_offset;

  1691.     }

  1692. }

  1693. 

  1694. static int is_pcm(enum CodecID codec_id)

  1695. {

  1696.     /* we only care about "normal" PCM codecs until we get samples */

  1697.     return codec_id >= CODEC_ID_PCM_S16LE && codec_id < CODEC_ID_PCM_S24DAUD;

  1698. }

  1699. 

  1700. /**

  1701.  * Deal with the case where for some audio atoms EditUnitByteCount is

  1702.  * very small (2, 4..). In those cases we should read more than one

  1703.  * sample per call to mxf_read_packet().

  1704.  */

  1705. static void mxf_handle_small_eubc(AVFormatContext *s)

  1706. {

  1707.     MXFContext *mxf = s->priv_data;

  1708. 

  1709.     /* assuming non-OPAtom == frame wrapped

  1710.      * no sane writer would wrap 2 byte PCM packets with 20 byte headers.. */

  1711.     if (mxf->op != OPAtom)

  1712.         return;

  1713. 

  1714.     /* expect PCM with exactly one index table segment and a small (< 32) EUBC */

  1715.     if (s->nb_streams != 1                                     ||

  1716.         s->streams[0]->codec->codec_type != AVMEDIA_TYPE_AUDIO ||

  1717.         !is_pcm(s->streams[0]->codec->codec_id)                ||

  1718.         mxf->nb_index_tables != 1                              ||

  1719.         mxf->index_tables[0].nb_segments != 1                  ||

  1720.         mxf->index_tables[0].segments[0]->edit_unit_byte_count >= 32)

  1721.         return;

  1722. 

  1723.     /* arbitrarily default to 48 kHz PAL audio frame size */

  1724.     /* TODO: We could compute this from the ratio between the audio

  1725.      *       and video edit rates for 48 kHz NTSC we could use the

  1726.      *       1802-1802-1802-1802-1801 pattern. */

  1727.     mxf->edit_units_per_packet = 1920;

  1728. }

  1729. 

  1730. static int mxf_read_header(AVFormatContext *s)

  1731. {

  1732.     MXFContext *mxf = s->priv_data;

  1733.     KLVPacket klv;

  1734.     int64_t essence_offset = 0;

  1735.     int ret;

  1736. 

  1737.     mxf->last_forward_tell = INT64_MAX;

  1738.     mxf->edit_units_per_packet = 1;

  1739. 

  1740.     if (!mxf_read_sync(s->pb, mxf_header_partition_pack_key, 14)) {

  1741.         av_log(s, AV_LOG_ERROR, "could not find header partition pack key\n");

  1742.         return AVERROR_INVALIDDATA;

  1743.     }

  1744.     avio_seek(s->pb, -14, SEEK_CUR);

  1745.     mxf->fc = s;

  1746.     mxf->run_in = avio_tell(s->pb);

  1747. 

  1748.     while (!s->pb->eof_reached) {

  1749.         const MXFMetadataReadTableEntry *metadata;

  1750. 

  1751.         if (klv_read_packet(&klv, s->pb) < 0) {

  1752.             /* EOF - seek to previous partition or stop */

  1753.             if(mxf_parse_handle_partition_or_eof(mxf) <= 0)

  1754.                 break;

  1755.             else

  1756.                 continue;

  1757.         }

  1758. 

  1759.         PRINT_KEY(s, "read header", klv.key);

  1760.         av_dlog(s, "size %"PRIu64" offset %#"PRIx64"\n", klv.length, klv.offset);

  1761.         if (IS_KLV_KEY(klv.key, mxf_encrypted_triplet_key) ||

  1762.             IS_KLV_KEY(klv.key, mxf_essence_element_key) ||

  1763.             IS_KLV_KEY(klv.key, mxf_avid_essence_element_key) ||

  1764.             IS_KLV_KEY(klv.key, mxf_system_item_key)) {

  1765. 

  1766.             if (!mxf->current_partition) {

  1767.                 av_log(mxf->fc, AV_LOG_ERROR,

  1768.                        "found essence prior to first PartitionPack\n");

  1769.                 return AVERROR_INVALIDDATA;

  1770.             }

  1771. 

  1772.             if (!mxf->current_partition->essence_offset) {

  1773.                 compute_partition_essence_offset(s, mxf, &klv);

  1774.             }

  1775. 

  1776.             if (!essence_offset)

  1777.                 essence_offset = klv.offset;

  1778. 

  1779.             /* seek to footer, previous partition or stop */

  1780.             if (mxf_parse_handle_essence(mxf) <= 0)

  1781.                 break;

  1782.             continue;

  1783.         } else if (!memcmp(klv.key, mxf_header_partition_pack_key, 13) &&

  1784.                    klv.key[13] >= 2 && klv.key[13] <= 4 && mxf->current_partition) {

  1785.             /* next partition pack - keep going, seek to previous partition or stop */

  1786.             if(mxf_parse_handle_partition_or_eof(mxf) <= 0)

  1787.                 break;

  1788.         }

  1789. 

  1790.         for (metadata = mxf_metadata_read_table; metadata->read; metadata++) {

  1791.             if (IS_KLV_KEY(klv.key, metadata->key)) {

  1792.                 int res;

  1793.                 if (klv.key[5] == 0x53) {

  1794.                     res = mxf_read_local_tags(mxf, &klv, metadata->read, metadata->ctx_size, metadata->type);

  1795.                 } else {

  1796.                     uint64_t next = avio_tell(s->pb) + klv.length;

  1797.                     res = metadata->read(mxf, s->pb, 0, klv.length, klv.key, klv.offset);

  1798. 

  1799.                     /* only seek forward, else this can loop for a long time */

  1800.                     if (avio_tell(s->pb) > next) {

  1801.                         av_log(s, AV_LOG_ERROR, "read past end of KLV @ %#"PRIx64"\n",

  1802.                                klv.offset);

  1803.                         return AVERROR_INVALIDDATA;

  1804.                     }

  1805. 

  1806.                     avio_seek(s->pb, next, SEEK_SET);

  1807.                 }

  1808.                 if (res < 0) {

  1809.                     av_log(s, AV_LOG_ERROR, "error reading header metadata\n");

  1810.                     return res;

  1811.                 }

  1812.                 break;

  1813.             }

  1814.         }

  1815.         if (!metadata->read)

  1816.             avio_skip(s->pb, klv.length);

  1817.     }

  1818.     /* FIXME avoid seek */

  1819.     if (!essence_offset)  {

  1820.         av_log(s, AV_LOG_ERROR, "no essence\n");

  1821.         return AVERROR_INVALIDDATA;

  1822.     }

  1823.     avio_seek(s->pb, essence_offset, SEEK_SET);

  1824. 

  1825.     mxf_compute_essence_containers(mxf);

  1826. 

  1827.     /* we need to do this before computing the index tables

  1828.      * to be able to fill in zero IndexDurations with st->duration */

  1829.     if ((ret = mxf_parse_structural_metadata(mxf)) < 0)

  1830.         return ret;

  1831. 

  1832.     if ((ret = mxf_compute_index_tables(mxf)) < 0)

  1833.         return ret;

  1834. 

  1835.     if (mxf->nb_index_tables > 1) {

  1836.         /* TODO: look up which IndexSID to use via EssenceContainerData */

  1837.         av_log(mxf->fc, AV_LOG_INFO, "got %i index tables - only the first one (IndexSID %i) will be used\n",

  1838.                mxf->nb_index_tables, mxf->index_tables[0].index_sid);

  1839.     } else if (mxf->nb_index_tables == 0 && mxf->op == OPAtom) {

  1840.         av_log(mxf->fc, AV_LOG_ERROR, "cannot demux OPAtom without an index\n");

  1841.         return AVERROR_INVALIDDATA;

  1842.     }

  1843. 

  1844.     mxf_handle_small_eubc(s);

  1845. 

  1846.     return 0;

  1847. }

  1848. 

  1849. /**

  1850.  * Computes DTS and PTS for the given video packet based on its offset.

  1851.  */

  1852. static void mxf_packet_timestamps(MXFContext *mxf, AVPacket *pkt)

  1853. {

  1854.     int64_t last_ofs = -1, next_ofs;

  1855.     MXFIndexTable *t = &mxf->index_tables[0];

  1856. 

  1857.     /* this is called from the OP1a demuxing logic, which means there

  1858.      * may be no index tables */

  1859.     if (mxf->nb_index_tables <= 0)

  1860.         return;

  1861. 

  1862.     /* find mxf->current_edit_unit so that the next edit unit starts ahead of pkt->pos */

  1863.     while (mxf->current_edit_unit >= 0) {

  1864.         if (mxf_edit_unit_absolute_offset(mxf, t, mxf->current_edit_unit + 1, NULL, &next_ofs, 0) < 0)

  1865.             break;

  1866. 

  1867.         if (next_ofs <= last_ofs) {

  1868.             /* large next_ofs didn't change or current_edit_unit wrapped

  1869.              * around this fixes the infinite loop on zzuf3.mxf */

  1870.             av_log(mxf->fc, AV_LOG_ERROR,

  1871.                    "next_ofs didn't change. not deriving packet timestamps\n");

  1872.             return;

  1873.         }

  1874. 

  1875.         if (next_ofs > pkt->pos)

  1876.             break;

  1877. 

  1878.         last_ofs = next_ofs;

  1879.         mxf->current_edit_unit++;

  1880.     }

  1881. 

  1882.     if (mxf->current_edit_unit < 0 || mxf->current_edit_unit >= t->nb_ptses)

  1883.         return;

  1884. 

  1885.     pkt->dts = mxf->current_edit_unit + t->first_dts;

  1886.     pkt->pts = t->ptses[mxf->current_edit_unit];

  1887. }

  1888. 

  1889. static int mxf_read_packet_old(AVFormatContext *s, AVPacket *pkt)

  1890. {

  1891.     KLVPacket klv;

  1892. 

  1893.     while (!s->pb->eof_reached) {

  1894.         if (klv_read_packet(&klv, s->pb) < 0)

  1895.             return -1;

  1896.         PRINT_KEY(s, "read packet", klv.key);

  1897.         av_dlog(s, "size %"PRIu64" offset %#"PRIx64"\n", klv.length, klv.offset);

  1898.         if (IS_KLV_KEY(klv.key, mxf_encrypted_triplet_key)) {

  1899.             int res = mxf_decrypt_triplet(s, pkt, &klv);

  1900.             if (res < 0) {

  1901.                 av_log(s, AV_LOG_ERROR, "invalid encoded triplet\n");

  1902.                 return -1;

  1903.             }

  1904.             return 0;

  1905.         }

  1906.         if (IS_KLV_KEY(klv.key, mxf_essence_element_key) ||

  1907.             IS_KLV_KEY(klv.key, mxf_avid_essence_element_key)) {

  1908.             int index = mxf_get_stream_index(s, &klv);

  1909.             if (index < 0) {

  1910.                 av_log(s, AV_LOG_ERROR, "error getting stream index %d\n", AV_RB32(klv.key+12));

  1911.                 goto skip;

  1912.             }

  1913.             if (s->streams[index]->discard == AVDISCARD_ALL)

  1914.                 goto skip;

  1915.             /* check for 8 channels AES3 element */

  1916.             if (klv.key[12] == 0x06 && klv.key[13] == 0x01 && klv.key[14] == 0x10) {

  1917.                 if (mxf_get_d10_aes3_packet(s->pb, s->streams[index], pkt, klv.length) < 0) {

  1918.                     av_log(s, AV_LOG_ERROR, "error reading D-10 aes3 frame\n");

  1919.                     return -1;

  1920.                 }

  1921.             } else {

  1922.                 int ret = av_get_packet(s->pb, pkt, klv.length);

  1923.                 if (ret < 0)

  1924.                     return ret;

  1925.             }

  1926.             pkt->stream_index = index;

  1927.             pkt->pos = klv.offset;

  1928. 

  1929.             if (s->streams[index]->codec->codec_type == AVMEDIA_TYPE_VIDEO)

  1930.                 mxf_packet_timestamps(s->priv_data, pkt);   /* offset -> EditUnit -> DTS/PTS */

  1931. 

  1932.             return 0;

  1933.         } else

  1934.         skip:

  1935.             avio_skip(s->pb, klv.length);

  1936.     }

  1937.     return AVERROR_EOF;

  1938. }

  1939. 

  1940. static int mxf_read_packet(AVFormatContext *s, AVPacket *pkt)

  1941. {

  1942.     MXFContext *mxf = s->priv_data;

  1943.     int ret, size;

  1944.     int64_t ret64, pos, next_pos;

  1945.     AVStream *st;

  1946.     MXFIndexTable *t;

  1947.     int edit_units;

  1948. 

  1949.     if (mxf->op != OPAtom)

  1950.         return mxf_read_packet_old(s, pkt);

  1951. 

  1952.     /* OPAtom - clip wrapped demuxing */

  1953.     /* NOTE: mxf_read_header() makes sure nb_index_tables > 0 for OPAtom */

  1954.     st = s->streams[0];

  1955.     t = &mxf->index_tables[0];

  1956. 

  1957.     if (mxf->current_edit_unit >= st->duration)

  1958.         return AVERROR_EOF;

  1959. 

  1960.     edit_units = FFMIN(mxf->edit_units_per_packet, st->duration - mxf->current_edit_unit);

  1961. 

  1962.     if ((ret = mxf_edit_unit_absolute_offset(mxf, t, mxf->current_edit_unit, NULL, &pos, 1)) < 0)

  1963.         return ret;

  1964. 

  1965.     /* compute size by finding the next edit unit or the end of the essence container

  1966.      * not pretty, but it works */

  1967.     if ((ret = mxf_edit_unit_absolute_offset(mxf, t, mxf->current_edit_unit + edit_units, NULL, &next_pos, 0)) < 0 &&

  1968.         (next_pos = mxf_essence_container_end(mxf, t->body_sid)) <= 0) {

  1969.         av_log(s, AV_LOG_ERROR, "unable to compute the size of the last packet\n");

  1970.         return AVERROR_INVALIDDATA;

  1971.     }

  1972. 

  1973.     if ((size = next_pos - pos) <= 0) {

  1974.         av_log(s, AV_LOG_ERROR, "bad size: %i\n", size);

  1975.         return AVERROR_INVALIDDATA;

  1976.     }

  1977. 

  1978.     if ((ret64 = avio_seek(s->pb, pos, SEEK_SET)) < 0)

  1979.         return ret64;

  1980. 

  1981.         if ((ret = av_get_packet(s->pb, pkt, size)) != size)

  1982.             return ret < 0 ? ret : AVERROR_EOF;

  1983. 

  1984.     if (st->codec->codec_type == AVMEDIA_TYPE_VIDEO && t->ptses &&

  1985.         mxf->current_edit_unit >= 0 && mxf->current_edit_unit < t->nb_ptses) {

  1986.         pkt->dts = mxf->current_edit_unit + t->first_dts;

  1987.         pkt->pts = t->ptses[mxf->current_edit_unit];

  1988.     }

  1989. 

  1990.     pkt->stream_index = 0;

  1991.     mxf->current_edit_unit += edit_units;

  1992. 

  1993.     return 0;

  1994. }

  1995. 

  1996. 

  1997. static int mxf_read_close(AVFormatContext *s)

  1998. {

  1999.     MXFContext *mxf = s->priv_data;

  2000.     MXFIndexTableSegment *seg;

  2001.     int i;

  2002. 

  2003.     av_freep(&mxf->packages_refs);

  2004. 

  2005.     for (i = 0; i < s->nb_streams; i++)

  2006.         s->streams[i]->priv_data = NULL;

  2007. 

  2008.     for (i = 0; i < mxf->metadata_sets_count; i++) {

  2009.         switch (mxf->metadata_sets[i]->type) {

  2010.         case MultipleDescriptor:

  2011.             av_freep(&((MXFDescriptor *)mxf->metadata_sets[i])->sub_descriptors_refs);

  2012.             break;

  2013.         case Sequence:

  2014.             av_freep(&((MXFSequence *)mxf->metadata_sets[i])->structural_components_refs);

  2015.             break;

  2016.         case SourcePackage:

  2017.         case MaterialPackage:

  2018.             av_freep(&((MXFPackage *)mxf->metadata_sets[i])->tracks_refs);

  2019.             break;

  2020.         case IndexTableSegment:

  2021.             seg = (MXFIndexTableSegment *)mxf->metadata_sets[i];

  2022.             av_freep(&seg->temporal_offset_entries);

  2023.             av_freep(&seg->flag_entries);

  2024.             av_freep(&seg->stream_offset_entries);

  2025.             break;

  2026.         default:

  2027.             break;

  2028.         }

  2029.         av_freep(&mxf->metadata_sets[i]);

  2030.     }

  2031.     av_freep(&mxf->partitions);

  2032.     av_freep(&mxf->metadata_sets);

  2033.     av_freep(&mxf->aesc);

  2034.     av_freep(&mxf->local_tags);

  2035. 

  2036.     for (i = 0; i < mxf->nb_index_tables; i++) {

  2037.         av_freep(&mxf->index_tables[i].segments);

  2038.         av_freep(&mxf->index_tables[i].ptses);

  2039.         av_freep(&mxf->index_tables[i].fake_index);

  2040.     }

  2041.     av_freep(&mxf->index_tables);

  2042. 

  2043.     return 0;

  2044. }

  2045. 

  2046. static int mxf_probe(AVProbeData *p) {

  2047.     uint8_t *bufp = p->buf;

  2048.     uint8_t *end = p->buf + p->buf_size;

  2049. 

  2050.     if (p->buf_size < sizeof(mxf_header_partition_pack_key))

  2051.         return 0;

  2052. 

  2053.     /* Must skip Run-In Sequence and search for MXF header partition pack key SMPTE 377M 5.5 */

  2054.     end -= sizeof(mxf_header_partition_pack_key);

  2055.     for (; bufp < end; bufp++) {

  2056.         if (IS_KLV_KEY(bufp, mxf_header_partition_pack_key))

  2057.             return AVPROBE_SCORE_MAX;

  2058.     }

  2059.     return 0;

  2060. }

  2061. 

  2062. /* rudimentary byte seek */

  2063. /* XXX: use MXF Index */

  2064. static int mxf_read_seek(AVFormatContext *s, int stream_index, int64_t sample_time, int flags)

  2065. {

  2066.     AVStream *st = s->streams[stream_index];

  2067.     int64_t seconds;

  2068.     MXFContext* mxf = s->priv_data;

  2069.     int64_t seekpos;

  2070.     int ret;

  2071.     MXFIndexTable *t;

  2072. 

  2073.     if (mxf->index_tables <= 0) {

  2074.     if (!s->bit_rate)

  2075.         return AVERROR_INVALIDDATA;

  2076.     if (sample_time < 0)

  2077.         sample_time = 0;

  2078.     seconds = av_rescale(sample_time, st->time_base.num, st->time_base.den);

  2079. 

  2080.     if ((ret = avio_seek(s->pb, (s->bit_rate * seconds) >> 3, SEEK_SET)) < 0)

  2081.         return ret;

  2082.     ff_update_cur_dts(s, st, sample_time);

  2083.     } else {

  2084.         t = &mxf->index_tables[0];

  2085. 

  2086.         /* clamp above zero, else ff_index_search_timestamp() returns negative

  2087.          * this also means we allow seeking before the start */

  2088.         sample_time = FFMAX(sample_time, 0);

  2089. 

  2090.         if (t->fake_index) {

  2091.             /* behave as if we have a proper index */

  2092.             if ((sample_time = ff_index_search_timestamp(t->fake_index, t->nb_ptses, sample_time, flags)) < 0)

  2093.                 return sample_time;

  2094.         } else {

  2095.             /* no IndexEntryArray (one or more CBR segments)

  2096.              * make sure we don't seek past the end */

  2097.             sample_time = FFMIN(sample_time, st->duration - 1);

  2098.         }

  2099. 

  2100.         if ((ret = mxf_edit_unit_absolute_offset(mxf, t, sample_time, &sample_time, &seekpos, 1)) << 0)

  2101.             return ret;

  2102. 

  2103.         ff_update_cur_dts(s, st, sample_time);

  2104.         mxf->current_edit_unit = sample_time;

  2105.         avio_seek(s->pb, seekpos, SEEK_SET);

  2106.     }

  2107.     return 0;

  2108. }

  2109. 

  2110. AVInputFormat ff_mxf_demuxer = {

  2111.     .name           = "mxf",

  2112.     .long_name      = NULL_IF_CONFIG_SMALL("Material eXchange Format"),

  2113.     .priv_data_size = sizeof(MXFContext),

  2114.     .read_probe     = mxf_probe,

  2115.     .read_header    = mxf_read_header,

  2116.     .read_packet    = mxf_read_packet,

  2117.     .read_close     = mxf_read_close,

  2118.     .read_seek      = mxf_read_seek,

  2119. };