|| || || || || ||

---

PopulateMpegIndexBase

void Impala::Core::Stream::RgbDataSrcLavc_old::PopulateMpegIndexBase (  )  [inline, private] Definition at line 688 of file RgbDataSrcLavc_old.h. References ILOG_DEBUG, ILOG_ERROR, and Impala::Core::Array::MD5Hash(). { AVIndexEntry *idx = mVideoStream->index_entries; typedef Column::FixedStringColumn::ColElemType FixedString; // frame nr | key frame nr | hash typedef Table::TableTem< Column::ColumnTem<Int32>, Column::ColumnTem<Int32>, Column::FixedStringColumn > FrameTable; // frame nr | seek position | recurrence | hash typedef Table::TableTem< Column::ColumnTem<Int32>, Column::ColumnTem<Real64>, Column::ColumnTem<Int32>, Column::FixedStringColumn > KeyFrameTable; // seek position (unique) typedef Table::TableTem< Column::ColumnTem<Real64> > SeekPositionTable; static const int HASH_SIZE = 32; FrameTable frameTable(Column::ColumnTem<Int32>(1000), Column::ColumnTem<Int32>(1000), Column::FixedStringColumn(HASH_SIZE, 1000)); KeyFrameTable keyFrameTable(Column::ColumnTem<Int32>(1000), Column::ColumnTem<Real64>(1000), Column::ColumnTem<Int32>(1000), Column::FixedStringColumn(HASH_SIZE, 1000)); SeekPositionTable seekPosTable(Column::ColumnTem<Real64>(1000)); // list frames, key frames and candidate seek positions; // note that values of mCurrentFrameNr and mBufferedFrameNr follow from the search for leading bad frames ("blank frames") int64_t startPosOfBuffer = 0; int64_t lastEndPosOfBuffer = 0; String prevHash = ""; int lastKeyFrameNr = -1; while (mCurrentFrameNr < mLastFrame) //while (mCurrentFrameNr < 500) { #ifdef FFMPEG_52 const int64_t& actualEndPosOfBuffer = mFormatCtx->pb->pos; #else const int64_t& actualEndPosOfBuffer = mFormatCtx->pb.pos; #endif if (actualEndPosOfBuffer < lastEndPosOfBuffer) { ILOG_ERROR("Unexpected buffer position change (from " << lastEndPosOfBuffer << " to " << actualEndPosOfBuffer << ")"); return; } const bool bufferAdvanced = (actualEndPosOfBuffer > lastEndPosOfBuffer); if (bufferAdvanced) { startPosOfBuffer = lastEndPosOfBuffer; lastEndPosOfBuffer = actualEndPosOfBuffer; seekPosTable.Add(startPosOfBuffer); } // did reading a frame result in a valid frame? if (mCurrentFrameNr > mBufferedFrameNr) { MarkBadFrame(mCurrentFrameNr); ILOG_DEBUG("Found a bad frame where mCurrentFrameNr = " << mCurrentFrameNr << " (and mBufferedFrameNr = " << mBufferedFrameNr << ")"); } else { const String hash = CalcHash(); const FixedString hashAsFixedStr(HASH_SIZE, (char*) hash.c_str(), false); if (mFrame->pict_type == FF_I_TYPE) // I-frames only { int recurrence = 1; if (hash == prevHash) // (adjacent) duplicate frames/hashes { recurrence = 1 + keyFrameTable.Get3(keyFrameTable.Size() - 1); //keyFrameTable.Set3(keyFrameTable.Size() - 1, recurrence + 1); } else { prevHash = hash; } const Int64 position = 0; keyFrameTable.Add(mCurrentFrameNr, position, recurrence, hashAsFixedStr); lastKeyFrameNr = mCurrentFrameNr; } else if (mFrame->pict_type != FF_P_TYPE && mFrame->pict_type != FF_B_TYPE) { ILOG_ERROR("Unexpected picture type: " << mFrame->pict_type); return; } frameTable.Add(mCurrentFrameNr, lastKeyFrameNr, hashAsFixedStr); ILOG_DEBUG("Added frame to frame table: " << mCurrentFrameNr << " : " << lastKeyFrameNr << " : " << hashAsFixedStr); } NextFrame(); } keyFrameTable.Dump(0, 25); // match candidate jump positions to key frames: int keyFrameTableIndexMin = 0; int64_t topSafeSeekPos = 0; for (int seekPosTableIndex = 0; seekPosTableIndex < seekPosTable.Size(); seekPosTableIndex++) { const int64_t seekPos = seekPosTable.Get1(seekPosTableIndex); // reset (without using the index) const int posZero = 0; const int flush = 2; const int no_sync = 1; const int sync = 2; Jump(posZero, mJumpFlags, flush, (seekPos == posZero) ? sync : no_sync); ILOG_DEBUG("Jumped to head of file for seekPosTableIndex " << seekPosTableIndex); if (seekPos != posZero) Jump(seekPos, mJumpFlags, flush, sync); ILOG_DEBUG("Jumped to seekPos " << seekPos); Array2dVec3UInt8* arr = new Array2dVec3UInt8(FrameWidth(), FrameHeight(), 0, 0, mData, true, false); const String hashOfKeyFrameJumpedTo = Array::MD5Hash(arr); delete arr; int k = keyFrameTableIndexMin; for (; k < keyFrameTable.Size(); k++) { const String hash(keyFrameTable.Get4(k).GetData(), HASH_SIZE); if (hash == hashOfKeyFrameJumpedTo) { ILOG_DEBUG("Key frame " << k << " matches hash of first key frame found"); break; } keyFrameTable.Set2(k, topSafeSeekPos); keyFrameTableIndexMin++; } if (k >= keyFrameTable.Size()) { ILOG_DEBUG("At end of key frame table; no matching key frame for seek pos jumped to"); break; // ready } // A: how many remaining, consecutive key frame entries have this hash as well (and so are identical images)? int recurrence = 0; k = keyFrameTableIndexMin + 1; for (; k < keyFrameTable.Size(); k++) { const String hash(keyFrameTable.Get4(k).GetData(), HASH_SIZE); if (hash != hashOfKeyFrameJumpedTo) break; recurrence++; } // B: how many key frames can be read with this hash? mCurrentFrameNr = mBlankFrames; // mCurrentFrame is used by CalcHash_protected to check if current frame is valid int distanceToDifferentHash = 1; // in number of keyframes bool foundNextKeyFrame = false; while (true) { foundNextKeyFrame = FindNextDecodedFrame(true); if (!foundNextKeyFrame) break; const String hash = CalcHash(); if (hash != hashOfKeyFrameJumpedTo) // what if at eof? break; //for (int f = keyFrameTableIndexMin; f < keyFrameTable.Size(); f++) // if (keyFrameTable.Get1(f) == // shit; wat distanceToDifferentHash++; } // now resolve using A and B! int keyFramesWithOldSafePos = 0; if (distanceToDifferentHash <= recurrence) { keyFramesWithOldSafePos = (1 + recurrence) - distanceToDifferentHash; for (int kk = 0; kk < keyFramesWithOldSafePos; kk++) { keyFrameTable.Set2(keyFrameTableIndexMin, topSafeSeekPos); keyFrameTableIndexMin++; } } keyFrameTable.Set2(keyFrameTableIndexMin, seekPos); topSafeSeekPos = seekPos; if (!foundNextKeyFrame) { break; // assumed this only occurs at eof } } // frameTable aanpassen zodat alleen gewezen wordt naar key frames met een seek position int64_t lastProperSeekPos = -1; int frameIndex = 0; int keyFrameIndex = 0; int nextProperKeyFrameIndex = 0; while (keyFrameIndex < keyFrameTable.Size()) { int seekFrameNr = keyFrameTable.Get1(keyFrameIndex); lastProperSeekPos = keyFrameTable.Get2(keyFrameIndex); nextProperKeyFrameIndex = keyFrameIndex; while (nextProperKeyFrameIndex < keyFrameTable.Size() && keyFrameTable.Get2(nextProperKeyFrameIndex) == lastProperSeekPos) nextProperKeyFrameIndex++; int nextProperSeekFrame = 1000000; if (nextProperKeyFrameIndex < keyFrameTable.Size()) { nextProperSeekFrame = keyFrameTable.Get1(nextProperKeyFrameIndex); } while (frameIndex < frameTable.Size() && frameTable.Get2(frameIndex) < nextProperSeekFrame) { frameTable.Set2(frameIndex, seekFrameNr); frameIndex++; } keyFrameIndex = nextProperKeyFrameIndex; } // Add results to the index keyFrameIndex = 0; for (int i = 0; i < frameTable.Size(); i++) { const int frameNr = frameTable.Get1(i); const int keyFrameNr = frameTable.Get2(i); const String hash(frameTable.Get3(i).GetData(), HASH_SIZE); while (keyFrameTable.Get1(keyFrameIndex) < keyFrameNr) keyFrameIndex++; const int64_t seekPos = keyFrameTable.Get2(keyFrameIndex); ILOG_DEBUG("AddIndex(" << frameNr << ", " << keyFrameNr << ", " << seekPos << ", " << hash << ")"); AddIndex(frameNr, keyFrameNr, seekPos, hash); } } Here is the call graph for this function:

---