| 340 | } |
| 341 | |
| 342 | void FFMS_Track::FinalizeTrack() { |
| 343 | frame_vec &Frames = Data->Frames; |
| 344 | // With some formats (such as Vorbis) a bad final packet results in a |
| 345 | // frame with PTS 0, which we don't want to sort to the beginning |
| 346 | if (size() > 2 && front().PTS >= back().PTS) |
| 347 | Frames.pop_back(); |
| 348 | |
| 349 | if (TT != FFMS_TYPE_VIDEO) |
| 350 | return; |
| 351 | |
| 352 | for (size_t i = 0; i < size(); i++) { |
| 353 | Frames[i].PosInDecodingOrder = i; |
| 354 | Frames[i].OriginalPTS = Frames[i].PTS; |
| 355 | } |
| 356 | |
| 357 | MaybeReorderFrames(); |
| 358 | |
| 359 | if (size() > 2 && HasDiscontTS) { |
| 360 | std::vector<size_t> secs = { 0 }; |
| 361 | |
| 362 | auto lastPTS = Frames[0].PTS; |
| 363 | const auto thresh = std::abs(Frames[1].PTS - Frames[0].PTS) * 16; // A bad approximation of 16 frames, the max reorder buffer size. |
| 364 | for (size_t i = 0; i < size(); i++) { |
| 365 | if (Frames[i].PTS < lastPTS && (lastPTS - Frames[i].PTS) > thresh && i + 1 < size()) { |
| 366 | secs.push_back(i); |
| 367 | i++; // Sections must be at least 2 frames long. |
| 368 | } |
| 369 | lastPTS = Frames[i].PTS; |
| 370 | } |
| 371 | |
| 372 | // We need to sort each distinct sections by PTS to account for any reordering. |
| 373 | for (size_t i = 0; i < secs.size() - 1; i++) |
| 374 | sort(Frames.begin() + secs[i], Frames.begin() + secs[i + 1], PTSComparison); |
| 375 | sort(Frames.begin() + secs.back(), Frames.end(), PTSComparison); |
| 376 | |
| 377 | // Try and make up some sane timestamps based on previous sections, while |
| 378 | // keeping the same frame durations. |
| 379 | for (size_t i = 1; i < secs.size(); i++) { |
| 380 | const auto shift = -(Frames[secs[i]].PTS) + (Frames[secs[i] + 1].PTS - Frames[secs[i]].PTS) + Frames[secs[i] - 1].PTS; |
| 381 | size_t end; |
| 382 | if (i == secs.size() - 1) |
| 383 | end = Frames.size(); |
| 384 | else |
| 385 | end = secs[i + 1]; |
| 386 | for (size_t j = secs[i]; j < end; j++) |
| 387 | Frames[j].PTS += shift; |
| 388 | } |
| 389 | } else { |
| 390 | sort(Frames.begin(), Frames.end(), PTSComparison); |
| 391 | } |
| 392 | |
| 393 | std::vector<size_t> ReorderTemp; |
| 394 | ReorderTemp.reserve(size()); |
| 395 | |
| 396 | for (size_t i = 0; i < size(); i++) |
| 397 | ReorderTemp.push_back(Frames[i].PosInDecodingOrder); |
| 398 | |
| 399 | for (size_t i = 0; i < size(); i++) |