status_t SampleTable::findSampleAtTime( uint64_t req_time, uint64_t scale_num, uint64_t scale_den, uint32_t *sample_index, uint32_t flags) { buildSampleEntriesTable(); if (mSampleTimeEntries == NULL) { return ERROR_OUT_OF_RANGE; } uint32_t left = 0; uint32_t right_plus_one = mNumSampleSizes; while (left < right_plus_one) { uint32_t center = left + (right_plus_one - left) / 2; uint64_t centerTime = getSampleTime(center, scale_num, scale_den); if (req_time < centerTime) { right_plus_one = center; } else if (req_time > centerTime) { left = center + 1; } else { *sample_index = mSampleTimeEntries[center].mSampleIndex; return OK; } } uint32_t closestIndex = left; if (closestIndex == mNumSampleSizes) { if (flags == kFlagAfter) { return ERROR_OUT_OF_RANGE; } flags = kFlagBefore; } else if (closestIndex == 0) { if (flags == kFlagBefore) { // normally we should return out of range, but that is // treated as end-of-stream. instead return first sample // // return ERROR_OUT_OF_RANGE; } flags = kFlagAfter; } switch (flags) { case kFlagBefore: { --closestIndex; break; } case kFlagAfter: { // nothing to do break; } default: { CHECK(flags == kFlagClosest); // pick closest based on timestamp. use abs_difference for safety if (abs_difference( getSampleTime(closestIndex, scale_num, scale_den), req_time) > abs_difference( req_time, getSampleTime(closestIndex - 1, scale_num, scale_den))) { --closestIndex; } break; } } *sample_index = mSampleTimeEntries[closestIndex].mSampleIndex; return OK; }
status_t SampleTable::findSampleAtTime( uint32_t req_time, uint32_t *sample_index, uint32_t flags) { buildSampleEntriesTable(); uint32_t left = 0; uint32_t right = mNumSampleSizes; while (left < right) { uint32_t center = (left + right) / 2; uint32_t centerTime = mSampleTimeEntries[center].mCompositionTime; if (req_time < centerTime) { right = center; } else if (req_time > centerTime) { left = center + 1; } else { left = center; break; } } if (left == mNumSampleSizes) { if (flags == kFlagAfter) { return ERROR_OUT_OF_RANGE; } --left; } uint32_t closestIndex = left; switch (flags) { case kFlagBefore: { while (closestIndex > 0 && mSampleTimeEntries[closestIndex].mCompositionTime > req_time) { --closestIndex; } break; } case kFlagAfter: { while (closestIndex + 1 < mNumSampleSizes && mSampleTimeEntries[closestIndex].mCompositionTime < req_time) { ++closestIndex; } break; } default: { CHECK(flags == kFlagClosest); if (closestIndex > 0) { // Check left neighbour and pick closest. uint32_t absdiff1 = abs_difference( mSampleTimeEntries[closestIndex].mCompositionTime, req_time); uint32_t absdiff2 = abs_difference( mSampleTimeEntries[closestIndex - 1].mCompositionTime, req_time); if (absdiff1 > absdiff2) { closestIndex = closestIndex - 1; } } break; } } *sample_index = mSampleTimeEntries[closestIndex].mSampleIndex; return OK; }