SampleTable.cpp revision 583a012a9fce81162b163d3533e2644d4abad88a
14f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber/* 24f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber * Copyright (C) 2009 The Android Open Source Project 34f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber * 44f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber * Licensed under the Apache License, Version 2.0 (the "License"); 54f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber * you may not use this file except in compliance with the License. 64f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber * You may obtain a copy of the License at 74f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber * 84f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber * http://www.apache.org/licenses/LICENSE-2.0 94f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber * 104f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber * Unless required by applicable law or agreed to in writing, software 114f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber * distributed under the License is distributed on an "AS IS" BASIS, 124f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 134f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber * See the License for the specific language governing permissions and 144f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber * limitations under the License. 154f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber */ 164f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 174f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber#define LOG_TAG "SampleTable" 184f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber//#define LOG_NDEBUG 0 194f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber#include <utils/Log.h> 204f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 214f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber#include "include/SampleTable.h" 224f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber#include "include/SampleIterator.h" 234f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 244f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber#include <arpa/inet.h> 254f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 264f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber#include <media/stagefright/foundation/ADebug.h> 274f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber#include <media/stagefright/DataSource.h> 284f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber#include <media/stagefright/Utils.h> 294f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 304f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber/* TODO: remove after being merged into other branches */ 314f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber#ifndef UINT32_MAX 324f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber#define UINT32_MAX (4294967295U) 334f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber#endif 344f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 354f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Hubernamespace android { 364f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 374f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber// static 384f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huberconst uint32_t SampleTable::kChunkOffsetType32 = FOURCC('s', 't', 'c', 'o'); 394f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber// static 404f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huberconst uint32_t SampleTable::kChunkOffsetType64 = FOURCC('c', 'o', '6', '4'); 414f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber// static 424f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huberconst uint32_t SampleTable::kSampleSizeType32 = FOURCC('s', 't', 's', 'z'); 434f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber// static 444f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huberconst uint32_t SampleTable::kSampleSizeTypeCompact = FOURCC('s', 't', 'z', '2'); 454f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 464f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber//////////////////////////////////////////////////////////////////////////////// 474f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 484f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huberstruct SampleTable::CompositionDeltaLookup { 494f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber CompositionDeltaLookup(); 504f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 514f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber void setEntries( 524f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber const uint32_t *deltaEntries, size_t numDeltaEntries); 534f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 544f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber uint32_t getCompositionTimeOffset(uint32_t sampleIndex); 554f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 564f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huberprivate: 574f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber Mutex mLock; 584f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 594f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber const uint32_t *mDeltaEntries; 604f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber size_t mNumDeltaEntries; 614f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 624f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber size_t mCurrentDeltaEntry; 634f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber size_t mCurrentEntrySampleIndex; 644f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 654f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber DISALLOW_EVIL_CONSTRUCTORS(CompositionDeltaLookup); 664f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber}; 674f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 684f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas HuberSampleTable::CompositionDeltaLookup::CompositionDeltaLookup() 694f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber : mDeltaEntries(NULL), 704f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mNumDeltaEntries(0), 714f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mCurrentDeltaEntry(0), 724f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mCurrentEntrySampleIndex(0) { 734f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber} 744f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 754f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Hubervoid SampleTable::CompositionDeltaLookup::setEntries( 764f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber const uint32_t *deltaEntries, size_t numDeltaEntries) { 774f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber Mutex::Autolock autolock(mLock); 784f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 794f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mDeltaEntries = deltaEntries; 804f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mNumDeltaEntries = numDeltaEntries; 814f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mCurrentDeltaEntry = 0; 824f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mCurrentEntrySampleIndex = 0; 834f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber} 844f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 854f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huberuint32_t SampleTable::CompositionDeltaLookup::getCompositionTimeOffset( 864f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber uint32_t sampleIndex) { 874f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber Mutex::Autolock autolock(mLock); 884f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 894f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (mDeltaEntries == NULL) { 904f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return 0; 914f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 924f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 934f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (sampleIndex < mCurrentEntrySampleIndex) { 944f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mCurrentDeltaEntry = 0; 954f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mCurrentEntrySampleIndex = 0; 964f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 974f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 984f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber while (mCurrentDeltaEntry < mNumDeltaEntries) { 994f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber uint32_t sampleCount = mDeltaEntries[2 * mCurrentDeltaEntry]; 1004f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (sampleIndex < mCurrentEntrySampleIndex + sampleCount) { 1014f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return mDeltaEntries[2 * mCurrentDeltaEntry + 1]; 1024f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 1034f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1044f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mCurrentEntrySampleIndex += sampleCount; 1054f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber ++mCurrentDeltaEntry; 1064f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 1074f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1084f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return 0; 1094f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber} 1104f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1114f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber//////////////////////////////////////////////////////////////////////////////// 1124f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1134f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas HuberSampleTable::SampleTable(const sp<DataSource> &source) 1144f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber : mDataSource(source), 1154f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mChunkOffsetOffset(-1), 1164f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mChunkOffsetType(0), 1174f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mNumChunkOffsets(0), 1184f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleToChunkOffset(-1), 1194f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mNumSampleToChunkOffsets(0), 1204f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleSizeOffset(-1), 1214f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleSizeFieldSize(0), 1224f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mDefaultSampleSize(0), 1234f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mNumSampleSizes(0), 1244f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mHasTimeToSample(false), 1254f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mTimeToSampleCount(0), 1264f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mTimeToSample(NULL), 1274f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleTimeEntries(NULL), 1284f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mCompositionTimeDeltaEntries(NULL), 1294f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mNumCompositionTimeDeltaEntries(0), 1304f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mCompositionDeltaLookup(new CompositionDeltaLookup), 1314f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSyncSampleOffset(-1), 1324f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mNumSyncSamples(0), 1334f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSyncSamples(NULL), 1344f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mLastSyncSampleIndex(0), 1354f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleToChunkEntries(NULL), 1364f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mTotalSize(0) { 1374f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleIterator = new SampleIterator(this); 1384f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber} 1394f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1404f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas HuberSampleTable::~SampleTable() { 1414f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber delete[] mSampleToChunkEntries; 1424f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleToChunkEntries = NULL; 1434f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1444f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber delete[] mSyncSamples; 1454f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSyncSamples = NULL; 1464f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1474f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber delete[] mTimeToSample; 1484f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mTimeToSample = NULL; 1494f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1504f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber delete mCompositionDeltaLookup; 1514f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mCompositionDeltaLookup = NULL; 1524f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1534f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber delete[] mCompositionTimeDeltaEntries; 1544f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mCompositionTimeDeltaEntries = NULL; 1554f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1564f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber delete[] mSampleTimeEntries; 1574f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleTimeEntries = NULL; 1584f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1594f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber delete mSampleIterator; 1604f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleIterator = NULL; 1614f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber} 1624f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1634f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huberbool SampleTable::isValid() const { 1644f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return mChunkOffsetOffset >= 0 1654f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber && mSampleToChunkOffset >= 0 1664f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber && mSampleSizeOffset >= 0 1674f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber && mHasTimeToSample; 1684f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber} 1694f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1704f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huberstatus_t SampleTable::setChunkOffsetParams( 1714f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber uint32_t type, off64_t data_offset, size_t data_size) { 1724f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (mChunkOffsetOffset >= 0) { 1734f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 1744f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 1754f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1764f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber CHECK(type == kChunkOffsetType32 || type == kChunkOffsetType64); 1774f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1784f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mChunkOffsetOffset = data_offset; 1794f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mChunkOffsetType = type; 1804f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1814f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (data_size < 8) { 1824f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 1834f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 1844f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1854f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber uint8_t header[8]; 1864f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (mDataSource->readAt( 1874f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber data_offset, header, sizeof(header)) < (ssize_t)sizeof(header)) { 1884f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_IO; 1894f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 1904f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1914f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (U32_AT(header) != 0) { 1924f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber // Expected version = 0, flags = 0. 1934f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 1944f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 1954f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1964f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mNumChunkOffsets = U32_AT(&header[4]); 1974f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 1984f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (mChunkOffsetType == kChunkOffsetType32) { 1994f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (data_size < 8 + mNumChunkOffsets * 4) { 2004f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 2014f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2024f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } else { 2034f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (data_size < 8 + mNumChunkOffsets * 8) { 2044f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 2054f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2064f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2074f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2084f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return OK; 2094f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber} 2104f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2114f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huberstatus_t SampleTable::setSampleToChunkParams( 2124f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber off64_t data_offset, size_t data_size) { 2134f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (mSampleToChunkOffset >= 0) { 2144f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 2154f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2164f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2174f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleToChunkOffset = data_offset; 2184f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2194f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (data_size < 8) { 2204f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 2214f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2224f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2234f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber uint8_t header[8]; 2244f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (mDataSource->readAt( 2254f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber data_offset, header, sizeof(header)) < (ssize_t)sizeof(header)) { 2264f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_IO; 2274f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2284f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2294f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (U32_AT(header) != 0) { 2304f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber // Expected version = 0, flags = 0. 2314f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 2324f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2334f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2344f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mNumSampleToChunkOffsets = U32_AT(&header[4]); 2354f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2364f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (data_size < 8 + mNumSampleToChunkOffsets * 12) { 2374f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 2384f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2394f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2404f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if ((uint64_t)SIZE_MAX / sizeof(SampleToChunkEntry) <= 2414f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber (uint64_t)mNumSampleToChunkOffsets) { 2424f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber ALOGE("Sample-to-chunk table size too large."); 2434f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_OUT_OF_RANGE; 2444f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2454f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2464f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mTotalSize += (uint64_t)mNumSampleToChunkOffsets * 2474f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber sizeof(SampleToChunkEntry); 2484f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (mTotalSize > kMaxTotalSize) { 2494f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber ALOGE("Sample-to-chunk table size would make sample table too large.\n" 2504f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber " Requested sample-to-chunk table size = %llu\n" 2514f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber " Eventual sample table size >= %llu\n" 2524f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber " Allowed sample table size = %llu\n", 2534f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber (unsigned long long)mNumSampleToChunkOffsets * 2544f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber sizeof(SampleToChunkEntry), 2554f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber (unsigned long long)mTotalSize, 2564f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber (unsigned long long)kMaxTotalSize); 2574f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_OUT_OF_RANGE; 2584f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2594f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2604f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleToChunkEntries = 2614f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber new (std::nothrow) SampleToChunkEntry[mNumSampleToChunkOffsets]; 2624f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (!mSampleToChunkEntries) { 2634f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber ALOGE("Cannot allocate sample-to-chunk table with %llu entries.", 2644f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber (unsigned long long)mNumSampleToChunkOffsets); 2654f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_OUT_OF_RANGE; 2664f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2674f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2684f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (mNumSampleToChunkOffsets == 0) { 2694f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return OK; 2704f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2714f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2724f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if ((off64_t)(SIZE_MAX - 8 - 2734f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber ((mNumSampleToChunkOffsets - 1) * sizeof(SampleToChunkEntry))) 2744f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber < mSampleToChunkOffset) { 2754f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 2764f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2774f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2784f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber for (uint32_t i = 0; i < mNumSampleToChunkOffsets; ++i) { 2794f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber uint8_t buffer[12]; 2804f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (mDataSource->readAt( 2814f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleToChunkOffset + 8 + i * 12, buffer, sizeof(buffer)) 2824f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber != (ssize_t)sizeof(buffer)) { 2834f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_IO; 2844f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2854f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber // chunk index is 1 based in the spec. 2864f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (U32_AT(buffer) < 1) { 2874f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber ALOGE("b/23534160"); 2884f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_OUT_OF_RANGE; 2894f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2904f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2914f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber // We want the chunk index to be 0-based. 2924f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleToChunkEntries[i].startChunk = U32_AT(buffer) - 1; 2934f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleToChunkEntries[i].samplesPerChunk = U32_AT(&buffer[4]); 2944f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleToChunkEntries[i].chunkDesc = U32_AT(&buffer[8]); 2954f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 2964f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 2974f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return OK; 2984f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber} 2994f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 3004f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huberstatus_t SampleTable::setSampleSizeParams( 3014f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber uint32_t type, off64_t data_offset, size_t data_size) { 3024f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (mSampleSizeOffset >= 0) { 3034f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 3044f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 3054f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 3064f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber CHECK(type == kSampleSizeType32 || type == kSampleSizeTypeCompact); 3074f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 3084f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleSizeOffset = data_offset; 3094f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 3104f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (data_size < 12) { 3114f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 3124f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 3134f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 3144f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber uint8_t header[12]; 3154f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (mDataSource->readAt( 3164f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber data_offset, header, sizeof(header)) < (ssize_t)sizeof(header)) { 3174f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_IO; 3184f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 3194f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 3204f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (U32_AT(header) != 0) { 3214f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber // Expected version = 0, flags = 0. 3224f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 3234f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 3244f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 3254f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mDefaultSampleSize = U32_AT(&header[4]); 3264f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mNumSampleSizes = U32_AT(&header[8]); 3274f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (mNumSampleSizes > (UINT32_MAX - 12) / 16) { 3284f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber ALOGE("b/23247055, mNumSampleSizes(%u)", mNumSampleSizes); 3294f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 3304f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 3314f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 3324f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (type == kSampleSizeType32) { 3334f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleSizeFieldSize = 32; 3344f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 3354f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (mDefaultSampleSize != 0) { 3364f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return OK; 3374f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 3384f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 3394f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if (data_size < 12 + mNumSampleSizes * 4) { 3404f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 3414f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 3424f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } else { 3434f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber if ((mDefaultSampleSize & 0xffffff00) != 0) { 3444f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber // The high 24 bits are reserved and must be 0. 3454f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber return ERROR_MALFORMED; 3464f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber } 3474f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 3484f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mSampleSizeFieldSize = mDefaultSampleSize & 0xff; 3494f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber mDefaultSampleSize = 0; 3504f1efc098cb5791c3e9f483f2af84aef70d2d0a0Andreas Huber 351 if (mSampleSizeFieldSize != 4 && mSampleSizeFieldSize != 8 352 && mSampleSizeFieldSize != 16) { 353 return ERROR_MALFORMED; 354 } 355 356 if (data_size < 12 + (mNumSampleSizes * mSampleSizeFieldSize + 4) / 8) { 357 return ERROR_MALFORMED; 358 } 359 } 360 361 return OK; 362} 363 364status_t SampleTable::setTimeToSampleParams( 365 off64_t data_offset, size_t data_size) { 366 if (mHasTimeToSample || data_size < 8) { 367 return ERROR_MALFORMED; 368 } 369 370 uint8_t header[8]; 371 if (mDataSource->readAt( 372 data_offset, header, sizeof(header)) < (ssize_t)sizeof(header)) { 373 return ERROR_IO; 374 } 375 376 if (U32_AT(header) != 0) { 377 // Expected version = 0, flags = 0. 378 return ERROR_MALFORMED; 379 } 380 381 mTimeToSampleCount = U32_AT(&header[4]); 382 if ((uint64_t)mTimeToSampleCount > 383 (uint64_t)UINT32_MAX / (2 * sizeof(uint32_t))) { 384 // Choose this bound because 385 // 1) 2 * sizeof(uint32_t) is the amount of memory needed for one 386 // time-to-sample entry in the time-to-sample table. 387 // 2) mTimeToSampleCount is the number of entries of the time-to-sample 388 // table. 389 // 3) We hope that the table size does not exceed UINT32_MAX. 390 ALOGE("Time-to-sample table size too large."); 391 return ERROR_OUT_OF_RANGE; 392 } 393 394 // Note: At this point, we know that mTimeToSampleCount * 2 will not 395 // overflow because of the above condition. 396 397 uint64_t allocSize = (uint64_t)mTimeToSampleCount * 2 * sizeof(uint32_t); 398 mTotalSize += allocSize; 399 if (mTotalSize > kMaxTotalSize) { 400 ALOGE("Time-to-sample table size would make sample table too large.\n" 401 " Requested time-to-sample table size = %llu\n" 402 " Eventual sample table size >= %llu\n" 403 " Allowed sample table size = %llu\n", 404 (unsigned long long)allocSize, 405 (unsigned long long)mTotalSize, 406 (unsigned long long)kMaxTotalSize); 407 return ERROR_OUT_OF_RANGE; 408 } 409 410 mTimeToSample = new (std::nothrow) uint32_t[mTimeToSampleCount * 2]; 411 if (!mTimeToSample) { 412 ALOGE("Cannot allocate time-to-sample table with %llu entries.", 413 (unsigned long long)mTimeToSampleCount); 414 return ERROR_OUT_OF_RANGE; 415 } 416 417 if (mDataSource->readAt(data_offset + 8, mTimeToSample, 418 (size_t)allocSize) < (ssize_t)allocSize) { 419 ALOGE("Incomplete data read for time-to-sample table."); 420 return ERROR_IO; 421 } 422 423 for (size_t i = 0; i < mTimeToSampleCount * 2; ++i) { 424 mTimeToSample[i] = ntohl(mTimeToSample[i]); 425 } 426 427 mHasTimeToSample = true; 428 return OK; 429} 430 431status_t SampleTable::setCompositionTimeToSampleParams( 432 off64_t data_offset, size_t data_size) { 433 ALOGI("There are reordered frames present."); 434 435 if (mCompositionTimeDeltaEntries != NULL || data_size < 8) { 436 return ERROR_MALFORMED; 437 } 438 439 uint8_t header[8]; 440 if (mDataSource->readAt( 441 data_offset, header, sizeof(header)) 442 < (ssize_t)sizeof(header)) { 443 return ERROR_IO; 444 } 445 446 if (U32_AT(header) != 0) { 447 // Expected version = 0, flags = 0. 448 return ERROR_MALFORMED; 449 } 450 451 size_t numEntries = U32_AT(&header[4]); 452 453 if (data_size != (numEntries + 1) * 8) { 454 return ERROR_MALFORMED; 455 } 456 457 mNumCompositionTimeDeltaEntries = numEntries; 458 uint64_t allocSize = (uint64_t)numEntries * 2 * sizeof(uint32_t); 459 if (allocSize > SIZE_MAX) { 460 ALOGE("Composition-time-to-sample table size too large."); 461 return ERROR_OUT_OF_RANGE; 462 } 463 464 mTotalSize += allocSize; 465 if (mTotalSize > kMaxTotalSize) { 466 ALOGE("Composition-time-to-sample table would make sample table too large.\n" 467 " Requested composition-time-to-sample table size = %llu\n" 468 " Eventual sample table size >= %llu\n" 469 " Allowed sample table size = %llu\n", 470 (unsigned long long)allocSize, 471 (unsigned long long)mTotalSize, 472 (unsigned long long)kMaxTotalSize); 473 return ERROR_OUT_OF_RANGE; 474 } 475 476 mCompositionTimeDeltaEntries = new (std::nothrow) uint32_t[2 * numEntries]; 477 if (!mCompositionTimeDeltaEntries) { 478 ALOGE("Cannot allocate composition-time-to-sample table with %llu " 479 "entries.", (unsigned long long)numEntries); 480 return ERROR_OUT_OF_RANGE; 481 } 482 483 if (mDataSource->readAt(data_offset + 8, mCompositionTimeDeltaEntries, 484 (size_t)allocSize) < (ssize_t)allocSize) { 485 delete[] mCompositionTimeDeltaEntries; 486 mCompositionTimeDeltaEntries = NULL; 487 488 return ERROR_IO; 489 } 490 491 for (size_t i = 0; i < 2 * numEntries; ++i) { 492 mCompositionTimeDeltaEntries[i] = ntohl(mCompositionTimeDeltaEntries[i]); 493 } 494 495 mCompositionDeltaLookup->setEntries( 496 mCompositionTimeDeltaEntries, mNumCompositionTimeDeltaEntries); 497 498 return OK; 499} 500 501status_t SampleTable::setSyncSampleParams(off64_t data_offset, size_t data_size) { 502 if (mSyncSampleOffset >= 0 || data_size < 8) { 503 return ERROR_MALFORMED; 504 } 505 506 mSyncSampleOffset = data_offset; 507 508 uint8_t header[8]; 509 if (mDataSource->readAt( 510 data_offset, header, sizeof(header)) < (ssize_t)sizeof(header)) { 511 return ERROR_IO; 512 } 513 514 if (U32_AT(header) != 0) { 515 // Expected version = 0, flags = 0. 516 return ERROR_MALFORMED; 517 } 518 519 mNumSyncSamples = U32_AT(&header[4]); 520 521 if (mNumSyncSamples < 2) { 522 ALOGV("Table of sync samples is empty or has only a single entry!"); 523 } 524 525 uint64_t allocSize = (uint64_t)mNumSyncSamples * sizeof(uint32_t); 526 if (allocSize > SIZE_MAX) { 527 ALOGE("Sync sample table size too large."); 528 return ERROR_OUT_OF_RANGE; 529 } 530 531 mTotalSize += allocSize; 532 if (mTotalSize > kMaxTotalSize) { 533 ALOGE("Sync sample table size would make sample table too large.\n" 534 " Requested sync sample table size = %llu\n" 535 " Eventual sample table size >= %llu\n" 536 " Allowed sample table size = %llu\n", 537 (unsigned long long)allocSize, 538 (unsigned long long)mTotalSize, 539 (unsigned long long)kMaxTotalSize); 540 return ERROR_OUT_OF_RANGE; 541 } 542 543 mSyncSamples = new (std::nothrow) uint32_t[mNumSyncSamples]; 544 if (!mSyncSamples) { 545 ALOGE("Cannot allocate sync sample table with %llu entries.", 546 (unsigned long long)mNumSyncSamples); 547 return ERROR_OUT_OF_RANGE; 548 } 549 550 if (mDataSource->readAt(mSyncSampleOffset + 8, mSyncSamples, 551 (size_t)allocSize) != (ssize_t)allocSize) { 552 return ERROR_IO; 553 } 554 555 for (size_t i = 0; i < mNumSyncSamples; ++i) { 556 mSyncSamples[i] = ntohl(mSyncSamples[i]) - 1; 557 } 558 559 return OK; 560} 561 562uint32_t SampleTable::countChunkOffsets() const { 563 return mNumChunkOffsets; 564} 565 566uint32_t SampleTable::countSamples() const { 567 return mNumSampleSizes; 568} 569 570status_t SampleTable::getMaxSampleSize(size_t *max_size) { 571 Mutex::Autolock autoLock(mLock); 572 573 *max_size = 0; 574 575 for (uint32_t i = 0; i < mNumSampleSizes; ++i) { 576 size_t sample_size; 577 status_t err = getSampleSize_l(i, &sample_size); 578 579 if (err != OK) { 580 return err; 581 } 582 583 if (sample_size > *max_size) { 584 *max_size = sample_size; 585 } 586 } 587 588 return OK; 589} 590 591uint32_t abs_difference(uint32_t time1, uint32_t time2) { 592 return time1 > time2 ? time1 - time2 : time2 - time1; 593} 594 595// static 596int SampleTable::CompareIncreasingTime(const void *_a, const void *_b) { 597 const SampleTimeEntry *a = (const SampleTimeEntry *)_a; 598 const SampleTimeEntry *b = (const SampleTimeEntry *)_b; 599 600 if (a->mCompositionTime < b->mCompositionTime) { 601 return -1; 602 } else if (a->mCompositionTime > b->mCompositionTime) { 603 return 1; 604 } 605 606 return 0; 607} 608 609void SampleTable::buildSampleEntriesTable() { 610 Mutex::Autolock autoLock(mLock); 611 612 if (mSampleTimeEntries != NULL || mNumSampleSizes == 0) { 613 if (mNumSampleSizes == 0) { 614 ALOGE("b/23247055, mNumSampleSizes(%u)", mNumSampleSizes); 615 } 616 return; 617 } 618 619 mTotalSize += (uint64_t)mNumSampleSizes * sizeof(SampleTimeEntry); 620 if (mTotalSize > kMaxTotalSize) { 621 ALOGE("Sample entry table size would make sample table too large.\n" 622 " Requested sample entry table size = %llu\n" 623 " Eventual sample table size >= %llu\n" 624 " Allowed sample table size = %llu\n", 625 (unsigned long long)mNumSampleSizes * sizeof(SampleTimeEntry), 626 (unsigned long long)mTotalSize, 627 (unsigned long long)kMaxTotalSize); 628 return; 629 } 630 631 mSampleTimeEntries = new (std::nothrow) SampleTimeEntry[mNumSampleSizes]; 632 if (!mSampleTimeEntries) { 633 ALOGE("Cannot allocate sample entry table with %llu entries.", 634 (unsigned long long)mNumSampleSizes); 635 return; 636 } 637 638 uint32_t sampleIndex = 0; 639 uint32_t sampleTime = 0; 640 641 for (uint32_t i = 0; i < mTimeToSampleCount; ++i) { 642 uint32_t n = mTimeToSample[2 * i]; 643 uint32_t delta = mTimeToSample[2 * i + 1]; 644 645 for (uint32_t j = 0; j < n; ++j) { 646 if (sampleIndex < mNumSampleSizes) { 647 // Technically this should always be the case if the file 648 // is well-formed, but you know... there's (gasp) malformed 649 // content out there. 650 651 mSampleTimeEntries[sampleIndex].mSampleIndex = sampleIndex; 652 653 uint32_t compTimeDelta = 654 mCompositionDeltaLookup->getCompositionTimeOffset( 655 sampleIndex); 656 657 mSampleTimeEntries[sampleIndex].mCompositionTime = 658 sampleTime + compTimeDelta; 659 } 660 661 ++sampleIndex; 662 sampleTime += delta; 663 } 664 } 665 666 qsort(mSampleTimeEntries, mNumSampleSizes, sizeof(SampleTimeEntry), 667 CompareIncreasingTime); 668} 669 670status_t SampleTable::findSampleAtTime( 671 uint32_t req_time, uint32_t *sample_index, uint32_t flags) { 672 buildSampleEntriesTable(); 673 674 if (mSampleTimeEntries == NULL) { 675 return ERROR_OUT_OF_RANGE; 676 } 677 678 uint32_t left = 0; 679 uint32_t right = mNumSampleSizes; 680 while (left < right) { 681 uint32_t center = (left + right) / 2; 682 uint32_t centerTime = mSampleTimeEntries[center].mCompositionTime; 683 684 if (req_time < centerTime) { 685 right = center; 686 } else if (req_time > centerTime) { 687 left = center + 1; 688 } else { 689 left = center; 690 break; 691 } 692 } 693 694 if (left == mNumSampleSizes) { 695 if (flags == kFlagAfter) { 696 return ERROR_OUT_OF_RANGE; 697 } 698 699 --left; 700 } 701 702 uint32_t closestIndex = left; 703 704 switch (flags) { 705 case kFlagBefore: 706 { 707 while (closestIndex > 0 708 && mSampleTimeEntries[closestIndex].mCompositionTime 709 > req_time) { 710 --closestIndex; 711 } 712 break; 713 } 714 715 case kFlagAfter: 716 { 717 while (closestIndex + 1 < mNumSampleSizes 718 && mSampleTimeEntries[closestIndex].mCompositionTime 719 < req_time) { 720 ++closestIndex; 721 } 722 break; 723 } 724 725 default: 726 { 727 CHECK(flags == kFlagClosest); 728 729 if (closestIndex > 0) { 730 // Check left neighbour and pick closest. 731 uint32_t absdiff1 = 732 abs_difference( 733 mSampleTimeEntries[closestIndex].mCompositionTime, 734 req_time); 735 736 uint32_t absdiff2 = 737 abs_difference( 738 mSampleTimeEntries[closestIndex - 1].mCompositionTime, 739 req_time); 740 741 if (absdiff1 > absdiff2) { 742 closestIndex = closestIndex - 1; 743 } 744 } 745 746 break; 747 } 748 } 749 750 *sample_index = mSampleTimeEntries[closestIndex].mSampleIndex; 751 752 return OK; 753} 754 755status_t SampleTable::findSyncSampleNear( 756 uint32_t start_sample_index, uint32_t *sample_index, uint32_t flags) { 757 Mutex::Autolock autoLock(mLock); 758 759 *sample_index = 0; 760 761 if (mSyncSampleOffset < 0) { 762 // All samples are sync-samples. 763 *sample_index = start_sample_index; 764 return OK; 765 } 766 767 if (mNumSyncSamples == 0) { 768 *sample_index = 0; 769 return OK; 770 } 771 772 uint32_t left = 0; 773 uint32_t right = mNumSyncSamples; 774 while (left < right) { 775 uint32_t center = left + (right - left) / 2; 776 uint32_t x = mSyncSamples[center]; 777 778 if (start_sample_index < x) { 779 right = center; 780 } else if (start_sample_index > x) { 781 left = center + 1; 782 } else { 783 left = center; 784 break; 785 } 786 } 787 if (left == mNumSyncSamples) { 788 if (flags == kFlagAfter) { 789 ALOGE("tried to find a sync frame after the last one: %d", left); 790 return ERROR_OUT_OF_RANGE; 791 } 792 left = left - 1; 793 } 794 795 // Now ssi[left] is the sync sample index just before (or at) 796 // start_sample_index. 797 // Also start_sample_index < ssi[left + 1], if left + 1 < mNumSyncSamples. 798 799 uint32_t x = mSyncSamples[left]; 800 801 if (left + 1 < mNumSyncSamples) { 802 uint32_t y = mSyncSamples[left + 1]; 803 804 // our sample lies between sync samples x and y. 805 806 status_t err = mSampleIterator->seekTo(start_sample_index); 807 if (err != OK) { 808 return err; 809 } 810 811 uint32_t sample_time = mSampleIterator->getSampleTime(); 812 813 err = mSampleIterator->seekTo(x); 814 if (err != OK) { 815 return err; 816 } 817 uint32_t x_time = mSampleIterator->getSampleTime(); 818 819 err = mSampleIterator->seekTo(y); 820 if (err != OK) { 821 return err; 822 } 823 824 uint32_t y_time = mSampleIterator->getSampleTime(); 825 826 if (abs_difference(x_time, sample_time) 827 > abs_difference(y_time, sample_time)) { 828 // Pick the sync sample closest (timewise) to the start-sample. 829 x = y; 830 ++left; 831 } 832 } 833 834 switch (flags) { 835 case kFlagBefore: 836 { 837 if (x > start_sample_index) { 838 CHECK(left > 0); 839 840 x = mSyncSamples[left - 1]; 841 842 if (x > start_sample_index) { 843 // The table of sync sample indices was not sorted 844 // properly. 845 return ERROR_MALFORMED; 846 } 847 } 848 break; 849 } 850 851 case kFlagAfter: 852 { 853 if (x < start_sample_index) { 854 if (left + 1 >= mNumSyncSamples) { 855 return ERROR_OUT_OF_RANGE; 856 } 857 858 x = mSyncSamples[left + 1]; 859 860 if (x < start_sample_index) { 861 // The table of sync sample indices was not sorted 862 // properly. 863 return ERROR_MALFORMED; 864 } 865 } 866 867 break; 868 } 869 870 default: 871 break; 872 } 873 874 *sample_index = x; 875 876 return OK; 877} 878 879status_t SampleTable::findThumbnailSample(uint32_t *sample_index) { 880 Mutex::Autolock autoLock(mLock); 881 882 if (mSyncSampleOffset < 0) { 883 // All samples are sync-samples. 884 *sample_index = 0; 885 return OK; 886 } 887 888 uint32_t bestSampleIndex = 0; 889 size_t maxSampleSize = 0; 890 891 static const size_t kMaxNumSyncSamplesToScan = 20; 892 893 // Consider the first kMaxNumSyncSamplesToScan sync samples and 894 // pick the one with the largest (compressed) size as the thumbnail. 895 896 size_t numSamplesToScan = mNumSyncSamples; 897 if (numSamplesToScan > kMaxNumSyncSamplesToScan) { 898 numSamplesToScan = kMaxNumSyncSamplesToScan; 899 } 900 901 for (size_t i = 0; i < numSamplesToScan; ++i) { 902 uint32_t x = mSyncSamples[i]; 903 904 // Now x is a sample index. 905 size_t sampleSize; 906 status_t err = getSampleSize_l(x, &sampleSize); 907 if (err != OK) { 908 return err; 909 } 910 911 if (i == 0 || sampleSize > maxSampleSize) { 912 bestSampleIndex = x; 913 maxSampleSize = sampleSize; 914 } 915 } 916 917 *sample_index = bestSampleIndex; 918 919 return OK; 920} 921 922status_t SampleTable::getSampleSize_l( 923 uint32_t sampleIndex, size_t *sampleSize) { 924 return mSampleIterator->getSampleSizeDirect( 925 sampleIndex, sampleSize); 926} 927 928status_t SampleTable::getMetaDataForSample( 929 uint32_t sampleIndex, 930 off64_t *offset, 931 size_t *size, 932 uint32_t *compositionTime, 933 bool *isSyncSample) { 934 Mutex::Autolock autoLock(mLock); 935 936 status_t err; 937 if ((err = mSampleIterator->seekTo(sampleIndex)) != OK) { 938 return err; 939 } 940 941 if (offset) { 942 *offset = mSampleIterator->getSampleOffset(); 943 } 944 945 if (size) { 946 *size = mSampleIterator->getSampleSize(); 947 } 948 949 if (compositionTime) { 950 *compositionTime = mSampleIterator->getSampleTime(); 951 } 952 953 if (isSyncSample) { 954 *isSyncSample = false; 955 if (mSyncSampleOffset < 0) { 956 // Every sample is a sync sample. 957 *isSyncSample = true; 958 } else { 959 size_t i = (mLastSyncSampleIndex < mNumSyncSamples) 960 && (mSyncSamples[mLastSyncSampleIndex] <= sampleIndex) 961 ? mLastSyncSampleIndex : 0; 962 963 while (i < mNumSyncSamples && mSyncSamples[i] < sampleIndex) { 964 ++i; 965 } 966 967 if (i < mNumSyncSamples && mSyncSamples[i] == sampleIndex) { 968 *isSyncSample = true; 969 } 970 971 mLastSyncSampleIndex = i; 972 } 973 } 974 975 return OK; 976} 977 978uint32_t SampleTable::getCompositionTimeOffset(uint32_t sampleIndex) { 979 return mCompositionDeltaLookup->getCompositionTimeOffset(sampleIndex); 980} 981 982} // namespace android 983 984